| 2018 | Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. | Ran Duan, Kaifeng Lyu, Yuanhang Xie |
| 2018 | Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs. | Ran Duan, Yong Gu, Le Zhang |
| 2018 | On the Complexity of Infinite Advice Strings. | Gatan Douneau-Tabot |
| 2018 | Sample-Optimal Identity Testing with High Probability. | Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price |
| 2018 | Resynchronizing Classes of Word Relations. | Mara Emilia Descotte, Diego Figueira, Gabriele Puppis |
| 2018 | Lovsz Meets Weisfeiler and Leman. | Holger Dell, Martin Grohe, Gaurav Rattan |
| 2018 | Greedy Algorithms for Online Survivable Network Design. | Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin |
| 2018 | When is Containment Decidable for Probabilistic Automata?. | Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Prez, James Worrell |
| 2018 | Reachability and Distances under Multiple Changes. | Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume |
| 2018 | Unboundedness Problems for Languages of Vector Addition Systems. | Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche |
| 2018 | Optimal Hashing in External Memory. | Alexander Conway, Martin Farach-Colton, Philip Shilane |
| 2018 | Demand-Independent Optimal Tolls. | Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini |
| 2018 | Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. | Lorenzo Clemente, Slawomir Lasota |
| 2018 | Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary. | Julia Chuzhoy, David H. K. Kim, Rachit Nimavat |
| 2018 | A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. | Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan |
| 2018 | On the Complexity of Sampling Vertices Uniformly from a Graph. | Flavio Chierichetti, Shahrzad Haddadan |
| 2018 | How Hard Is It to Satisfy (Almost) All Roommates?. | Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion |
| 2018 | Restricted Max-Min Fair Allocation. | Siu-Wing Cheng, Yuchen Mao |
| 2018 | Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. | Moses Charikar, Shay Solomon |
| 2018 | On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. | Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul |
| 2018 | Brief Announcement: Approximation Schemes for Geometric Coverage Problems. | Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase |
| 2018 | Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. | Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis |
| 2018 | Spanning Tree Congestion and Computation of Generalized Gyri-Lovsz Partition. | L. Sunil Chandran, Yun Kuen Cheung, Davis Issac |
| 2018 | Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2018 | Generalized Center Problems with Outliers. | Deeparnab Chakrabarty, Maryam Negahbani |