| 2018 | 26th Annual European Symposium on Algorithms, ESA 2018, Helsinki, Finland, August 20-22, 2018 Yossi Azar, Hannah Bast, Grzegorz Herman |
| 2018 | A Framework for In-place Graph Algorithms. Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti |
| 2018 | A New and Improved Algorithm for Online Bin Packing. János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin |
| 2018 | A Polynomial Kernel for Diamond-Free Editing. Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye |
| 2018 | A QPTAS for Gapless MEC. Shilpa Garg, Tobias Mömke |
| 2018 | A Tree Structure For Dynamic Facility Location. Gramoz Goranci, Monika Henzinger, Dariusz Leniowski |
| 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 | Algorithmic Building Blocks for Asymmetric Memories. Yan Gu, Yihan Sun, Guy E. Blelloch |
| 2018 | Algorithms for Inverse Optimization Problems. Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy |
| 2018 | Amortized Analysis of Asynchronous Price Dynamics. Yun Kuen Cheung, Richard Cole |
| 2018 | An Exact Algorithm for the Steiner Forest Problem. Daniel R. Schmidt, Bernd Zey, François Margot |
| 2018 | Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2018 | Approximation Schemes for Geometric Coverage Problems. Steven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase |
| 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 | Buffered Count-Min Sketch on SSD: Theory and Experiments. Mayank Goswami, Dzejla Medjedovic, Emina Mekic, Prashant Pandey |
| 2018 | Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. Bart M. P. Jansen, Jesper Nederlof |
| 2018 | Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. Markus Chimani, Tilo Wiedera |
| 2018 | Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche |
| 2018 | Decremental SPQR-trees for Planar Graphs. Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg |
| 2018 | Disconnected Cuts in Claw-free Graphs. Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen |
| 2018 | Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. Gramoz Goranci, Monika Henzinger, Pan Peng |
| 2018 | Dynamic Trees with Almost-Optimal Access Cost. Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich |
| 2018 | Edit Distance with Block Operations. Michal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka |
| 2018 | Efficient and Adaptive Parameterized Algorithms on Modular Decompositions. Stefan Kratsch, Florian Nelles |
| 2018 | Equilibrium Computation in Atomic Splittable Routing Games. Umang Bhaskar, Phani Raj Lolakapuri |
| 2018 | FPT Algorithms for Embedding into Low Complexity Graphic Metrics. Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra |
| 2018 | Finding Stable Matchings That Are Robust to Errors in the Input. Tung Mai, Vijay V. Vazirani |
| 2018 | Fine-grained Lower Bounds on Cops and Robbers. Sebastian Brandt, Seth Pettie, Jara Uitto |
| 2018 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2018 | Generalized Coloring of Permutations. Vít Jelínek, Michal Opler, Pavel Valtr |
| 2018 | Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick |
| 2018 | Improved Dynamic Graph Coloring. Shay Solomon, Nicole Wein |
| 2018 | Improved Routing on the Delaunay Triangulation. Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid |
| 2018 | Improved Space-Time Tradeoffs for kSUM. Isaac Goldstein, Moshe Lewenstein, Ely Porat |
| 2018 | Improved Time and Space Bounds for Dynamic Range Mode. Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund |
| 2018 | Large Low-Diameter Graphs are Good Expanders. Michael Dinitz, Michael Schapira, Gal Shahaf |
| 2018 | Light Spanners for High Dimensional Norms via Stochastic Decompositions. Arnold Filtser, Ofer Neiman |
| 2018 | Near-Optimal Distance Emulator for Planar Graphs. Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2018 | Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. J. Ian Munro, Sebastian Wild |
| 2018 | On Geometric Prototype and Applications. Hu Ding, Manni Liu |
| 2018 | On Learning Linear Functions from Subset and Its Applications in Quantum Computing. Gábor Ivanyos, Anupam Prakash, Miklos Santha |
| 2018 | On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress. Marvin Künnemann |
| 2018 | On a Problem of Danzer. Nabil H. Mustafa, Saurabh Ray |
| 2018 | On the Complexity of the (Approximate) Nearest Colored Node Problem. Maximilian Probst |
| 2018 | On the Decision Tree Complexity of String Matching. Xiaoyu He, Neng Huang, Xiaoming Sun |
| 2018 | On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2018 | On the Tractability of Optimization Problems on H-Graphs. Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond |
| 2018 | On the Worst-Case Complexity of TimSort. Nicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau |
| 2018 | Online Facility Location with Deletions. Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski |
| 2018 | Online Makespan Scheduling with Job Migration on Uniform Machines. Matthias Englert, David Mezlaf, Matthias Westermann |
| 2018 | Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram |
| 2018 | Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. Euiwoong Lee, Sahil Singla |
| 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 | Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi |
| 2018 | Planar Support for Non-piercing Regions and Applications. Rajiv Raman, Saurabh Ray |
| 2018 | Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. Bart M. P. Jansen, Astrid Pieterse |
| 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 | Practical Access to Dynamic Programming on Tree Decompositions. Max Bannach, Sebastian Berndt |
| 2018 | Practical Low-Dimensional Halfspace Range Space Sampling. Michael Matheny, Jeff M. Phillips |
| 2018 | Quantum Algorithms for Connectivity and Related Problems. Michael Jarret, Stacey Jeffery, Shelby Kimmel, Alvaro Piedrafita |
| 2018 | Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
| 2018 | Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. Roberto Grossi, Luca Versari |
| 2018 | Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke |
| 2018 | Searching a Tree with Permanently Noisy Advice. Lucas Boczkowski, Amos Korman, Yoav Rodeh |
| 2018 | Self-Assembly of Any Shape with Constant Tile Types using High Temperature. Cameron T. Chalk, Austin Luchsinger, Robert Schweller, Tim Wylie |
| 2018 | Soft Subdivision Motion Planning for Complex Planar Robots. Bo Zhou, Yi-Jen Chiang, Chee Yap |
| 2018 | Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen |
| 2018 | Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh |
| 2018 | String Attractors: Verification and Optimization. Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg |
| 2018 | Strong Collapse for Persistence. Jean-Daniel Boissonnat, Siddharth Pritam, Divyansh Pareek |
| 2018 | Symmetry Exploitation for Online Machine Covering with Bounded Migration. Waldo Gálvez, José A. Soto, José Verschae |
| 2018 | The Stochastic Score Classification Problem. Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik |
| 2018 | Truthful Prompt Scheduling for Minimizing Sum of Completion Times. Alon Eden, Michal Feldman, Amos Fiat, Tzahi Taub |
| 2018 | Two-Dimensional Maximal Repetitions. Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol |
| 2018 | Weighted Model Counting on the GPU by Exploiting Small Treewidth. Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser |