Computer Science
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.
Maximizing the maximum degree in ordered nearest neighbor graphs
AuthorsPéter Ágoston; Adrian Dumitrescu; Arsenii Sagdeev; Karamjeet Singh; Ji Zeng
AffiliationsAlfréd Rényi Institute of Mathematics, Budapest, Hungary; Algoresearch L.L.C., Milwaukee, WI, USA; Karlsruhe Institute of Technology, Karlsruhe, Germany; Indraprastha Institute of Information Technology, Delhi, India; University of California San Diego, La Jolla, CA, USA
Packing d-dimensional balls into a d + 1-dimensional container
AuthorsHelmut Alt; Sergio Cabello; Otfried Cheong; Ji-won Park; Nadja Seiferth
AffiliationsInstitut für Informatik, Germany; University of Ljubljana, Slovenia; Institute of Mathematics, Physics and Mechanics, Slovenia; SCALGO, Denmark; Université de Lorraine, CNRS, France
On the rectilinear crossing number of complete balanced multipartite graphs and balanced layered graphs
AuthorsRuy Fabila-Monroy; Rosna Paul; Jenifer Viafara-Chanchi; Alexandra Weinberger
AffiliationsDepartamento de Matemáticas, CINVESTAV, Mexico; Institut für Softwaretechnologie, Technische Universität Graz, Austria; Fakultät für Mathematik und Informatik, FernUniversität in Hagen, Hagen, Germany
Algorithms for computing closest points for segments
AuthorsHaitao Wang
AffiliationsKahlert School of Computing, University of Utah, Salt Lake City, UT 84112, USA
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.