| 2018 | Planar Graphs as L-intersection or L-contact graphs. | Daniel Gonalves, Lucas Isenmann, Claire Pennarun |
| 2018 | Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. | Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2018 | Exponentially slow mixing in the mean-field Swendsen-Wang dynamics. | Reza Gheissari, Eyal Lubetzky, Yuval Peres |
| 2018 | Resource-Efficient Common Randomness and Secret-Key Schemes. | Badih Ghazi, T. S. Jayram |
| 2018 | Better Tradeoffs for Exact Distance Oracles in Planar Graphs. | Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen |
| 2018 | Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic | Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann |
| 2018 | Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. | Pawel Gawrychowski, Fabian Kuhn, Jakub Lopuszanski, Konstantinos Panagiotou, Pascal Su |
| 2018 | Optimal Dynamic Strings. | Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski |
| 2018 | Fast Space Optimal Leader Election in Population Protocols. | Leszek Gasieniec, Grzegorz Stachowiak |
| 2018 | Approximating the Nash Social Welfare with Budget-Additive Valuations. | Jugal Garg, Martin Hoefer, Kurt Mehlhorn |
| 2018 | Uniform generation of random graphs with power-law degree sequences. | Pu Gao, Nicholas C. Wormald |
| 2018 | Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor. | Francois Le Gall, Florent Urrutia |
| 2018 | Optimal-Time Text Indexing in BWT-runs Bounded Space. | Travis Gagie, Gonzalo Navarro, Nicola Prezza |
| 2018 | The Value of Information Concealment. | Hu Fu, Christopher Liaw, Pinyan Lu, Zhihao Gavin Tang |
| 2018 | Approximation Schemes for Clustering with Outliers. | Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour |
| 2018 | The Complexity of Counting Surjective Homomorphisms and Compactions. | Jacob Focke, Leslie Ann Goldberg, Stanislav Zivn |
| 2018 | Tight Analysis of Parallel Randomized Greedy MIS. | Manuela Fischer, Andreas Noever |
| 2018 | Improved bounds for testing Dyck languages. | Eldar Fischer, Frdric Magniez, Tatiana Starikovskaya |
| 2018 | Approximating Weighted Tree Augmentation via Chvtal-Gomory Cuts. | Samuel Fiorini, Martin Gro, Jochen Knemann, Laura Sanit |
| 2018 | Steiner Point Removal with Distortion | Arnold Filtser |
| 2018 | Computing Simplicial Representatives of Homotopy Group Elements. | Marek Filakovsk, Peter Franek, Uli Wagner, Stephan Zhechev |
| 2018 | A Framework for the Secretary Problem on the Intersection of Matroids. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2018 | Metric Violation Distance: Hardness and Approximation. | Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk |
| 2018 | Adaptive Hierarchical Clustering Using Ordinal Queries. | Ehsan Emamjomeh-Zadeh, David Kempe |
| 2018 | Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. | Friedrich Eisenbrand, Robert Weismantel |