CrushSCI.com
提供学术论文选刊润色服务
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 期刊封面 计算机科学
返回期刊列表

Review Cycle Records

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS

Elsevier SCIE 非OA
2026新锐 4区2025中科院 4区2025 JCR Q2
372.6平均天数
338.5中位天数
168最短天数
810最长天数
352025发文量

Paper Review Records

全部论文审稿周期

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

632 天

Flip equivalence of ortho-unit polygons

作者Diego Favela; Nestaly Marín; Adriana Ramírez-Vigueras; Oriol Solé-Pi; Jorge Urrutia

作者单位Posgrado en Ciencia e Ingeniería de la Computación, Universidad Nacional Autónoma de México, Mexico; Departamento de Ciencias de la Computación, Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California, Mexico; Instituto de Matemáticas, Universidad Nacional Autónoma de México, Mexico; Department of Mathematics, Massachusetts Institute of Technology, USA

PDF源文件 DOI 网页
327 天

Ordered Yao graphs: maximum degree, edge density, and clique numbers

作者Péter Ágoston; Adrian Dumitrescu; Arsenii Sagdeev; Karamjeet Singh; Ji Zeng

作者单位Alfréd Rényi Institute of Mathematics, Budapest, Hungary; Charles University, Prague, Czech Republic; Algoresearch L.L.C., Milwaukee, WI, USA; Research Institute of the University of Bucharest, Romania; Karlsruhe Institute of Technology, Karlsruhe, Germany; Indraprastha Institute of Information Technology, Delhi, India; University of California San Diego, La Jolla, CA, USA

PDF源文件 DOI 网页
168 天

Computing maximum cliques in unit disk graphs

作者Anastasiia Tkachenko; Haitao Wang

作者单位Kahlert School of Computing, University of Utah, Salt Lake City, UT 84112, USA

PDF源文件 DOI 网页
172 天

The Euclidean k-matching problem is NP-hard

作者José-Miguel Díaz-Báñez; Ruy Fabila-Monroy; José-Manuel Higes-López; Nestaly Marín; Miguel-Angel Pérez-Cutiño; Pablo Pérez-Lantero

作者单位Department of Applied Mathematics, University of Seville, Spain; Departamento de Matemáticas, Cinvestav, Mexico; Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California, Mexico; Universidad de Santiago de Chile (USACH), Facultad de Ciencia, Departamento de Matemática y Ciencia de la Computación, Chile

PDF源文件 DOI 网页
448 天

An improved exact algorithm for the Euclidean k-Steiner tree problem

作者Jae Lee; Marcus Brazil; Charl Ras; Doreen Thomas

作者单位School of Mathematics and Statistics, University of Melbourne, Australia; Department of Electrical and Electronic Engineering, University of Melbourne, Australia; Department of Mechanical Engineering, University of Melbourne, Australia

PDF源文件 DOI 网页
238 天

2-Cliques in unit disk graphs are 3-dominated

作者A. Karim Abu-Affash; Iliya Lisin

作者单位Software Engineering Department, Shamoon College of Engineering, Beer-Sheva 84100, Israel

PDF源文件 DOI 网页
403 天

Constrained two-line center problems

作者Taehoon Ahn; Sang Won Bae

作者单位Department of Computer Science, Sookmyung Women's University, Seoul, Korea; Division of AI Computer Science and Engineering, Kyonggi University, Suwon, Korea

PDF源文件 DOI 网页
525 天

Optimal right angles crossing graphs

作者Franz J. Brandenburg

作者单位94030 Passau, Germany

PDF源文件 DOI 网页
810 天

Online dominating set and coloring for geometric intersection graphs

作者Minati De; Sambhav Khurana; Satyam Singh

作者单位Dept. of Mathematics, Indian Institute of Technology Delhi, New Delhi, 110016, New Delhi, India; Dept. of Computer Science & Engineering, Texas A&M University, College Station, 77843, TX, USA

PDF源文件 DOI 网页
279 天

Distinct distances between a line and strip

作者Sanjana Das; Adam Sheffer

作者单位Department of Mathematics, Massachusetts Institute of Technology, MA, USA; Department of Mathematics, Baruch College, City University of New York, NY, USA

PDF源文件 DOI 网页

Expert Matching · Case Demo

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

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

CrushSCI 在线

客户询问

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

CrushSCI回复

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

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

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

平均审稿96.4 天

中位数77 天

Contact CrushSCI

联系 CrushSCI

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

当前选择:论文编辑服务

也可以预留联系方式

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