Journal Selection & Manuscript Polishing Services
Computer Science
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.
632
days
Flip equivalence of ortho-unit polygons
AuthorsDiego Favela; Nestaly Marín; Adriana Ramírez-Vigueras; Oriol Solé-Pi; Jorge Urrutia
AffiliationsPosgrado 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, USA
327
days
Ordered Yao graphs: maximum degree, edge density, and clique numbers
AuthorsPéter Ágoston; Adrian Dumitrescu; Arsenii Sagdeev; Karamjeet Singh; Ji Zeng
AffiliationsAlfré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, USA
168
days
Computing maximum cliques in unit disk graphs
AuthorsAnastasiia Tkachenko; Haitao Wang
AffiliationsKahlert School of Computing, University of Utah, Salt Lake City, UT 84112, USA
172
days
The Euclidean k-matching problem is NP-hard
AuthorsJosé-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-Lantero
AffiliationsDepartment 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, Chile
448
days
An improved exact algorithm for the Euclidean k-Steiner tree problem
AuthorsJae Lee; Marcus Brazil; Charl Ras; Doreen Thomas
AffiliationsSchool 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, Australia
238
days
2-Cliques in unit disk graphs are 3-dominated
AuthorsA. Karim Abu-Affash; Iliya Lisin
AffiliationsSoftware Engineering Department, Shamoon College of Engineering, Beer-Sheva 84100, Israel
403
days
Constrained two-line center problems
AuthorsTaehoon Ahn; Sang Won Bae
AffiliationsDepartment of Computer Science, Sookmyung Women's University, Seoul, Korea; Division of AI Computer Science and Engineering, Kyonggi University, Suwon, Korea
525
days
Optimal right angles crossing graphs
AuthorsFranz J. Brandenburg
Affiliations94030 Passau, Germany
810
days
Online dominating set and coloring for geometric intersection graphs
AuthorsMinati De; Sambhav Khurana; Satyam Singh
AffiliationsDept. of Mathematics, Indian Institute of Technology Delhi, New Delhi, 110016, New Delhi, India; Dept. of Computer Science & Engineering, Texas A&M University, College Station, 77843, TX, USA
279
days
Distinct distances between a line and strip
AuthorsSanjana Das; Adam Sheffer
AffiliationsDepartment of Mathematics, Massachusetts Institute of Technology, MA, USA; Department of Mathematics, Baruch College, City University of New York, NY, 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.
Client
I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?
CrushSCI
Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.
- Suggested title
- Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment
- Database shortlist
- Environmental Technology & Innovation
SampleLatest 5 valid paper samples from 2026
Average review96.4 days
Median77 days