Paper Review Records
All Paper Review Records
14 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
632
days
Flip equivalence of ortho-unit polygons
Authors
Diego Favela; Nestaly Marín; Adriana Ramírez-Vigueras; Oriol Solé-Pi; Jorge UrrutiaShow moreShow less
Affiliations
Posgrado en Ciencia e Ingeniería de la Computación, Universidad Nacional Autónoma de México, Mexico; Departamento de Ciencias de la Computación, Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California, Mexico; Instituto de Matemáticas, Universidad Nacional Autónoma de México, Mexico; Department of Mathematics, Massachusetts Institute of Technology, USAShow moreShow less
327
days
Ordered Yao graphs: maximum degree, edge density, and clique numbers
Authors
Péter Ágoston; Adrian Dumitrescu; Arsenii Sagdeev; Karamjeet Singh; Ji ZengShow moreShow less
Affiliations
Alfréd Rényi Institute of Mathematics, Budapest, Hungary; Charles University, Prague, Czech Republic; Algoresearch L.L.C., Milwaukee, WI, USA; Research Institute of the University of Bucharest, Romania; Karlsruhe Institute of Technology, Karlsruhe, Germany; Indraprastha Institute of Information Technology, Delhi, India; University of California San Diego, La Jolla, CA, USAShow moreShow less
168
days
Computing maximum cliques in unit disk graphs
Authors
Anastasiia Tkachenko; Haitao WangShow moreShow less
Affiliations
Kahlert School of Computing, University of Utah, Salt Lake City, UT 84112, USAShow moreShow less
172
days
The Euclidean k-matching problem is NP-hard
Authors
José-Miguel Díaz-Báñez; Ruy Fabila-Monroy; José-Manuel Higes-López; Nestaly Marín; Miguel-Angel Pérez-Cutiño; Pablo Pérez-LanteroShow moreShow less
Affiliations
Department of Applied Mathematics, University of Seville, Spain; Departamento de Matemáticas, Cinvestav, Mexico; Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California, Mexico; Universidad de Santiago de Chile (USACH), Facultad de Ciencia, Departamento de Matemática y Ciencia de la Computación, ChileShow moreShow less
448
days
An improved exact algorithm for the Euclidean k-Steiner tree problem
Authors
Jae Lee; Marcus Brazil; Charl Ras; Doreen ThomasShow moreShow less
Affiliations
School of Mathematics and Statistics, University of Melbourne, Australia; Department of Electrical and Electronic Engineering, University of Melbourne, Australia; Department of Mechanical Engineering, University of Melbourne, AustraliaShow moreShow less
238
days
2-Cliques in unit disk graphs are 3-dominated
Authors
A. Karim Abu-Affash; Iliya LisinShow moreShow less
Affiliations
Software Engineering Department, Shamoon College of Engineering, Beer-Sheva 84100, IsraelShow moreShow less
FAQ
How long does COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS take to review a manuscript?
As of 2026-11-16, CrushSCI has 14 complete review records for COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS. The fastest paper went from submission to acceptance in 168 days (Computing maximum cliques in unit disk graphs, received 2025-09-23, accepted 2026-03-10); the slowest took 810 days. The average is 372.6 days and the median is 338.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.
