CrushSCI.com
643.5平均天数
544中位天数
199最短天数
1,892最长天数
922025发文量

Paper Review Records

全部论文审稿周期

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

661 天

The k‐Radius of 2‐Connected Graphs

作者
Peter Dankelmann; Paul Horn展开收起
作者单位
1. Department of Mathematics and Applied Mathematics University of Johannesburg Johannesburg South Africa; 2. Department of Mathematics University of Denver Denver Colorado USA展开收起
PDF源文件 DOI 网页
510 天

B‐Coloring of Planar Graphs

作者
Jiangxu Kong; Yiqiao Wang; Mengmeng Zheng展开收起
作者单位
1. School of Mathematics Hangzhou Normal University Hangzhou China; 2. Department of Mathematics Beijing University of Technology Beijing China; 3. School of Mathematical Sciences Zhejiang Normal University Jinhua China展开收起
PDF源文件 DOI 网页
502 天

Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs

作者
Stefanie Gerke; Gregory Gutin; Anders Yeo; Yacong Zhou展开收起
作者单位
1. Department of Mathematics Royal Holloway University of London Egham UK; 2. Department of Computer Science Royal Holloway University of London Egham UK; 3. Department of Mathematics and Computer Science University of Southern Denmark Odense Denmark; 4. Department of Mathematics University of Johannesburg Auckland Park Johannesburg South Africa; 5. Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China展开收起
PDF源文件 DOI 网页
524 天

Realizing Degree Sequences With S3‐Connected Graphs

作者
Rui Guan; Chenglin Jiang; Hong‐Jian Lai; Jiaao Li; Xinyuan Li展开收起
作者单位
1. School of Mathematical Sciences and LPMC Nankai University Tianjin China; 2. School of Mathematics and Systems Science Guangdong Polytechnic Normal University Guangzhou China; 3. Department of Mathematics West Virginia University Morgantown West Virginia USA展开收起
PDF源文件 DOI 网页
544 天

On a Clique‐Building Game of Erdős

作者
Alexandru Malekshahian; Sam Spiro展开收起
作者单位
1. Department of Mathematics King's College London London England; 2. Mathematical Institute University of Oxford Oxford England; 3. Department of of Mathematics Georgia State University Atlanta Georgia USA展开收起
PDF源文件 DOI 网页
645 天

On the Hardness of Switching to a Small Number of Edges

作者
Vít Jelínek; Eva Jelínková; Jan Kratochvíl展开收起
作者单位
1. Computer Science Institute Faculty of Mathematics and Physics, Charles University Prague Czech Republic; 2. Department of Mathematics University of Chemistry and Technology Prague Czech Republic; 3. Department of Applied Mathematics Faculty of Mathematics and Physics, Charles University Prague Czech Republic展开收起
PDF源文件 DOI 网页

Expert Matching · Case Demo

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

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

我们会在半小时内回复。

CrushSCI 在线

客户询问

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

CrushSCI回复

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

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

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

平均审稿62 天

中位数65 天

Contact CrushSCI

联系 CrushSCI

留下手机号或微信号,我们将与你确认学术润色、结构优化或一对一辅导咨询需求。

我们会在半小时内回复。

当前选择:学术咨询服务

预留联系方式

也可以直接发送邮件至 [email protected]

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