计算机科学
Paper Review Records
全部论文审稿周期
17 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
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
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
When is a set of phylogenetic trees displayed by a normal network?
作者Magnus Bordewich; Simone Linz; Charles Semple
作者单位Department of Computer Science, Durham University, United Kingdom; School of Computer Science, University of Auckland, Auckland, New Zealand; School of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand
Parameterized complexity of submodular minimization under uncertainty
作者Naonori Kakimura; Ildikó Schlotter
作者单位Department of Mathematics, Keio University, 3-14-1, Hiyoshi, Yokohama, 223-8522, Japan; ELTE Centre for Economic and Regional Studies, Budapest, Hungary; Budapest University of Technology and Economics, Budapest, Hungary
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。