Paper Review Records
全部论文审稿周期
22 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
1,066
天
Roman census: Enumerating and counting Roman dominating functions on graph classes
作者
Faisal N. Abu-Khzam; Henning Fernau; Kevin Mann展开收起
作者单位
Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon; Universität Trier, Fachbereich IV, Informatikwissenschaften, Germany展开收起
260
天
Can you link up with treewidth?
作者
Radu Curticapean; Simon Döring; Daniel Neuen; Jiaheng Wang展开收起
作者单位
University of Regensburg, Germany; IT University of Copenhagen, Denmark; Max Planck Institute for Informatics and Saarland University, Germany; TU Dresden, Germany; University of Helsinki, Finland展开收起
285
天
665
天
A faster algorithm for constructing the frequency difference consensus tree
作者
Jesper Jansson; Wing-Kin Sung; Seyed Ali Tabatabaee; Yutong Yang展开收起
作者单位
Kyoto University, Kyoto, Japan; The Chinese University of Hong Kong, Hong Kong, China; Hong Kong Genome Institute, Hong Kong Science Park, Hong Kong, China; University of British Columbia, Vancouver, Canada展开收起
100
天
Tree decompositions meet induced matchings: beyond Max Weight Independent Set
作者
Paloma T. de Lima; Martin Milanič; Peter Muršič; Karolina Okrasa; Paweł Rzążewski; Kenny Štorgel展开收起
作者单位
Norwegian School of Economics, Norway; IT University of Copenhagen, Denmark; FAMNIT and IAM, University of Primorska, Slovenia; FAMNIT, University of Primorska, Slovenia; Warsaw University of Technology, Poland; University of Oxford, UK; Warsaw University of Tech. & Univ. of Warsaw, Poland; Faculty of Information Studies in Novo mesto & FAMNIT, Univ. of Primorska, Slovenia展开收起
438
天
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
