计算机科学
Paper Review Records
全部论文审稿周期
14 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
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
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
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
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
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
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。