LIPIcs, Volume 112, ESA 2018

• Yossi Azar, Hannah Bast, and Grzegorz Herman LIPIcs, Volume 112, ESA'18, Complete Volume 10.4230/LIPIcs.ESA.2018
• Yossi Azar, Hannah Bast, and Grzegorz Herman Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ESA.2018.0
• Sara Ahmadian, Umang Bhaskar, Laura Sanità, and Chaitanya Swamy Algorithms for Inverse Optimization Problems 10.4230/LIPIcs.ESA.2018.1
• Amihood Amir, Gad M. Landau, Shoshana Marcus, and Dina Sokol Two-Dimensional Maximal Repetitions 10.4230/LIPIcs.ESA.2018.2
• Sunil Arya, Guilherme D. da Fonseca, and David M. Mount Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums 10.4230/LIPIcs.ESA.2018.3
• Nicolas Auger, Vincent Jugé, Cyril Nicaud, and Carine Pivoteau On the Worst-Case Complexity of TimSort 10.4230/LIPIcs.ESA.2018.4
• János Balogh, József Békési, György Dósa, Leah Epstein, and Asaf Levin A New and Improved Algorithm for Online Bin Packing 10.4230/LIPIcs.ESA.2018.5
• Max Bannach and Sebastian Berndt Practical Access to Dynamic Programming on Tree Decompositions 10.4230/LIPIcs.ESA.2018.6
• Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, and Luca Trevisan Average Whenever You Meet: Opportunistic Protocols for Community Detection 10.4230/LIPIcs.ESA.2018.7
• Amariah Becker, Philip N. Klein, and David Saulpic Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension 10.4230/LIPIcs.ESA.2018.8
• Sebastian Brandt, Seth Pettie, and Jara Uitto Fine-grained Lower Bounds on Cops and Robbers 10.4230/LIPIcs.ESA.2018.9
• Yixin Cao, Ashutosh Rai, R. B. Sandeep, and Junjie Ye A Polynomial Kernel for Diamond-Free Editing 10.4230/LIPIcs.ESA.2018.10
• Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades 10.4230/LIPIcs.ESA.2018.11
• Diptarka Chakraborty, Debarati Das, Michal Koucký, and Nitin Saurabh Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity 10.4230/LIPIcs.ESA.2018.12
• Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, and Srinivasa Rao Satti A Framework for In-place Graph Algorithms 10.4230/LIPIcs.ESA.2018.13
• Cameron Chalk, Austin Luchsinger, Robert Schweller, and Tim Wylie Self-Assembly of Any Shape with Constant Tile Types using High Temperature 10.4230/LIPIcs.ESA.2018.14
• T-H. Hubert Chan, Haotian Jiang, and Shaofeng H.-C. Jiang A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics 10.4230/LIPIcs.ESA.2018.15
• Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, and Oren Weimann Near-Optimal Distance Emulator for Planar Graphs 10.4230/LIPIcs.ESA.2018.16
• Steven Chaplick, Minati De, Alexander Ravsky, and Joachim Spoerhase Approximation Schemes for Geometric Coverage Problems 10.4230/LIPIcs.ESA.2018.17
• Yun Kuen Cheung and Richard Cole Amortized Analysis of Asynchronous Price Dynamics 10.4230/LIPIcs.ESA.2018.18
• Markus Chimani and Tilo Wiedera Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast 10.4230/LIPIcs.ESA.2018.19
• Rajesh Chitnis, Andreas Emil Feldmann, and Pasin Manurangsi Parameterized Approximation Algorithms for Bidirected Steiner Network Problems 10.4230/LIPIcs.ESA.2018.20
• Marek Cygan, Artur Czumaj, Marcin Mucha, and Piotr Sankowski Online Facility Location with Deletions 10.4230/LIPIcs.ESA.2018.21
• Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, and Michiel Smid Improved Routing on the Delaunay Triangulation 10.4230/LIPIcs.ESA.2018.22
• Hu Ding and Manni Liu On Geometric Prototype and Applications 10.4230/LIPIcs.ESA.2018.23
• Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, and Uri Zwick Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees 10.4230/LIPIcs.ESA.2018.24
• Hicham El-Zein, Meng He, J. Ian Munro, and Bryce Sandlund Improved Time and Space Bounds for Dynamic Range Mode 10.4230/LIPIcs.ESA.2018.25
• Matthias Englert, David Mezlaf, and Matthias Westermann Online Makespan Scheduling with Job Migration on Uniform Machines 10.4230/LIPIcs.ESA.2018.26
• Alon Eden, Michal Feldman, Amos Fiat, and Tzahi Taub Truthful Prompt Scheduling for Minimizing Sum of Completion Times 10.4230/LIPIcs.ESA.2018.27
• Johannes K. Fichte, Markus Hecher, Stefan Woltran, and Markus Zisser Weighted Model Counting on the GPU by Exploiting Small Treewidth 10.4230/LIPIcs.ESA.2018.28
• Arnold Filtser and Ofer Neiman Light Spanners for High Dimensional Norms via Stochastic Decompositions 10.4230/LIPIcs.ESA.2018.29
• Fedor V. Fomin, Petr A. Golovach, and Jean-Florent Raymond On the Tractability of Optimization Problems on H-Graphs 10.4230/LIPIcs.ESA.2018.30
• Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, and Saket Saurabh On the Optimality of Pseudo-polynomial Algorithms for Integer Programming 10.4230/LIPIcs.ESA.2018.31
• Waldo Gálvez, José A. Soto, and José Verschae Symmetry Exploitation for Online Machine Covering with Bounded Migration 10.4230/LIPIcs.ESA.2018.32
• Michal Ganczorz, Pawel Gawrychowski, Artur Jez, and Tomasz Kociumaka Edit Distance with Block Operations 10.4230/LIPIcs.ESA.2018.33
• Shilpa Garg and Tobias Mömke A QPTAS for Gapless MEC 10.4230/LIPIcs.ESA.2018.34
• Arijit Ghosh, Sudeshna Kolay, and Gopinath Mishra FPT Algorithms for Embedding into Low Complexity Graphic Metrics 10.4230/LIPIcs.ESA.2018.35
• Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, and Devorah Kletenik The Stochastic Score Classification Problem 10.4230/LIPIcs.ESA.2018.36
• Isaac Goldstein, Moshe Lewenstein, and Ely Porat Improved Space-Time Tradeoffs for kSUM 10.4230/LIPIcs.ESA.2018.37
• Mordecai Golin, John Iacono, Stefan Langerman, J. Ian Munro, and Yakov Nekrich Dynamic Trees with Almost-Optimal Access Cost 10.4230/LIPIcs.ESA.2018.38
• Gramoz Goranci, Monika Henzinger, and Dariusz Leniowski A Tree Structure For Dynamic Facility Location 10.4230/LIPIcs.ESA.2018.39
• Gramoz Goranci, Monika Henzinger, and Pan Peng Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs 10.4230/LIPIcs.ESA.2018.40
• Mayank Goswami, Dzejla Medjedovic, Emina Mekic, and Prashant Pandey Buffered Count-Min Sketch on SSD: Theory and Experiments 10.4230/LIPIcs.ESA.2018.41
• Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, and Henning Meyerhenke Scalable Katz Ranking Computation in Large Static and Dynamic Graphs 10.4230/LIPIcs.ESA.2018.42
• Roberto Grossi and Luca Versari Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables 10.4230/LIPIcs.ESA.2018.43
• Yan Gu, Yihan Sun, and Guy E. Blelloch Algorithmic Building Blocks for Asymmetric Memories 10.4230/LIPIcs.ESA.2018.44
• Xiaoyu He, Neng Huang, and Xiaoming Sun On the Decision Tree Complexity of String Matching 10.4230/LIPIcs.ESA.2018.45
• Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, and Eva Rotenberg Decremental SPQR-trees for Planar Graphs 10.4230/LIPIcs.ESA.2018.46
• Bart M. P. Jansen and Jesper Nederlof Computing the Chromatic Number Using Graph Decompositions via Matrix Rank 10.4230/LIPIcs.ESA.2018.47
• Bart M. P. Jansen and Astrid Pieterse Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations 10.4230/LIPIcs.ESA.2018.48
• Michael Jarret, Stacey Jeffery, Shelby Kimmel, and Alvaro Piedrafita Quantum Algorithms for Connectivity and Related Problems 10.4230/LIPIcs.ESA.2018.49
• Vít Jelínek, Michal Opler, and Pavel Valtr Generalized Coloring of Permutations 10.4230/LIPIcs.ESA.2018.50
• Iyad Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen Solving Partition Problems Almost Always Requires Pushing Many Vertices Around 10.4230/LIPIcs.ESA.2018.51
• Dominik Kempa, Alberto Policriti, Nicola Prezza, and Eva Rotenberg String Attractors: Verification and Optimization 10.4230/LIPIcs.ESA.2018.52
• Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, and Philipp Zschoche Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments 10.4230/LIPIcs.ESA.2018.53
• Lucas Boczkowski, Amos Korman, and Yoav Rodeh Searching a Tree with Permanently Noisy Advice 10.4230/LIPIcs.ESA.2018.54
• Stefan Kratsch and Florian Nelles Efficient and Adaptive Parameterized Algorithms on Modular Decompositions 10.4230/LIPIcs.ESA.2018.55
• Marvin Künnemann On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress 10.4230/LIPIcs.ESA.2018.56
• Euiwoong Lee and Sahil Singla Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities 10.4230/LIPIcs.ESA.2018.57
• Umang Bhaskar and Phani Raj Lolakapuri Equilibrium Computation in Atomic Splittable Routing Games 10.4230/LIPIcs.ESA.2018.58
• Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, and Denis Trystram Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines 10.4230/LIPIcs.ESA.2018.59
• Tung Mai and Vijay V. Vazirani Finding Stable Matchings That Are Robust to Errors in the Input 10.4230/LIPIcs.ESA.2018.60
• Barnaby Martin, Daniël Paulusma, and Erik Jan van Leeuwen Disconnected Cuts in Claw-free Graphs 10.4230/LIPIcs.ESA.2018.61
• Michael Matheny and Jeff M. Phillips Practical Low-Dimensional Halfspace Range Space Sampling 10.4230/LIPIcs.ESA.2018.62
• J. Ian Munro and Sebastian Wild Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs 10.4230/LIPIcs.ESA.2018.63
• Nabil H. Mustafa and Saurabh Ray On a Problem of Danzer 10.4230/LIPIcs.ESA.2018.64
• Michal Pilipczuk, Erik Jan van Leeuwen, and Andreas Wiese Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs 10.4230/LIPIcs.ESA.2018.65
• Gábor Ivanyos, Anupam Prakash, and Miklos Santha On Learning Linear Functions from Subset and Its Applications in Quantum Computing 10.4230/LIPIcs.ESA.2018.66
• Jean-Daniel Boissonnat, Siddharth Pritam, and Divyansh Pareek Strong Collapse for Persistence 10.4230/LIPIcs.ESA.2018.67
• Maximilian Probst On the Complexity of the (Approximate) Nearest Colored Node Problem 10.4230/LIPIcs.ESA.2018.68
• Rajiv Raman and Saurabh Ray Planar Support for Non-piercing Regions and Applications 10.4230/LIPIcs.ESA.2018.69
• Daniel R. Schmidt, Bernd Zey, and François Margot An Exact Algorithm for the Steiner Forest Problem 10.4230/LIPIcs.ESA.2018.70
• Michael Dinitz, Michael Schapira, and Gal Shahaf Large Low-Diameter Graphs are Good Expanders 10.4230/LIPIcs.ESA.2018.71
• Shay Solomon and Nicole Wein Improved Dynamic Graph Coloring 10.4230/LIPIcs.ESA.2018.72
• Bo Zhou, Yi-Jen Chiang, and Chee Yap Soft Subdivision Motion Planning for Complex Planar Robots 10.4230/LIPIcs.ESA.2018.73