| 2018 | Online Makespan Scheduling with Job Migration on Uniform Machines. | Matthias Englert, David Mezlaf, Matthias Westermann |
| 2018 | Improved Time and Space Bounds for Dynamic Range Mode. | Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund |
| 2018 | Truthful Prompt Scheduling for Minimizing Sum of Completion Times. | Alon Eden, Michal Feldman, Amos Fiat, Tzahi Taub |
| 2018 | Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. | Dani Dorfman, Haim Kaplan, Lszl Kozma, Seth Pettie, Uri Zwick |
| 2018 | Large Low-Diameter Graphs are Good Expanders. | Michael Dinitz, Michael Schapira, Gal Shahaf |
| 2018 | On Geometric Prototype and Applications. | Hu Ding, Manni Liu |
| 2018 | Online Facility Location with Deletions. | Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski |
| 2018 | Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. | Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi |
| 2018 | Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. | Markus Chimani, Tilo Wiedera |
| 2018 | Amortized Analysis of Asynchronous Price Dynamics. | Yun Kuen Cheung, Richard Cole |
| 2018 | Approximation Schemes for Geometric Coverage Problems. | Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase |
| 2018 | A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. | T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang |
| 2018 | Near-Optimal Distance Emulator for Planar Graphs. | Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2018 | Self-Assembly of Any Shape with Constant Tile Types using High Temperature. | Cameron T. Chalk, Austin Luchsinger, Robert Schweller, Tim Wylie |
| 2018 | Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. | Diptarka Chakraborty, Debarati Das, Michal Kouck, Nitin Saurabh |
| 2018 | A Framework for In-place Graph Algorithms. | Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti |
| 2018 | Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. | Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner |
| 2018 | Fine-grained Lower Bounds on Cops and Robbers. | Sebastian Brandt, Seth Pettie, Jara Uitto |
| 2018 | Improved Routing on the Delaunay Triangulation. | Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despr, Darryl Hill, Michiel H. M. Smid |
| 2018 | Strong Collapse for Persistence. | Jean-Daniel Boissonnat, Siddharth Pritam, Divyansh Pareek |
| 2018 | Searching a Tree with Permanently Noisy Advice. | Lucas Boczkowski, Amos Korman, Yoav Rodeh |
| 2018 | Equilibrium Computation in Atomic Splittable Routing Games. | Umang Bhaskar, Phani Raj Lolakapuri |
| 2018 | Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension. | Amariah Becker, Philip N. Klein, David Saulpic |
| 2018 | Average Whenever You Meet: Opportunistic Protocols for Community Detection. | Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan |
| 2018 | Practical Access to Dynamic Programming on Tree Decompositions. | Max Bannach, Sebastian Berndt |