LIPIcs, Volume 87, ESA 2017

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