CrushSCI.com
提供学术论文选刊润色服务
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 期刊封面 计算机科学
返回期刊列表

Review Cycle Records

JOURNAL OF COMPUTER AND SYSTEM SCIENCES

Elsevier SCIE 非OA
2026新锐 4区2025中科院 3区2025 JCR Q3
535.7平均天数
438中位天数
100最短天数
1,455最长天数
522025发文量

Paper Review Records

全部论文审稿周期

17 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接

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

PDF源文件 DOI 网页
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

PDF源文件 DOI 网页
438 天

Minimizing the weighted number of tardy jobs is W[1]-hard

作者Klaus Heeger; Danny Hermelin

作者单位Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel; Fraunhofer IOSB-INA, Lemgo, Germany

PDF源文件 DOI 网页
650 天

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

PDF源文件 DOI 网页
924 天

On maximal k-edge-connected subgraphs of undirected graphs

作者Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas; Debasish Pattanayak

作者单位University of Ioannina, Greece; LUISS Guido Carli University, Roma, Italy

PDF源文件 DOI 网页
347 天

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests

作者David Mestel; Steven Chaplick; Steven Kelk; Ruben Meuwese

作者单位Department of Advanced Computing Sciences, Maastricht University, the Netherlands

PDF源文件 DOI 网页
593 天

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

PDF源文件 DOI 网页

Expert Matching · Case Demo

把投稿要求,转成可验证的期刊方案

说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。

CrushSCI 在线

客户询问

我是环境工程专业,需要一篇 SCI,希望 3 个月内见刊。没有基金,也没有大牛挂名,可以投哪些期刊?

CrushSCI回复

可以。先按 90 天时限做可行性筛选,同步查找无基金、无知名作者挂靠的典型论文案例,作为选刊依据。重点核对研究质量与期刊 scope。

拟题建议
《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》

样本口径2026 年最近 5 篇有效论文样本

平均审稿96.4 天

中位数77 天

Contact CrushSCI

联系 CrushSCI

扫码添加微信,或留下手机号/微信号,我们将与你确认稿件阶段、编辑需求和投稿计划。

当前选择:论文编辑服务

也可以预留联系方式

手机号和微信号至少填写一项,仅用于本次咨询联系,不会公开。