Paper Review Records
全部论文审稿周期
16 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
384
天
Global Least Common Ancestor (LCA) Networks
作者
Anna Lindeberg; Bruno J. Schmidt; Manoj Changat; Ameera Vaheeda Shanavas; Peter F. Stadler; Marc Hellmuth展开收起
作者单位
1. Department of Mathematics, Faculty of Science, Stockholm University, Stockholm, Sweden; 2. Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany; 3. Bioinformatics Group, Department of Computer Science & Interdisciplinary Center for Bioinformatics, Leipzig University, Leipzig, Germany; 4. Department of Futures Studies, University of Kerala, Thiruvananthapuram, India; 5. Zuse School for Embedded and Composite Artificial Intelligence (SECAI) & Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI) Dresden-Leipzig, Leipzig, Germany; 6. German Centre for Integrative Biodiversity Research (iDiv) Halle-Jena-Leipzig, Leipzig, Germany; 7. Centre for Biotechnology and Biomedicine & LIFE - Leipzig Research Centre for Civilization Diseases, Leipzig University, Leipzig, Germany; 8. Department of Theoretical Chemistry, University of Vienna, Vienna, Austria; 9. Facultad de Ciencias, Universidad National de Colombia, Bogotá, Colombia; 10. Santa Fe Institute, Santa Fe, USA; 11. Theoretical Computer Science Group, Faculty of Mathematics and Computer Science, Leipzig University, Leipzig, Germany展开收起
285
天
292
天
853
天
1,110
天
Tensor Products of Multimatroids and a Brylawski-Type Formula for the Transition Polynomial
作者
Iain Moffatt; Steven Noble; Maya Thompson展开收起
作者单位
1. Department of Mathematics, Royal Holloway, University of London, Egham, UK; 2. School of Computer Science, University of Leeds, Leeds, UK展开收起
178
天
Strengthening the Balanced Set Condition for the Distance-Regular Graph of the Bilinear Forms
作者
Paul Terwilliger; Jason Williford展开收起
作者单位
1. Department of Mathematics, University of Wisconsin, Madison, USA; 2. Department of Mathematics and Statistics, University of Wyoming, Laramie, USA展开收起
FAQ
Annals of Combinatorics审稿要多久?
截至2026-11-19,CrushSCI 收录了 Annals of Combinatorics 的 16 篇完整审稿记录。最快一篇从收稿到录用用了 127 天(Bessenrodt–Ono Inequalities for \(\ell \) -Tuples of Pairwise Commuting Permutations,2025-02-03 收稿,2025-06-10 录用),最慢一篇用了 1110 天;平均 380.2 天,中位数 293.5 天。
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
