LIPIcs, Volume 57, ESA 2016

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