Paper Review Records
全部论文审稿周期
22 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
485
天
578
天
Simple Realizability of Abstract Topological Graphs
作者
Giordano Da Lozzo; Walter Didimo; Fabrizio Montecchiani; Miriam Münch; Maurizio Patrignani; Ignaz Rutter展开收起
作者单位
1. Roma Tre University, Rome, Italy; 2. University of Perugia, Perugia, Italy; 3. University of Passau, Passau, Germany展开收起
704
天
Nearly Tight Spectral Sparsification of Directed Hypergraphs by a Simple Iterative Sampling Algorithm
作者
Kazusato Oko; Shinsaku Sakaue; Shin-ichi Tanigawa展开收起
作者单位
1. University of California, Berkeley, CA, United States; RIKEN Center for Advanced Intelligence Project, Tokyo, Japan; 2. CyberAgent, Tokyo, Japan; National Institute of Informatics, Tokyo, Japan; Center for Advanced Intelligence Project, RIKEN, Tokyo, Japan展开收起
100
天
Maximum List r -Colorable Induced Subgraphs in \(kP_3\) -Free Graphs
作者
Esther Galby; Paloma T. Lima; Andrea Munaro; Amir Nikabadi展开收起
作者单位
1. Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden; 2. IT University of Copenhagen, Copenhagen, Denmark; 3. University of Parma, Parma, Italy展开收起
439
天
762
天
Edge Multiway Cut and Node Multiway Cut are Hard for Planar Subcubic Graphs
作者
Matthew Johnson; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen展开收起
作者单位
1. Durham University, Durham, UK; 2. Utrecht University, Utrecht, The Netherlands; 3. University of Bristol and Heilbronn Institute for Mathematical Research, Bristol, UK展开收起
FAQ
ALGORITHMICA审稿要多久?
截至2026-11-15,CrushSCI 收录了 ALGORITHMICA 的 22 篇完整审稿记录。最快一篇从收稿到录用用了 42 天(Fault-Tolerant ST-Diameter Oracles,2026-04-13 收稿,2026-05-25 录用),最慢一篇用了 798 天;平均 426.0 天,中位数 382.5 天。
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
