CrushSCI.com
提供学术论文选刊润色服务
ACM Transactions on Algorithms 临时占位封面 计算机科学
返回期刊列表

Review Cycle Records

ACM Transactions on Algorithms

ACM SCIE 非OA
2026新锐 3区2025中科院 3区2025 JCR Q2
685.6平均天数
575中位天数
209最短天数
2,100最长天数
492025发文量

Paper Review Records

全部论文审稿周期

11 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接

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

PDF源文件 DOI 网页
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

PDF源文件 DOI 网页
598 天

Strong Approximations and Irrationality in Financial Networks with Derivatives

作者Stavros D. Ioannidis; Bart de Keijzer; Carmine Ventre

作者单位1. Royal Holloway University of London, Egham, United Kingdom; 2. King’s College London, London, United Kingdom

PDF源文件 DOI 网页
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

PDF源文件 DOI 网页
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

PDF源文件 DOI 网页
671 天

On Parallel k -Center Clustering

作者Sam Coy; Artur Czumaj; Gopinath Mishra

作者单位1. University of Warwick, Coventry, United Kingdom; 2. The Institute of Mathematical Sciences (IMSc), HBNI, Chennai, India

PDF源文件 DOI 网页
706 天

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications

作者Yi-Jun Chang

作者单位1. National University of Singapore, Singapore, Singapore

PDF源文件 DOI 网页
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

PDF源文件 DOI 网页
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

PDF源文件 DOI 网页
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

PDF源文件 DOI 网页

Expert Matching · Case Demo

把投稿要求,转成可验证的期刊方案

说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。

CrushSCI 在线

客户询问

我是环境工程专业,需要一篇 SCI,希望 3 个月内见刊。没有基金,也没有大牛挂名,可以投哪些期刊?

CrushSCI回复

可以。先按 90 天时限做可行性筛选,同步查找无基金、无知名作者挂靠的典型论文案例,作为选刊依据。重点核对研究质量与期刊 scope。

拟题建议
《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》

样本口径2026 年最近 5 篇有效论文样本

平均审稿96.4 天

中位数77 天

Contact CrushSCI

联系 CrushSCI

扫码添加微信,或留下手机号/微信号,我们将与你确认稿件阶段、编辑需求和投稿计划。

当前选择:论文编辑服务

也可以预留联系方式

手机号和微信号至少填写一项,仅用于本次咨询联系,不会公开。