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.
A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games
AuthorsAlistair Benford; Per Kristian Lehre
Affiliations1. School of Informatics, University of Edinburgh, Edinburgh, UK; 2. School of Computer Science, University of Birmingham, Birmingham, UK
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
AuthorsTijn de Vos; Aleksander Christiansen
Affiliations1. TU Graz, Graz, Austria; 2. Technical University of Denmark, Copenhagen, Denmark
Counting Polyominoes, Revisited
AuthorsGill Barequet; Gil Ben-Shachar
Affiliations1. Department of Computer Science, The Technion—Israel Institute of Technology, Haifa, Israel
Compressed Dictionary Matching on Run-Length Encoded Strings
AuthorsPhilip Bille; Inge Li Gørtz; Simon J. Puglisi; Simon Rumle Tarnow
Affiliations1. DTU Compute, Technical University of Denmark, Kongens Lyngby, Denmark; 2. Department of Computer Science, University of Helsinki, Helsinki, Finland
Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings
AuthorsJakob Baumann; Ignaz Rutter; Dirk Sudholt
Affiliations1. University of Passau, Passau, Germany
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.