ACCEPTED PAPERS

Laszlo Kozma. Minimum Average Distance Triangulations
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse and Ljubomir Perkovic. The Stretch Factor of $L_1$- and $L_\infty$-Delaunay Triangulations
J. Ian Munro and Patrick K. Nicholson. Succinct Posets
Shiri Chechik. Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
Tobias Harks and Britta Peis. Resource Buying Games
Martin Gross and Martin Skutella. Maximum Multicommodity Flows Over Time without Intermediate Storage
Tim Nonner. Polynomial-Time Approximation Schemes for Shortest Path with Alternatives
Sergio Cabello, Jean Cardinal and Stefan Langerman. The Clique Problem in Ray Intersection Graphs
T-H. Hubert Chan, Elaine Shi and Dawn Song. Optimal Lower Bound for Differentially Private Multi-Party Aggregation
Rasmus Ibsen-Jensen and Peter Bro Miltersen. Solving simple stochastic games with few coin toss positions
A. Karim Abu-Affash, Paz Carmi, Matthew Katz and Yohai Trabelsi. Bottleneck Non-Crossing Matching in the Plane
Petr Golovach, Daniel Paulusma and Erik Jan van Leeuwen. Induced Disjoint Paths in Claw-Free Graphs
Bernard Chazelle and Wolfgang Mulzer. Data Structures on Event Graphs
Djamal Belazzougui and Gonzalo Navarro. New Lower and Upper Bounds for Representing Sequences
Yasuaki Kobayashi and Hisao Tamaki. A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
Susanne Albers and Matthias Hellwig. On the Value of Job Migration in Online Makespan Minimization
Emanuele Guido Fusco and Andrzej Pelc. Knowledge, Level of Symmetry, and Time of Leader Election
Martin Aumüller, Martin Dietzfelbinger and Philipp Woelfel. Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash
T-H. Hubert Chan, Fei Chen and Li Ning. Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite
Kevin Buchin, Maike Buchin, Wouter Meulemans and Bettina Speckmann. Locally Correct Fréchet Matchings
Josep Diaz, Olli Pottonen, Maria Serna and Erik Jan van Leeuwen. On the Complexity of Metric Dimension
Joachim Giesen, Martin Jaggi and Soeren Laue. Optimizing over the Growing Spectrahedron
Martin Babka, Jan Bulánek, Michal Koucký, Vladimír Čunát and Michael Saks. On online labeling with polynomially many labels
Thomas Kesselheim. Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
James Davis and David Williamson. A Dual-Fitting 3/2-Approximation Algorithm for Some Minimum-Cost Graph Problems
Jan Arne Telle and Yngve Villanger. Solving domination problems on larger graph classes by linear-time FPT algorithms
Fidaa Abed and Chien-Chung Huang. Preemptive Coordination Mechanisms for Unrelated Machines
Siddharth Barman, Shuchi Chawla and Seeun Umboh. A Bicriteria Approximation for the Reordering Buffer Problem
Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt and Melanie Schmidt. Approximating Earliest Arrival Flows in Arbitrary Networks
Bundit Laekhanukit, Adrian Vetta and Gordon Wilfong. Routing Regardless of Network Stability
Bart De Keijzer and Guido Schaefer. Finding Social Optima in Congestion Games with Positive Externalities
Mark De Berg, Marcel Roeloffzen and Bettina Speckmann. Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes
Meng He, Ian Munro and Gelin Zhou. Succinct Data Structures for Path Queries
Aleksandrs Belovs and Ben Reichardt. Span programs and quantum algorithms for st-connectivity and claw detection
Andrew Childs, Shelby Kimmel and Robin Kothari. The quantum query complexity of read-many formulas
Jose A. Soto, Jose R. Correa and Omar Larre. TSP tours in Cubic Graphs: Beyond 4/3
Jessica Chang, Harold Gabow and Samir Khuller. A Model for Minimizing Active Processor Time
Peyman Afshani and Norbert Zeh. Sorted Geometric Queries Require Superlinear Space
Debojyoti Dutta, Michael Kapralov, Ian Post and Rajendra Shinde. Embedding paths into trees: VM placement to minimize congestion
Marek Cygan, Guy Kortsarz and Zeev Nutov. Steiner Forest Orientation Problems
Fedor Fomin, Saket Saurabh and Yngve Villanger. A Polynomial kernel for Proper Interval Vertex Deletion
Pavol Hell, Monaldo Mastrolilli, Mayssam Nevisi and Arash Rafiey. Approximation of Minimum Cost Homomorphisms
Pavel Klavik, Jan Kratochvil, Tomasz Krawczyk and Bartosz Walczak. Extending partial representations of function graphs and permutation graphs
Fabrizio Grandoni. On Min-Power Steiner Tree
Frank Hellweg and Christian Sohler. Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness
Dieter Kratsch and Haiko Muller. Colouring AT-free graphs
Danny Hermelin, Matthias Mnich and Erik Jan van Leeuwen. Parameterized Complexity of Induced H-Matching on Claw-Free Graphs
Hossein Jowhari. Efficient Communication Protocols for Deciding Edit Distance
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger and Danupon Nanongkai. Polynomial-time Algorithms for Energy Games with Special Weight Structures
Sebastian Wild and Markus E. Nebel. Average Case Analysis of Java 7's Dual Pivot Quicksort
Nikhil Bansal and Kirk Pruhs. Weighted Geometric Set Multi-cover via Quasi-Uniform Sampling
Manisha Bansal, Naveen Garg and Neelima Gupta. A 5-approximation for capacitated facility location
Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos and Maria Kyropoulou. Revenue guarantees in sponsored search auctions
Gerth Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman and Srinivasa Rao Satti. Two Dimensional Range Minimum Queries and Fibonacci Lattices
Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk and Piotr Sankowski. A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
Eunhui Park and David Mount. A Self-Adjusting Data Structure for Multidimensional Point Sets
Efi Fogel, Michael Hemmer, Asaf Porat and Dan Halperin. Lines Through Segments in 3D Space
Martin Waßmann and Karsten Weicker. Maximum Flow Networks for Stability Analysis of LEGO Structures
Vissarion Fisikopoulos and Luis Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation
Mahmuda Ahmed and Carola Wenk. Constructing Street Networks from GPS Trajectories
Michael Hemmer, Michal Kleinbort and Dan Halperin. Improved Implementation of Point Location in General Two-Dimensional Subdivisions
Ittai Abraham, Daniel Delling, Andrew Goldberg and Renato Werneck. Hierarchical Hub Labelings for Shortest Paths
Daniel Delling and Renato Werneck. Better Bounds for Graph Bisection
Peter Palfrader, Martin Held and Stefan Huber. On Computing Straight Skeletons by Means of Kinetic Triangulations
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura and Federico Santaroni. An Experimental Study of Dynamic Dominators
Clément Maria and Jean-Daniel Boissonnat. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
Deepak Ajwani, Ulrich Meyer and David Veith. I/O-efficient hierarchical diameter approximation
Gernot Veit Batz and Peter Sanders. Time-Dependent Route Planning with Generalized Objective Functions
Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk and Jakob Truelsen. Simplifying Massive Contour Maps