| 2019 | Constant-Factor FPT Approximation for Capacitated k-Median. | Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk |
| 2019 | Non-Cooperative Rational Interactive Proofs. | Jing Chen, Samuel McCauley, Shikha Singh |
| 2019 | Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. | Fabrizio Grandoni, Andreas Wiese |
| 2019 | Multicommodity Multicast, Wireless and Fast. | R. Ravi, Oleksandr Rudenko |
| 2019 | Resilient Dictionaries for Randomly Unreliable Memory. | Stefano Leucci, Chih-Hung Liu, Simon Meierhans |
| 2019 | Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. | Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese |
| 2019 | Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian. | Michael Hoffmann, Boris Klemz |
| 2019 | PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors. | Martin Aumller, Tobias Christiani, Rasmus Pagh, Michael Vesterli |
| 2018 | Soft Subdivision Motion Planning for Complex Planar Robots. | Bo Zhou, Yi-Jen Chiang, Chee Yap |
| 2018 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2018 | Improved Dynamic Graph Coloring. | Shay Solomon, Nicole Wein |
| 2018 | An Exact Algorithm for the Steiner Forest Problem. | Daniel R. Schmidt, Bernd Zey, Franois Margot |
| 2018 | Planar Support for Non-piercing Regions and Applications. | Rajiv Raman, Saurabh Ray |
| 2018 | On the Complexity of the (Approximate) Nearest Colored Node Problem. | Maximilian Probst |
| 2018 | Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. | Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
| 2018 | On a Problem of Danzer. | Nabil H. Mustafa, Saurabh Ray |
| 2018 | Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. | J. Ian Munro, Sebastian Wild |
| 2018 | Practical Low-Dimensional Halfspace Range Space Sampling. | Michael Matheny, Jeff M. Phillips |
| 2018 | Disconnected Cuts in Claw-free Graphs. | Barnaby Martin, Danil Paulusma, Erik Jan van Leeuwen |
| 2018 | Finding Stable Matchings That Are Robust to Errors in the Input. | Tung Mai, Vijay V. Vazirani |
| 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 | On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress. | Marvin Knnemann |
| 2018 | Efficient and Adaptive Parameterized Algorithms on Modular Decompositions. | Stefan Kratsch, Florian Nelles |
| 2018 | Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. | Viatcheslav Korenwein, Andr Nichterlein, Rolf Niedermeier, Philipp Zschoche |