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.
485
days
Single Machine Scheduling with Few Deadlines
Authors
Klaus Heeger; Danny Hermelin; Dvir ShabtayShow moreShow less
Affiliations
1. Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel; 2. Fraunhofer IOSB-INA, Lemgo, GermanyShow moreShow less
578
days
Simple Realizability of Abstract Topological Graphs
Authors
Giordano Da Lozzo; Walter Didimo; Fabrizio Montecchiani; Miriam Münch; Maurizio Patrignani; Ignaz RutterShow moreShow less
Affiliations
1. Roma Tre University, Rome, Italy; 2. University of Perugia, Perugia, Italy; 3. University of Passau, Passau, GermanyShow moreShow less
704
days
Nearly Tight Spectral Sparsification of Directed Hypergraphs by a Simple Iterative Sampling Algorithm
Authors
Kazusato Oko; Shinsaku Sakaue; Shin-ichi TanigawaShow moreShow less
Affiliations
1. University of California, Berkeley, CA, United States; RIKEN Center for Advanced Intelligence Project, Tokyo, Japan; 2. CyberAgent, Tokyo, Japan; National Institute of Informatics, Tokyo, Japan; Center for Advanced Intelligence Project, RIKEN, Tokyo, JapanShow moreShow less
100
days
Maximum List r -Colorable Induced Subgraphs in \(kP_3\) -Free Graphs
Authors
Esther Galby; Paloma T. Lima; Andrea Munaro; Amir NikabadiShow moreShow less
Affiliations
1. Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden; 2. IT University of Copenhagen, Copenhagen, Denmark; 3. University of Parma, Parma, ItalyShow moreShow less
439
days
Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
Authors
Shi LiShow moreShow less
Affiliations
1. School of Computer Science, Nanjing University, Nanjing, ChinaShow moreShow less
762
days
Edge Multiway Cut and Node Multiway Cut are Hard for Planar Subcubic Graphs
Authors
Matthew Johnson; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van LeeuwenShow moreShow less
Affiliations
1. Durham University, Durham, UK; 2. Utrecht University, Utrecht, The Netherlands; 3. University of Bristol and Heilbronn Institute for Mathematical Research, Bristol, UKShow moreShow less
FAQ
How long does ALGORITHMICA take to review a manuscript?
As of 2026-11-15, CrushSCI has 22 complete review records for ALGORITHMICA. The fastest paper went from submission to acceptance in 42 days (Fault-Tolerant ST-Diameter Oracles, received 2026-04-13, accepted 2026-05-25); the slowest took 798 days. The average is 426.0 days and the median is 382.5 days.
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.
