期刊审稿周期图谱
ALGORITHMICA 期刊封面
← 返回期刊列表

Review Cycle Records

ALGORITHMICA

Springer 非OA 2026新锐 4区2025中科院 4区 已自动采集 最新完整样本 10 篇 平均 342.9 天

数据更新 2026-07-15 · 完整周期 10 篇 · 日期来源可逐条复核

ALGORITHMICA已收录10篇完整论文周期样本,平均审稿342.9 天,中位审稿339 天。2025中科院4区,非OA,2025发文量65。页面含论文收到日期、录用日期、PDF、DOI和出版社网页溯源入口。

342.9平均天数
339中位天数
42最短天数
736最长天数
10最新论文
652025发文量

Latest Papers

最新发表论文审稿周期

审稿天数=录用日期-收到日期;保留 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. Kyushu 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 网页
199

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games

作者Alistair Benford; Per Kristian Lehre

作者单位1. School of Informatics, University of Edinburgh, Edinburgh, UK; 2. School of Computer Science, University of Birmingham, Birmingham, UK

PDF源文件 DOI 网页
339

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity

作者Tijn de Vos; Aleksander Christiansen

作者单位1. TU Graz, Graz, Austria; 2. Technical University of Denmark, Copenhagen, Denmark

PDF源文件 DOI 网页
736

Counting Polyominoes, Revisited

作者Gill Barequet; Gil Ben-Shachar

作者单位1. Department of Computer Science, The Technion—Israel Institute of Technology, Haifa, Israel

PDF源文件 DOI 网页
206

Compressed Dictionary Matching on Run-Length Encoded Strings

作者Philip Bille; Inge Li Gørtz; Simon J. Puglisi; Simon Rumle Tarnow

作者单位1. DTU Compute, Technical University of Denmark, Kongens Lyngby, Denmark; 2. Department of Computer Science, University of Helsinki, Helsinki, Finland

PDF源文件 DOI 网页
339

Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings

作者Jakob Baumann; Ignaz Rutter; Dirk Sudholt

作者单位1. University of Passau, Passau, Germany

PDF源文件 DOI 网页