计算机科学
Paper Review Records
全部论文审稿周期
11 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs
作者Haim Kaplan; Matthew J. Katz; Rachel Saban; Micha Sharir
作者单位1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel; 2. The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel
A (2 + ε )-Approximation Algorithm for Maximum Independent Set of Rectangles
作者Waldo Gálvez; Arindam Khan; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese
作者单位1. Universidad de Concepción, Concepción, Chile; 2. Indian Institute of Science, Bangalore, India; 3. LIRMM, Université de Montpellier, CNRS, Montpellier, France; 4. University of Augsburg, Augsburg, Germany; 5. Carnegie Mellon University, Pittsburgh, Pennsylvania, USA and New York University, New York, New York, USA; 6. Universidad de Chile, Santiago, Chile and Technical University of Munich, Munich, Germany
Incremental Approximate Maximum Flow via Residual Graph Sparsification
作者Gramoz Goranci; Monika Henzinger; Harald Räcke; A. R. Sricharan
作者单位1. Faculty of Computer Science, University of Vienna, Vienna, Austria; 2. Institute of Science and Technology Austria, Klosterneuburg, Austria; 3. Technical University Munich, Munich, Germany; 4. Doctoral School Computer Science DoCS, Faculty of Computer Science, University of Vienna, Vienna, Austria
Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
作者Sunny Atalig; Alexander Hickerson; Arrdya Srivastav; Tingting Zheng; Marek Chrobak
作者单位1. Computer Science, University of California at Riverside, Riverside, California, USA; 2. Guangdong University of Technology, Guangzhou, China
Testing Cluster Structure of Graphs
作者Artur Czumaj; Pan Peng; Christian Sohler
作者单位1. Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry, United Kingdom; 2. School of Computer Science and Technology, University of Science and Technology of China, Hefei, China; 3. Department of Mathematics and Computer Science, University of Cologne, Cologne, Germany
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
作者Argyrios Deligkas; Eduard Eiben; Robert Ganian; Iyad Kanj; M. S. Ramanujan
作者单位1. Royal Holloway University of London, Egham, United Kingdom of Great Britain and Northern Ireland; 2. TU Wien, Wien, Austria; 3. DePaul University, Chicago, Illinois, USA; 4. University of Warwick, Coventry, United Kingdom of Great Britain and Northern Ireland
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
作者Sarita de Berg; Tillmann Miltzow; Frank Staals
作者单位1. Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands and IT University of Copenhagen, Copenhagen, Denmark; 2. Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。