提供学术论文选刊润色服务
数学
数学
Paper Review Records
全部论文审稿周期
20 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期；保留 PDF/DOI/网页源链接
400
天
324
天
Total-neighbor-distinguishing coloring by sums of fractals of generalized Sierpiński graphs
作者Miguel Del-Rio-Palma; Carlos Arturo Rodriguez Palma; Simone Dantas
作者单位1. IME, Universidade Federal Fluminense, Niterói, Brazil; 2. CCET, Universidade Federal do Maranhão, São Luís, Brazil; 3. UIS, Universidad Industrial de Santander, Bucaramanga, Colombia
789
天
Shortest longest-path graph orientations
作者Yuichi Asahiro; Jesper Jansson; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono; Quan Xue; Shay Zakov
作者单位1. Kyushu Sangyo University, Fukuoka, Japan; 2. Kyoto University, Kyoto, Japan; 3. Stein Faculty of Computer and Information Science, Ben Gurion University of the Negev, Be’er Sheva, Israel; 4. Kyushu Institute of Technology, Iizuka, Japan; 5. Nagoya University, Nagoya, Japan; 6. The University of Hong Kong, Hong Kong, China; 7. Ruppin Academic Center, Kfar Monash, Israel
525
天
Perfect hierarchical matchings in graphs
作者Ian G. Ludden; Ellen Veomett; Sheldon H. Jacobson
作者单位1. Department of Computer Science and Software Engineering, Rose-Hulman Institute of Technology, Terre Haute, USA; 2. Department of Computer Science, University of San Francisco, San Francisco, USA; 3. Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, USA
226
天
447
天
555
天
Maximum linear arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs
作者Lluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho
作者单位1. Quantitative, Mathematical and Computational Linguistics Research Group, Department of Computer Science, Universitat Politècnica de Catalunya, Barcelona, Spain
300
天
808
天
Partial Fitch graphs: characterization, satisfiability and complexity
作者Marc Hellmuth; Annachiara Korchmaros; José Antonio Ramírez-Rafael; Bruno Schmidt; Peter F. Stadler; Sandhya Thekkumpadan Puthiyaveedu
作者单位1. Theoretical Computer Science Group, Department of Computer Science, Universität Leipzig, Leipzig, Germany; 2. Department of Mathematics, Faculty of Science, Stockholm University, Stockholm, Sweden; 3. Bioinformatics Group, Department of Computer Science & Interdisciplinary Center for Bioinformatics, Universität Leipzig, Leipzig, Germany; 4. Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany; 5. Facultad de Ciencias, Universidad National de Colombia, Bogotá, Colombia; 6. Competence Center for Scalable Data Services and Solutions Dresden/Leipzig (scaDS.AI), School of Embedded and Compositive Artificial Intelligence, Universität Leipzig, Leipzig, Germany; 7. Department of Theoretical Chemistry, University of Vienna, Wien, Austria; 8. Center for Non-coding RNA in Technology and Health, University of Copenhagen, Frederiksberg C, Denmark; 9. Santa Fe Institute, Santa Fe, USA
1,179
天
Efficient algorithms for computing the edit distance with non-overlapping inversions
作者Kuan-Lin Lai; Shie-Yan Lee; Chang-Biau Yang; Kuo-Tsung Tseng
作者单位1. Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan; 2. Department of Shipping and Transportation Management, National Kaohsiung University of Science and Technology, Kaohsiung, Taiwan
Expert Matching · Case Demo
把投稿要求，转成可验证的期刊方案
说清专业、时限和作者背景，CrushSCI 结合真实审稿样本，给出拟题方向、期刊初筛与周期判断。
客户询问
我是环境工程专业，需要一篇 SCI，希望 3 个月内见刊。没有基金，也没有大牛挂名，可以投哪些期刊？
CrushSCI回复
可以。先按 90 天时限做可行性筛选，同步查找无基金、无知名作者挂靠的典型论文案例，作为选刊依据。重点核对研究质量与期刊 scope。
- 拟题建议
- 《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》
样本口径2026 年最近 5 篇有效论文样本
平均审稿96.4 天
中位数77 天