Paper Review Records
全部论文审稿周期
14 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
632
天
Flip equivalence of ortho-unit polygons
作者
Diego Favela; Nestaly Marín; Adriana Ramírez-Vigueras; Oriol Solé-Pi; Jorge Urrutia展开收起
作者单位
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, USA展开收起
327
天
Ordered Yao graphs: maximum degree, edge density, and clique numbers
作者
Péter Ágoston; Adrian Dumitrescu; Arsenii Sagdeev; Karamjeet Singh; Ji Zeng展开收起
作者单位
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, USA展开收起
168
天
172
天
The Euclidean k-matching problem is NP-hard
作者
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-Lantero展开收起
作者单位
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, Chile展开收起
448
天
An improved exact algorithm for the Euclidean k-Steiner tree problem
作者
Jae Lee; Marcus Brazil; Charl Ras; Doreen Thomas展开收起
作者单位
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, Australia展开收起
238
天
FAQ
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS审稿要多久?
截至2026-11-16,CrushSCI 收录了 COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 的 14 篇完整审稿记录。最快一篇从收稿到录用用了 168 天(Computing maximum cliques in unit disk graphs,2025-09-23 收稿,2026-03-10 录用),最慢一篇用了 810 天;平均 372.6 天,中位数 338.5 天。
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
