← 返回期刊列表
Review Cycle Records
ACM Transactions on Algorithms
数据更新 2026-07-16 · 完整周期 10 篇 · 日期来源可逐条复核
ACM Transactions on Algorithms已收录10篇完整论文周期样本，平均审稿696.7 天，中位审稿527 天。2025中科院3区，非OA，2025发文量49。页面含论文收到日期、录用日期、PDF、DOI和出版社网页溯源入口。
Latest Papers
最新发表论文审稿周期
审稿天数=录用日期-收到日期；保留 PDF/DOI/网页源链接
598
天
209
天
Incremental Approximate Maximum Flow via Residual Graph Sparsification
作者Gramoz Goranci; Monika Henzinger; Harald Räcke; A. R. Sricharan
作者单位1. Faculty of Computer Science, University of Vienna, Vienna, Austria; 2. Institute of Science and Technology Austria, Klosterneuburg, Austria; 3. Technical University Munich, Munich, Germany; 4. Doctoral School Computer Science DoCS, Faculty of Computer Science, University of Vienna, Vienna, Austria
285
天
Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
作者Sunny Atalig; Alexander Hickerson; Arrdya Srivastav; Tingting Zheng; Marek Chrobak
作者单位1. Computer Science, University of California at Riverside, Riverside, California, USA; 2. Guangdong University of Technology, Guangzhou, China
1,199
天
A \((2+\varepsilon)\) -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, Chile; 2. Indian Institute of Science, India; 3. LIRMM, Université de Montpellier, CNRS, France; 4. University of Augsburg, Germany; 5. Carnegie Mellon University, USA and New York University, USA; 6. Universidad de Chile, Chile and Technical University of Munich, Germany
671
天
706
天
2,100
天
Testing Cluster Structure of Graphs
作者Artur Czumaj; Pan Peng; Christian Sohler
作者单位1. Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry, United Kingdom; 2. School of Computer Science and Technology, University of Science and Technology of China, Hefei, China; 3. Department of Mathematics and Computer Science, University of Cologne, Cologne, Germany
358
天
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
作者Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan
作者单位1. Royal Holloway University of London, Egham, United Kingdom of Great Britain and Northern Ireland; 2. TU Wien, Wien, Austria; 3. DePaul University, Chicago, Illinois, USA; 4. University of Warwick, Coventry, United Kingdom of Great Britain and Northern Ireland
456
天
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
作者Sarita de Berg; Tillmann Miltzow; Frank Staals
作者单位1. Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands and IT University of Copenhagen, Copenhagen, Denmark; 2. Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
385
天
Prophet Secretary and Matching: the Significance of the Largest Item
作者Ziyun Chen; Zhiyi Huang; Dongchen Li; Zhihao Gavin Tang
作者单位1. Paul G. Allen School of Computer Science & Engineering, University of Washington, USA; 2. School of Computing and Data Science, The University of Hong Kong, China; 3. Key Laboratory of Interdisciplinary Research of Computation and Economics, Shanghai University of Finance and Economics, China