| 2016 | 2-Connectivity in Directed Graphs. Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2016 | 24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, August 22-24, 2016 Piotr Sankowski, Christos D. Zaroliagis |
| 2016 | A 7/3-Approximation for Feedback Vertex Sets in Tournaments. Matthias Mnich, Virginia Vassilevska Williams, László A. Végh |
| 2016 | A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges. Chien-Chung Huang, Sebastian Ott |
| 2016 | A Constant Approximation Algorithm for Scheduling Packets on Line Networks. Guy Even, Moti Medina, Adi Rosén |
| 2016 | A Note On Spectral Clustering. Pavel Kolev, Kurt Mehlhorn |
| 2016 | A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter. Stefan Kratsch |
| 2016 | A Streaming Algorithm for the Undirected Longest Path Problem. Lasse Kliemann, Christian Schielke, Anand Srivastav |
| 2016 | Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants. Clément Maria, Jonathan Spreer |
| 2016 | Algorithms with Provable Guarantees for Clustering. Ola Svensson |
| 2016 | Almost All Even Yao-Yao Graphs Are Spanners. Jian Li, Wei Zhan |
| 2016 | An ILP-based Proof System for the Crossing Number Problem. Markus Chimani, Tilo Wiedera |
| 2016 | Approximation and Hardness of Token Swapping. Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, Takeaki Uno |
| 2016 | Beating Ratio 0.5 for Weighted Oblivious Matching Problems. Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, Xiaowei Wu |
| 2016 | BlockQuicksort: Avoiding Branch Mispredictions in Quicksort. Stefan Edelkamp, Armin Weiß |
| 2016 | Cell-Probe Lower Bounds for Bit Stream Computation. Raphaël Clifford, Markus Jalsenius, Benjamin Sach |
| 2016 | Compact and Fast Sensitivity Oracles for Single-Source Distances. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti |
| 2016 | Computing Equilibria in Markets with Budget-Additive Utilities. Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn |
| 2016 | Counting Linear Extensions: Parameterizations by Treewidth. Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak |
| 2016 | Counting Matchings with k Unmatched Vertices in Planar Graphs. Radu Curticapean |
| 2016 | Distributed Signaling Games. Moran Feldman, Moshe Tennenholtz, Omri Weinstein |
| 2016 | Efficient Algorithms with Asymmetric Read and Write Costs. Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun |
| 2016 | Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue |
| 2016 | Every Property Is Testable on a Natural Class of Scale-Free Multigraphs. Hiro Ito |
| 2016 | Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time. Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin |
| 2016 | Exponential Time Paradigms Through the Polynomial Time Lens. Andrew Drucker, Jesper Nederlof, Rahul Santhanam |
| 2016 | Faster External Memory LCP Array Construction. Juha Kärkkäinen, Dominik Kempa |
| 2016 | Faster Worst Case Deterministic Dynamic Connectivity. Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup |
| 2016 | Finding Large Set Covers Faster via the Representation Method. Jesper Nederlof |
| 2016 | Fixed-Parameter Approximability of Boolean MinCSPs. Édouard Bonnet, László Egri, Dániel Marx |
| 2016 | Front Matter, Table of Contents, Preface, Programm Commitee, External Reviewers. |
| 2016 | Fully Dynamic Spanners with Worst-Case Update Time. Greg Bodwin, Sebastian Krinninger |
| 2016 | Graph Isomorphism for Unit Square Graphs. Daniel Neuen |
| 2016 | Hardness of Bipartite Expansion. Subhash Khot, Rishi Saket |
| 2016 | Hitting Set for Hypergraphs of Low VC-dimension. Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy |
| 2016 | Homotopy Measures for Representative Trajectories. Erin W. Chambers, Irina Kostitsyna, Maarten Löffler, Frank Staals |
| 2016 | How Hard is it to Find (Honest) Witnesses?. Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat |
| 2016 | Hyperbolic Random Graphs: Separators and Treewidth. Thomas Bläsius, Tobias Friedrich, Anton Krohmer |
| 2016 | Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. Gramoz Goranci, Monika Henzinger, Mikkel Thorup |
| 2016 | Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. Monika Henzinger, Stefan Neumann |
| 2016 | KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. Michele Borassi, Emanuele Natale |
| 2016 | Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance. Quirijn W. Bouts, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Willem Sonke, Kevin Verbeek |
| 2016 | Min-Sum Scheduling Under Precedence Constraints. Andreas S. Schulz, José Verschae |
| 2016 | New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase |
| 2016 | New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu |
| 2016 | New Parameterized Algorithms for APSP in Directed Graphs. Ely Porat, Eduard Shahbazian, Roei Tov |
| 2016 | On Interference Among Moving Sensors and Related Problems. Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky |
| 2016 | On the Fine-Grained Complexity of Rainbow Coloring. Lukasz Kowalik, Juho Lauri, Arkadiusz Socala |
| 2016 | On the Geodesic Centers of Polygonal Domains. Haitao Wang |
| 2016 | On the Hardness of Learning Sparse Parities. Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket |
| 2016 | On the Lattice Distortion Problem. Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz |
| 2016 | On the Power of Advice and Randomization for Online Bipartite Matching. Christoph Dürr, Christian Konrad, Marc P. Renault |
| 2016 | Online Algorithms for Multi-Level Aggregation. Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý |
| 2016 | Online Budgeted Maximum Coverage. Dror Rawitz, Adi Rosén |
| 2016 | Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality. Giorgio Lucarelli, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram |
| 2016 | Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
| 2016 | Optimal Staged Self-Assembly of General Shapes. Cameron T. Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, Tim Wylie |
| 2016 | Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace. Mikkel Abrahamsen, Bartosz Walczak |
| 2016 | Packing and Covering with Non-Piercing Regions. Sathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu Roy |
| 2016 | Parameterized Hardness of Art Gallery Problems. Édouard Bonnet, Tillmann Miltzow |
| 2016 | Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing. Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell |
| 2016 | Probabilistic Routing for On-Street Parking Search. Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias Friedrich |
| 2016 | Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching. Kiril Solovey, Dan Halperin |
| 2016 | Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner |
| 2016 | Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms. Riley Murray, Megan Chao, Samir Khuller |
| 2016 | Separation of Cycle Inequalities for the Periodic Timetabling Problem. Ralf Borndörfer, Heide Hoppmann, Marika Karbstein |
| 2016 | SimBa: An Efficient Tool for Approximating Rips-Filtration Persistence via Simplicial Batch-Collapse. Tamal K. Dey, Dayu Shi, Yusu Wang |
| 2016 | Solving k-SUM Using Few Linear Queries. Jean Cardinal, John Iacono, Aurélien Ooms |
| 2016 | Stochastic Streams: Sample Complexity vs. Space Complexity. Michael S. Crouch, Andrew McGregor, Gregory Valiant, David P. Woodruff |
| 2016 | Strategic Contention Resolution with Limited Feedback. George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2016 | Streaming Pattern Matching with d Wildcards. Shay Golan, Tsvi Kopelowitz, Ely Porat |
| 2016 | Streaming Property Testing of Visibly Pushdown Languages. Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre |
| 2016 | Sublinear Distance Labeling. Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat |
| 2016 | The Alternating Stock Size Problem and the Gasoline Puzzle. Alantha Newman, Heiko Röglin, Johanna Seif |
| 2016 | The Complexity of the k-means Method. Tim Roughgarden, Joshua R. Wang |
| 2016 | The Computational Complexity of Genetic Diversity. Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Sadra Yazdanbod |
| 2016 | The Power of Migration for Online Slack Scheduling. Chris Schwiegelshohn, Uwe Schwiegelshohn |
| 2016 | The Strongly Stable Roommates Problem. Adam Kunysz |
| 2016 | Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. Thomas Kesselheim, Andreas Tönnis |
| 2016 | epsilon-Kernel Coresets for Stochastic Points. Lingxiao Huang, Jian Li, Jeff M. Phillips, Haitao Wang |