Paper Review Records
全部论文审稿周期
15 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
176
天
Unavoidable patterns and plane paths in dense topological graphs
作者
Balázs Keszegh; Andrew Suk; Gábor Tardos; Ji Zeng展开收起
作者单位
HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary; ELTE Eötvös Loránd University, Budapest, Hungary; Department of Mathematics, University of California at San Diego, La Jolla, CA, 92093, USA展开收起
342
天
304
天
Statistics of Erdős–Rényi random numerical semigroups
作者
Noah Kravitz; Santiago Morales; Carl Schildkraut展开收起
作者单位
Department of Mathematics, Princeton University, Princeton, NJ 08540, USA; Graduate Group in Applied Mathematics, University of California, Davis, Davis, CA 95616, USA; Department of Mathematics, Stanford University, Stanford, CA 94305, USA展开收起
496
天
101
天
Advances on two spectral conjectures regarding booksize of graphs
作者
Mingqing Zhai; Rui Li; Zhenzhen Lou展开收起
作者单位
School of Mathematics and Statistics, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu, China; School of Mathematics, Hohai University, Nanjing 211100, Jiangsu, China; School of Mathematics, University of Shanghai for Science and Technology, Shanghai 200093, China展开收起
213
天
Twin-width VIIIa: Delineation
作者
Édouard Bonnet; Dibyayan Chakraborty; Eun Jung Kim; Noleen Köhler; Raul Lopes; Stéphan Thomassé展开收起
作者单位
Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, Lyon, France; School of Computer Science, University of Leeds, Leeds, United Kingdom; School of Computing, KAIST, Daejeon, South Korea; Institute for Basic Science, Discrete Mathematics Group, Daejeon, South Korea; Hamburg University of Technology, Institute for Algorithms and Complexity, Hamburg, Germany展开收起
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
