| 2017 | 25th Annual European Symposium on Algorithms, ESA 2017, Vienna, Austria, September 4-6, 2017 Kirk Pruhs, Christian Sohler |
| 2017 | A Linear-Time Parameterized Algorithm for Node Unique Label Cover. Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2017 | A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs. Amariah Becker, Philip N. Klein, David Saulpic |
| 2017 | A Space-Optimal Grammar Compression. Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto |
| 2017 | An Encoding for Order-Preserving Matching. Travis Gagie, Giovanni Manzini, Rossano Venturini |
| 2017 | Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. Pankaj K. Agarwal, Natan Rubin, Micha Sharir |
| 2017 | Benchmark Graphs for Practical Graph Isomorphism. Daniel Neuen, Pascal Schweitzer |
| 2017 | Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton |
| 2017 | Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. Gerth Stølting Brodal, Konstantinos Mampentzidis |
| 2017 | Clustering in Hypergraphs to Minimize Average Edge Service Time. Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim |
| 2017 | Combinatorial n-fold Integer Programming and Applications. Dusan Knop, Martin Koutecký, Matthias Mnich |
| 2017 | Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. Daniel Antunes, Claire Mathieu, Nabil H. Mustafa |
| 2017 | Computing Maximum Agreement Forests without Cluster Partitioning is Folly. Zhijiang Li, Norbert Zeh |
| 2017 | Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. Benjamin A. Burton, Erin W. Chambers, Marc J. van Kreveld, Wouter Meulemans, Tim Ophelders, Bettina Speckmann |
| 2017 | Contracting a Planar Graph Efficiently. Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski |
| 2017 | Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices. Marc Roth |
| 2017 | Dispersion on Trees. Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann |
| 2017 | Distance-Preserving Subgraphs of Interval Graphs. Kshitij Gajjar, Jaikumar Radhakrishnan |
| 2017 | Dynamic Clustering to Minimize the Sum of Radii. Monika Henzinger, Dariusz Leniowski, Claire Mathieu |
| 2017 | Dynamic Space Efficient Hashing. Tobias Maier, Peter Sanders |
| 2017 | Exploring the Tractability of the Capped Hose Model. Thomas Bosman, Neil Olver |
| 2017 | Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract Cubes. Antonis Thomas |
| 2017 | Fast Dynamic Arrays. Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz |
| 2017 | Faster Approximate Diameter and Distance Oracles in Planar Graphs. Timothy M. Chan, Dimitrios Skrepetos |
| 2017 | Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. Haim Kaplan, Sasanka Roy, Micha Sharir |
| 2017 | Front Matter, Table of Contents, Preface, Programm Commitees, External Reviewers. |
| 2017 | Half-Integral Linkages in Highly Connected Directed Graphs. Katherine Edwards, Irene Muzi, Paul Wollan |
| 2017 | Improved Algorithm for Dynamic b-Matching. Sayan Bhattacharya, Manoj Gupta, Divyarthi Mohan |
| 2017 | Improved Approximate Rips Filtrations with Shifted Integer Lattices. Aruni Choudhary, Michael Kerber, Sharath Raghvendra |
| 2017 | Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy. Omer Gold, Micha Sharir |
| 2017 | Improved Guarantees for Vertex Sparsification in Planar Graphs. Gramoz Goranci, Monika Henzinger, Pan Peng |
| 2017 | Improving TSP Tours Using Dynamic Programming over Tree Decompositions. Marek Cygan, Lukasz Kowalik, Arkadiusz Socala |
| 2017 | In-Place Parallel Super Scalar Samplesort (IPSSSSo). Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders |
| 2017 | Independent Range Sampling, Revisited. Peyman Afshani, Zhewei Wei |
| 2017 | K-Dominance in Multidimensional Data: Theory and Applications. Thomas Schibler, Subhash Suri |
| 2017 | LZ-End Parsing in Linear Time. Dominik Kempa, Dmitry Kosolobov |
| 2017 | Local Search Algorithms for Maximum Carpool Matching. Gilad Kutiel, Dror Rawitz |
| 2017 | Maxent-Stress Optimization of 3D Biomolecular Models. Michael Wegner, Oskar Taubert, Alexander Schug, Henning Meyerhenke |
| 2017 | Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein |
| 2017 | Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles. Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zündorf |
| 2017 | New Abilities and Limitations of Spectral Graph Bisection. Martin R. Schuster, Maciej Liskiewicz |
| 2017 | On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine. Syamantak Das, Andreas Wiese |
| 2017 | On the Complexity of Bounded Context Switching. Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan |
| 2017 | On the Impact of Singleton Strategies in Congestion Games. Vittorio Bilò, Cosimo Vinci |
| 2017 | On the Tree Augmentation Problem. Zeev Nutov |
| 2017 | Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. Niv Buchbinder, Danny Segev, Yevgeny Tkach |
| 2017 | Online Bin Packing with Cardinality Constraints Resolved. János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin |
| 2017 | Online Submodular Maximization Problem with Vector Packing Constraint. T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu |
| 2017 | Optimal Stopping Rules for Sequential Hypothesis Testing. Constantinos Daskalakis, Yasushi Kawase |
| 2017 | Output Sensitive Algorithms for Approximate Incidences and Their Applications. Dror Aiger, Haim Kaplan, Micha Sharir |
| 2017 | Path-Contractions, Edge Deletions and Connectivity Preservation. Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström |
| 2017 | Permuting and Batched Geometric Lower Bounds in the I/O Model. Peyman Afshani, Ingo van Duijn |
| 2017 | Positive-Instance Driven Dynamic Programming for Treewidth. Hisao Tamaki |
| 2017 | Pricing Social Goods. Alon Eden, Tomer Ezra, Michal Feldman |
| 2017 | Prize-Collecting TSP with a Budget Constraint. Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson |
| 2017 | Profit Sharing and Efficiency in Utility Games. Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika |
| 2017 | Randomized Contractions for Multiobjective Minimum Cuts. Hassene Aissi, Ali Ridha Mahjoub, R. Ravi |
| 2017 | Real-Time Streaming Multi-Pattern Search for Constant Alphabet. Shay Golan, Ely Porat |
| 2017 | Sampling Geometric Inhomogeneous Random Graphs in Linear Time. Karl Bringmann, Ralph Keusch, Johannes Lengler |
| 2017 | Shortest Paths in the Plane with Obstacle Violations. John Hershberger, Neeraj Kumar, Subhash Suri |
| 2017 | Single-Sink Fractionally Subadditive Network Design. Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità |
| 2017 | Sketching for Geometric Problems (Invited Talk). David P. Woodruff |
| 2017 | Stability and Recovery for Independence Systems. Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák |
| 2017 | Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. Dániel Marx, Marcin Pilipczuk |
| 2017 | Temporal Clustering. Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos |
| 2017 | The Directed Disjoint Shortest Paths Problem. Kristóf Bérczi, Yusuke Kobayashi |
| 2017 | The Online House Numbering Problem: Min-Max Online List Labeling. William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz |
| 2017 | The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. Gramoz Goranci, Monika Henzinger, Pan Peng |
| 2017 | The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan |
| 2017 | Tight Bounds for Online Coloring of Basic Graph Classes. Susanne Albers, Sebastian Schraink |
| 2017 | Tight Lower Bounds for the Complexity of Multicoloring. Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
| 2017 | Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut |