Paper Review Records
全部论文审稿周期
15 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
164
天
555
天
133
天
When Is String Reconstruction Using de Bruijn Graphs Hard?
作者
Ben Bals; Benjamin Aram Berendsohn; Sebastiaan van Krieken; Solon P. Pissis; Leen Stougie; Hilde Verbeek展开收起
作者单位
1. Centrum Wiskunde en Informatica, Amsterdam, The Netherlands and Vrije Universiteit Amsterdam, Amsterdam, The Netherlands; 2. Max-Planck-Institut für Informatik, Saarbrücken, Germany; 3. Delft University of Technology, Delft, The Netherlands; 4. The Cyprus Institute, Nicosia, Cyprus; 5. Centrum Wiskunde en Informatica, Amsterdam, The Netherlands展开收起
399
天
575
天
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs
作者
Haim Kaplan; Matthew J. Katz; Rachel Saban; Micha Sharir展开收起
作者单位
1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel; 2. The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel展开收起
1,199
天
A (2 + ε )-Approximation Algorithm for Maximum Independent Set of Rectangles
作者
Waldo Gálvez; Arindam Khan; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese展开收起
作者单位
1. Universidad de Concepción, Concepción, Chile; 2. Indian Institute of Science, Bangalore, India; 3. LIRMM, Université de Montpellier, CNRS, Montpellier, France; 4. University of Augsburg, Augsburg, Germany; 5. Carnegie Mellon University, Pittsburgh, Pennsylvania, USA and New York University, New York, New York, USA; 6. Universidad de Chile, Santiago, Chile and Technical University of Munich, Munich, Germany展开收起
FAQ
ACM Transactions on Algorithms审稿要多久?
截至2026-11-16,CrushSCI 收录了 ACM Transactions on Algorithms 的 15 篇完整审稿记录。最快一篇从收稿到录用用了 133 天(When Is String Reconstruction Using de Bruijn Graphs Hard?,2026-04-02 收稿,2026-08-13 录用),最慢一篇用了 2100 天;平均 586.2 天,中位数 456 天。
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
