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.
306
days
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
Authors
Michal Dory; Sebastian Forster; Yasamin Nazari; Tijn de VosShow moreShow less
Affiliations
1. University of Haifa, Haifa, Israel; 2. Department of Computer Science, University of Salzburg, Salzburg, Austria; 3. VU Amsterdam, Amsterdam, Netherlands; 4. TU Graz, Graz, AustriaShow moreShow less
463
days
Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples
Authors
Gergely Csáji; David Manlove; Iain McBride; James TrimbleShow moreShow less
Affiliations
1. 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, UKShow moreShow less
277
days
String problems in the congested clique model
Authors
Shay Golan; Matan KrausShow moreShow less
Affiliations
1. 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, IsraelShow moreShow less
780
days
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
Authors
Katrin Casel; Joel D. Day; Pamela Fleischmann; Tomasz Kociumaka; Florin Manea; Markus L. SchmidShow moreShow less
Affiliations
1. 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, GermanyShow moreShow less
252
days
Why Dominance is Not Enough: Lessons from Practical Evolutionary Multi-objective Algorithms
Authors
Duc-Cuong Dang; Andre Opris; Dirk SudholtShow moreShow less
Affiliations
1. Chair of Algorithms for Intelligent Systems, University of Passau, Passau, GermanyShow moreShow less
798
days
Approximate Monotone Local Search for Weighted Problems
Authors
Barış Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani SharmaShow moreShow less
Affiliations
1. 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 KoreaShow moreShow less
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.
