CrushSCI.com
提供学术论文选刊润色服务
ALGORITHMICA 期刊封面 计算机科学
返回期刊列表

Review Cycle Records

ALGORITHMICA

Springer SCIE 非OA
2026新锐 4区2025中科院 4区2025 JCR Q3
399.9平均天数
339中位天数
42最短天数
798最长天数
652025发文量

Paper Review Records

全部论文审稿周期

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

463 天

Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples

作者Gergely Csáji; David Manlove; Iain McBride; James Trimble

作者单位1. Institute of Economics, ELTE Centre for Economic and Regional Studies, Budapest, Hungary; 2. Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary; 3. School of Computing Science, University of Glasgow, Glasgow, UK

PDF源文件 DOI 网页
277 天

String problems in the congested clique model

作者Shay Golan; Matan Kraus

作者单位1. Department of Computer Science, School of Computer Science and Artificial Intelligence, Ariel University, Ariel, Israel; 2. Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel

PDF源文件 DOI 网页
780 天

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number

作者Katrin Casel; Joel D. Day; Pamela Fleischmann; Tomasz Kociumaka; Florin Manea; Markus L. Schmid

作者单位1. Computer Science Department, Humboldt-Universität zu Berlin, Berlin, Germany; 2. Department of Computer Science, Loughborough University, Loughborough, UK; 3. Department of Computer Science, Kiel University, Kiel, Germany; 4. Saarland Informatics Campus, Max Planck Institute for Informatics, Saarbrücken, Germany; 5. Computer Science Department, Universität Göttingen, Göttingen, Germany

PDF源文件 DOI 网页
252 天

Why Dominance is Not Enough: Lessons from Practical Evolutionary Multi-objective Algorithms

作者Duc-Cuong Dang; Andre Opris; Dirk Sudholt

作者单位1. Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany

PDF源文件 DOI 网页
798 天

Approximate Monotone Local Search for Weighted Problems

作者Barış Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma

作者单位1. CISPA Helmholtz Center for Information Security, Saarbrücken, Germany; 2. Saarbrücken Graduate School of Computer Science, Saarbrücken, Germany; 3. Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Be’er Sheva, Israel; 4. TU Dresden, Dresden, Germany; 5. DIMAG, Institute for Basic Science, Dajeon, South Korea

PDF源文件 DOI 网页
621 天

MUL-Tree Pruning for Consistency and Compatibility

作者Christopher Hampson; Daniel J. Harvey; Costas S. Iliopoulos; Jesper Jansson; Zara Lim; Wing-Kin Sung

作者单位1. Department of Informatics, King’s College London, London, UK; 2. Graduate School of Informatics, Kyoto University, Kyoto, Japan; 3. Department of Chemical Pathology, The Chinese University of Hong Kong, Hong Kong, China; 4. Laboratory of Computational Genomics, Li Ka Shing Institute of Health Sciences, Hong Kong, China

PDF源文件 DOI 网页
182 天

Reforming an Unfair Allocation by Exchanging Goods

作者Sheung Man Yuen; Ayumi Igarashi; Naoyuki Kamiyama; Warut Suksompong

作者单位1. National University of Singapore, Singapore, Singapore; 2. University of Tokyo, Tokyo, Japan; 3. Kyoto University, Kyoto, Japan

PDF源文件 DOI 网页
42 天

Fault-Tolerant ST-Diameter Oracles

作者Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich; Simon Krogmann; Martin Schirneck

作者单位1. Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, L’Aquila, Italy; 2. Department of Computer Science and Engineering, Indian Institute of Technology Delhi, Delhi, India; 3. Efi Arazi School of Computer Science, Reichman University, Herzliya, Israel; 4. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany; 5. Derpartment of Informatics, Karlsruhe Institute of Technology, Karlsruhe, Germany

PDF源文件 DOI 网页
373 天

Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments

作者Pankaj K. Agarwal; Haim Kaplan; Matthew J. Katz; Micha Sharir

作者单位1. Department of Computer Science, Duke University, Durham, USA; 2. School of Computer Science, Tel Aviv University, Tel Aviv, Israel; 3. The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer Sheva, Israel

PDF源文件 DOI 网页
392 天

A Lower Bound on the Trace Norm of Boolean Matrices and its Applications

作者Tsun-Ming Cheung; Hamed Hatami; Kaave Hosseini; Aleksandar Nikolov; Toniann Pitassi; Morgan Shirley

作者单位1. Institute of Information Science, Academia Sinica, Taipei, Taiwan; 2. School of Computer Science, McGill University, Montreal, Canada; 3. Department of Computer Science, University of Rochester, Rochester, USA; 4. Department of Computer Science, University of Toronto, Toronto, Canada; 5. Department of Computer Science, Columbia University, New York, USA; 6. Department of Computer Science, Lund University, Lund, Sweden

PDF源文件 DOI 网页

Expert Matching · Case Demo

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

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

CrushSCI 在线

客户询问

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

CrushSCI回复

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

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

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

平均审稿96.4 天

中位数77 天

Contact CrushSCI

联系 CrushSCI

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

当前选择:论文编辑服务

也可以预留联系方式

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