Journal Selection & Manuscript Polishing Services
Computer Science
Computer Science
Paper Review Records
All Paper Review Records
11 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
575
days
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs
AuthorsHaim Kaplan; Matthew J. Katz; Rachel Saban; Micha Sharir
Affiliations1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel; 2. The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel
1,199
days
A (2 + ε )-Approximation Algorithm for Maximum Independent Set of Rectangles
AuthorsWaldo Gálvez; Arindam Khan; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese
Affiliations1. Universidad de Concepción, Concepción, Chile; 2. Indian Institute of Science, Bangalore, India; 3. LIRMM, Université de Montpellier, CNRS, Montpellier, France; 4. University of Augsburg, Augsburg, Germany; 5. Carnegie Mellon University, Pittsburgh, Pennsylvania, USA and New York University, New York, New York, USA; 6. Universidad de Chile, Santiago, Chile and Technical University of Munich, Munich, Germany
598
days
Strong Approximations and Irrationality in Financial Networks with Derivatives
AuthorsStavros D. Ioannidis; Bart de Keijzer; Carmine Ventre
Affiliations1. Royal Holloway University of London, Egham, United Kingdom; 2. King’s College London, London, United Kingdom
209
days
Incremental Approximate Maximum Flow via Residual Graph Sparsification
AuthorsGramoz Goranci; Monika Henzinger; Harald Räcke; A. R. Sricharan
Affiliations1. Faculty of Computer Science, University of Vienna, Vienna, Austria; 2. Institute of Science and Technology Austria, Klosterneuburg, Austria; 3. Technical University Munich, Munich, Germany; 4. Doctoral School Computer Science DoCS, Faculty of Computer Science, University of Vienna, Vienna, Austria
285
days
Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
AuthorsSunny Atalig; Alexander Hickerson; Arrdya Srivastav; Tingting Zheng; Marek Chrobak
Affiliations1. Computer Science, University of California at Riverside, Riverside, California, USA; 2. Guangdong University of Technology, Guangzhou, China
671
days
On Parallel k -Center Clustering
AuthorsSam Coy; Artur Czumaj; Gopinath Mishra
Affiliations1. University of Warwick, Coventry, United Kingdom; 2. The Institute of Mathematical Sciences (IMSc), HBNI, Chennai, India
706
days
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
AuthorsYi-Jun Chang
Affiliations1. National University of Singapore, Singapore, Singapore
2,100
days
Testing Cluster Structure of Graphs
AuthorsArtur Czumaj; Pan Peng; Christian Sohler
Affiliations1. Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry, United Kingdom; 2. School of Computer Science and Technology, University of Science and Technology of China, Hefei, China; 3. Department of Mathematics and Computer Science, University of Cologne, Cologne, Germany
358
days
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
AuthorsArgyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan
Affiliations1. Royal Holloway University of London, Egham, United Kingdom of Great Britain and Northern Ireland; 2. TU Wien, Wien, Austria; 3. DePaul University, Chicago, Illinois, USA; 4. University of Warwick, Coventry, United Kingdom of Great Britain and Northern Ireland
456
days
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
AuthorsSarita de Berg; Tillmann Miltzow; Frank Staals
Affiliations1. Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands and IT University of Copenhagen, Copenhagen, Denmark; 2. Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
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.
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
- Database shortlist
- Environmental Technology & Innovation
SampleLatest 5 valid paper samples from 2026
Average review96.4 days
Median77 days