Journal Selection & Manuscript Polishing Services
Computer Science
Computer Science
Paper Review Records
All Paper Review Records
15 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
463
days
Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples
AuthorsGergely Csáji; David Manlove; Iain McBride; James Trimble
Affiliations1. Institute of Economics, ELTE Centre for Economic and Regional Studies, Budapest, Hungary; 2. Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary; 3. School of Computing Science, University of Glasgow, Glasgow, UK
277
days
String problems in the congested clique model
AuthorsShay Golan; Matan Kraus
Affiliations1. Department of Computer Science, School of Computer Science and Artificial Intelligence, Ariel University, Ariel, Israel; 2. Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel
780
days
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
AuthorsKatrin Casel; Joel D. Day; Pamela Fleischmann; Tomasz Kociumaka; Florin Manea; Markus L. Schmid
Affiliations1. Computer Science Department, Humboldt-Universität zu Berlin, Berlin, Germany; 2. Department of Computer Science, Loughborough University, Loughborough, UK; 3. Department of Computer Science, Kiel University, Kiel, Germany; 4. Saarland Informatics Campus, Max Planck Institute for Informatics, Saarbrücken, Germany; 5. Computer Science Department, Universität Göttingen, Göttingen, Germany
252
days
Why Dominance is Not Enough: Lessons from Practical Evolutionary Multi-objective Algorithms
AuthorsDuc-Cuong Dang; Andre Opris; Dirk Sudholt
Affiliations1. Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany
798
days
Approximate Monotone Local Search for Weighted Problems
AuthorsBarış Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma
Affiliations1. CISPA Helmholtz Center for Information Security, Saarbrücken, Germany; 2. Saarbrücken Graduate School of Computer Science, Saarbrücken, Germany; 3. Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Be’er Sheva, Israel; 4. TU Dresden, Dresden, Germany; 5. DIMAG, Institute for Basic Science, Dajeon, South Korea
621
days
MUL-Tree Pruning for Consistency and Compatibility
AuthorsChristopher Hampson; Daniel J. Harvey; Costas S. Iliopoulos; Jesper Jansson; Zara Lim; Wing-Kin Sung
Affiliations1. Department of Informatics, King’s College London, London, UK; 2. Graduate School of Informatics, Kyoto University, Kyoto, Japan; 3. Department of Chemical Pathology, The Chinese University of Hong Kong, Hong Kong, China; 4. Laboratory of Computational Genomics, Li Ka Shing Institute of Health Sciences, Hong Kong, China
182
days
Reforming an Unfair Allocation by Exchanging Goods
AuthorsSheung Man Yuen; Ayumi Igarashi; Naoyuki Kamiyama; Warut Suksompong
Affiliations1. National University of Singapore, Singapore, Singapore; 2. University of Tokyo, Tokyo, Japan; 3. Kyoto University, Kyoto, Japan
42
days
Fault-Tolerant ST-Diameter Oracles
AuthorsDavide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich; Simon Krogmann; Martin Schirneck
Affiliations1. Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, L’Aquila, Italy; 2. Department of Computer Science and Engineering, Indian Institute of Technology Delhi, Delhi, India; 3. Efi Arazi School of Computer Science, Reichman University, Herzliya, Israel; 4. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany; 5. Derpartment of Informatics, Karlsruhe Institute of Technology, Karlsruhe, Germany
373
days
Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments
AuthorsPankaj K. Agarwal; Haim Kaplan; Matthew J. Katz; Micha Sharir
Affiliations1. Department of Computer Science, Duke University, Durham, USA; 2. School of Computer Science, Tel Aviv University, Tel Aviv, Israel; 3. The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer Sheva, Israel
392
days
A Lower Bound on the Trace Norm of Boolean Matrices and its Applications
AuthorsTsun-Ming Cheung; Hamed Hatami; Kaave Hosseini; Aleksandar Nikolov; Toniann Pitassi; Morgan Shirley
Affiliations1. Institute of Information Science, Academia Sinica, Taipei, Taiwan; 2. School of Computer Science, McGill University, Montreal, Canada; 3. Department of Computer Science, University of Rochester, Rochester, USA; 4. Department of Computer Science, University of Toronto, Toronto, Canada; 5. Department of Computer Science, Columbia University, New York, USA; 6. Department of Computer Science, Lund University, Lund, Sweden
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