CrushSCI.com
443.8Average days
363.5Median days
107Fastest days
1,083Longest days
412025 publications

Paper Review Records

All Paper Review Records

22 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.

276 days

Generosity and forgiveness: The importance of nuanced reputation

Authors
Nathan Griffiths; Nir OrenShow moreShow less
Affiliations
1. University of Warwick, Coventry, UK; 2. University of Aberdeen, Aberdeen, ScotlandShow moreShow less
Source PDF DOI Publisher page
656 days

Parameterized complexity of incomplete connected fair division

Authors
Harmender Gahlawat; Meirav ZehaviShow moreShow less
Affiliations
1. Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, India; 2. Ben-Gurion University of the Negev, Beersheba, IsraelShow moreShow less
Source PDF DOI Publisher page
226 days

AEGIS-RL: Abstract, Explainable Graphs for Integrated Safety in RL

Authors
Tuan Le; Risal Shefin; Debashis Gupta; Thai Le; Sarra AlqahtaniShow moreShow less
Affiliations
1. Computer Science, Iowa State University, Ames, USA; 2. Computer Science, Wake Forest University, Winston-Salem, USA; 3. Computer Science, Indiana University, Bloomington, USAShow moreShow less
Source PDF DOI Publisher page
201 days

\(\textsf {EFX}\) allocations and orientations on bipartite multi-graphs: a complete picture

Authors
Mahyar Afshinmehr; Alireza Danaei; Mehrafarin Kazemi; Kurt Mehlhorn; Nidhi RathiShow moreShow less
Affiliations
1. Department of Computer Science, Linacre College, University of Oxford, Oxford, UK; 2. Massachusetts Institute of Technology, Cambridge, USA; 3. Max Planck Institute for Software Systems, SIC, Saarbrücken, Germany; 4. Max Planck Institute for Informatics, SIC, Saarbrücken, Germany; 5. University of Warsaw, Warsaw, PolandShow moreShow less
Source PDF DOI Publisher page
386 days

Concise representations and complexity results for welfare-maximizing combinatorial assignment

Authors
Fredrik Präntare; Leif Eriksson; George Osipov; Fredrik Heintz; Peter JonssonShow moreShow less
Affiliations
1. Department of Computer and Information Science, Linköpings University, Linköping, Sweden; 2. Department of Computer Science, Royal Holloway, University of London, London, UKShow moreShow less
Source PDF DOI Publisher page
776 days

Traveling salesman games: semicore allocations for collaborative transportation in short food supply chains

Authors
Nicolas Besson; Sylvain Bouveret; Nadia Brauner; Nicolas BrulardShow moreShow less
Affiliations
1. G-SCOP, Univ. Grenoble Alpes, CNRS, Grenoble INP, Grenoble, France; 2. LIG, Univ. Grenoble Alpes, CNRS, Inria, Grenoble INP, Grenoble, France; 3. Holiag, Neuville-sur-Saône, FranceShow moreShow less
Source PDF DOI Publisher page

Expert Matching · Case Demo

Turn Your Submission Goalsinto a Verifiable Journal Plan

Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.

We will reply within 30 minutes.

CrushSCI online

Client

I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?

CrushSCI

Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.

Suggested title
Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment

SampleLatest 5 valid paper samples from 2026

Average review62 days

Median65 days

Contact CrushSCI

Contact CrushSCI

Leave your email address to discuss academic polishing, structural refinement, or one-to-one guidance.

We will reply within 30 minutes.

Selected service: Academic Consulting Service

Leave your email address

Or email us directly at [email protected]

Enter your email address so we can reply. Your details will remain private.