Front Matter, Table of Contents, Preface, Programm Commitee, External Reviewers

24th Annual European Symposium on Algorithms ESA 2016, August 22–24, 2016, Aarhus, Denmark Edited by Piotr Sankowski Christos Zaroliagis LIPIcs – Vol. 57 – ESA 2016 www.dagstuhl.de/lipics Editors Piotr Sankowski Institute of Infortmatics University of Warsawa, Poland Christos Zaroliagis Department of Computer Engineering & Informatics University of Patras, Greece ACM Classification 1998 E.1 Data Structures, F.2.2 Nonnumerical Algorithms and Problems, G.1.6 Optimization, G.2 Discrete Mathematics, G.4 Mathematical Software, I.1.2 Algorithms, I.2.8 Problem Solving, Control Methods, and Search, I.3.5 Computational Geometry and Object Modeling. ISBN 978-3-95977-015-6 Published online and open access by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at http://www.dagstuhl.de/dagpub/978-3-95977-015-6. Publication date August, 2016 Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at http://dnb.d-nb.de. License This work is licensed under a Creative Commons Attribution 3.0 Unported license (CC-BY 3.0): http://creativecommons.org/licenses/by/3.0/legalcode. In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors’ moral rights: Attribution: The work must be attributed to its authors. The copyright is retained by the corresponding authors. Digital Object Identifier: 10.4230/LIPIcs.ESA.2016.0 ISBN 978-3-95977-015-6 ISSN 1868-8969 http://www.dagstuhl.de/lipics 0:iii LIPIcs – Leibniz International Proceedings in Informatics LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge. Editorial Board Susanne Albers (TU München) Chris Hankin (Imperial College London) Deepak Kapur (University of New Mexico) Michael Mitzenmacher (Harvard University) Madhavan Mukund (Chennai Mathematical Institute) Catuscia Palamidessi (INRIA) Wolfgang Thomas (Chair, RWTH Aachen) Pascal Weil (CNRS and University Bordeaux) Reinhard Wilhelm (Saarland University) ISSN 1868-8969 http://www.dagstuhl.de/lipics ESA 2016 To all algorithmicists Contents Preface Piotr Sankowski and Christos Zaroliagis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0:xiii Invited Papers 2-Connectivity in Directed Graphs Loukas Georgiadis, Giuseppe F. Italiano, and Nikos Parotsidis . . . . . . . . . . . . . . . . . . . 1:1–1:14 Algorithms with Provable Guarantees for Clustering Ola Svensson . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:1–2:1 Regular Papers Beating Ratio 0.5 for Weighted Oblivious Matching Problems Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, and Xiaowei Wu . . . . . . . . . . . . . . . . . . . 3:1–3:18 Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace Mikkel Abrahamsen and Bartosz Walczak . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:1–4:15 Sublinear Distance Labeling Stephen Alstrup, Søren Dahlgaard, Mathias Bæ Tejs Knudsen, and Ely Porat . . . . 5:1–5:15 Probabilistic Routing for On-Street Parking Search Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, and Tobias Friedrich . . . . . . 6:1–6:13 Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, and Franziska Wegner . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7:1–7:18 Computing Equilibria in Markets with Budget-Additive Utilities Xiaohui Bei, Jugal Garg, Martin Hoefer, and Kurt Mehlhorn . . . . . . . . . . . . . . . . . . . . 8:1–8:14 On the Lattice Distortion Problem Huck Bennett, Daniel Dadush, and Noah Stephens-Davidowitz . . . . . . . . . . . . . . . . . . . 9:1–9:17 Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, and Chris Wastell . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10:1–10:18 On the Hardness of Learning Sparse Parities Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, and Rishi Saket . . . . . . . 11:1–11:17 Online Algorithms for Multi-Level Aggregation Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang, and Pavel Veselý . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12:1–12:17 24th Annual European Symposium on Algorithms (ESA 2016). Editors: Piotr Sankowski and Christos Zaroliagis Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany 0:viii Contents Compact and Fast Sensitivity Oracles for Single-Source Distances Davide Bilò, Luciano Gualà, Stefano Leucci, and Guido Proietti . . . . . . . . . . . . . . . . . 13:1–13:14 Efficient Algorithms with Asymmetric Read and Write Costs Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, and Julian Shun . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14:1–14:18 Hyperbolic Random Graphs: Separators and Treewidth Thomas Bläsius, Tobias Friedrich, and Anton Krohmer . . . . . . . . . . . . . . . . . . . . . . . . . . 15:1–15:16 Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane Thomas Bläsius, Tobias Friedrich, Anton Krohmer, and Sören Laue . . . . . . . . . . . . . . 16:1–16:18 Fully Dynamic Spanners with Worst-Case Update Time Greg Bodwin and Sebastian Krinninger . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17:1–17:18 Fixed-Parameter Approximability of Boolean MinCSPs Édouard Bonnet, László Egri, and Dániel Marx . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18:1–18:18 Parameterized Hardness of Art Gallery Problems Édouard Bonnet and Tillmann Miltzow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19:1–19:17 KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation Michele Borassi and Emanuele Natale . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20:1–20:18 Separation of Cycle (...truncated)