LIPIcs, Volume 144, ESA 2019

• Michael A. Bender, Ola Svensson, and Grzegorz Herman LIPIcs, Volume 144, ESA'19, Complete Volume 10.4230/LIPIcs.ESA.2019
• Michael A. Bender, Ola Svensson, and Grzegorz Herman Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ESA.2019.0
• Marek Adamczyk, Jarosław Byrka, Jan Marcinkowski, Syed M. Meesum, and Michał Włodarczyk Constant-Factor FPT Approximation for Capacitated k-Median 10.4230/LIPIcs.ESA.2019.1
• Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, and Nodari Sitchinava Fragile Complexity of Comparison-Based Algorithms 10.4230/LIPIcs.ESA.2019.2
• Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Matias Korman, Belen Palop, Irene Parada, André van Renssen, and Vera Sacristán Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers 10.4230/LIPIcs.ESA.2019.3
• Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, and Christian Wulff-Nilsen Constructing Light Spanners Deterministically in Near-Linear Time 10.4230/LIPIcs.ESA.2019.4
• Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, and Eitan Kondratovsky Repetition Detection in a Dynamic String 10.4230/LIPIcs.ESA.2019.5
• Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, and Jakub Radoszewski Longest Common Substring Made Fully Dynamic 10.4230/LIPIcs.ESA.2019.6
• Haris Angelidakis, Pranjal Awasthi, Avrim Blum, Vaggos Chatziafratis, and Chen Dan Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem 10.4230/LIPIcs.ESA.2019.7
• Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, and Lukas Nölke On the Complexity of Anchored Rectangle Packing 10.4230/LIPIcs.ESA.2019.8
• Simon Apers Quantum Walk Sampling by Growing Seed Sets 10.4230/LIPIcs.ESA.2019.9
• Martin Aumüller, Tobias Christiani, Rasmus Pagh, and Michael Vesterli PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors 10.4230/LIPIcs.ESA.2019.10
• Evripidis Bampis, Bruno Escoffier, Kevin Schewior, and Alexandre Teiller Online Multistage Subset Maximization Problems 10.4230/LIPIcs.ESA.2019.11
• Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, and Kasturi Varadarajan A Constant Approximation for Colorful k-Center 10.4230/LIPIcs.ESA.2019.12
• Ulrich Bauer, Abhishek Rathod, and Jonathan Spreer Parametrized Complexity of Expansion Height 10.4230/LIPIcs.ESA.2019.13
• Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, and Tobias Zündorf UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution 10.4230/LIPIcs.ESA.2019.14
• Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, and Hamed Saleh Streaming and Massively Parallel Algorithms for Edge Coloring 10.4230/LIPIcs.ESA.2019.15
• Aleksandrs Belovs Quantum Algorithms for Classical Probability Distributions 10.4230/LIPIcs.ESA.2019.16
• Benjamin Bergougnoux and Mamadou Moustapha Kanté More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints 10.4230/LIPIcs.ESA.2019.17
• Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, and Lars Rohwedder Online Bin Covering with Limited Migration 10.4230/LIPIcs.ESA.2019.18
• Juan José Besa, Giordano Da Lozzo, and Michael T. Goodrich Computing k-Modal Embeddings of Planar Digraphs 10.4230/LIPIcs.ESA.2019.19
• Georgios Birmpas, Evangelos Markakis, and Guido Schäfer Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond 10.4230/LIPIcs.ESA.2019.20
• Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, and Christopher Weyand Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs 10.4230/LIPIcs.ESA.2019.21
• Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, and Marc Glisse Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets 10.4230/LIPIcs.ESA.2019.22
• Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, and Łukasz Kowalik Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP 10.4230/LIPIcs.ESA.2019.23
• Nicolas Bousquet and Valentin Bartier Linear Transformations Between Colorings in Chordal Graphs 10.4230/LIPIcs.ESA.2019.24
• Cornelius Brand Patching Colors with Tensors 10.4230/LIPIcs.ESA.2019.25
• Karl Bringmann, Sándor Kisfaludi-Bak, Michał Pilipczuk, and Erik Jan van Leeuwen On Geometric Set Cover for Orthants 10.4230/LIPIcs.ESA.2019.26
• Deeparnab Chakrabarty and Chaitanya Swamy Simpler and Better Algorithms for Minimum-Norm Load Balancing 10.4230/LIPIcs.ESA.2019.27
• Jiehua Chen, Danny Hermelin, and Manuel Sorge On Computing Centroids According to the p-Norms of Hamming Distance Vectors 10.4230/LIPIcs.ESA.2019.28
• Jing Chen, Samuel McCauley, and Shikha Singh Non-Cooperative Rational Interactive Proofs 10.4230/LIPIcs.ESA.2019.29
• Markus Chimani and Tilo Wiedera Stronger ILPs for the Graph Genus Problem 10.4230/LIPIcs.ESA.2019.30
• Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski, Sophie Spirkl, and Mingxian Zhong Complexity of C_k-Coloring in Hereditary Classes of Graphs 10.4230/LIPIcs.ESA.2019.31
• Jinhee Chun, Kenya Kikuchi, and Takeshi Tokuyama Consistent Digital Curved Rays and Pseudoline Arrangements 10.4230/LIPIcs.ESA.2019.32
• Vincent Cohen-Addad, Marcin Pilipczuk, and Michał Pilipczuk Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs 10.4230/LIPIcs.ESA.2019.33
• Wojciech Czerwiński, Wojciech Nadara, and Marcin Pilipczuk Improved Bounds for the Excluded-Minor Approximation of Treedepth 10.4230/LIPIcs.ESA.2019.34
• Jurek Czyzowicz, Dariusz Dereniowski, and Andrzej Pelc Building a Nest by an Automaton 10.4230/LIPIcs.ESA.2019.35
• Rami Daknama, Konstantinos Panagiotou, and Simon Reisser Robustness of Randomized Rumour Spreading 10.4230/LIPIcs.ESA.2019.36
• Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, and Andrew van der Poel Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class 10.4230/LIPIcs.ESA.2019.37
• Martin Dietzfelbinger and Stefan Walzer Dense Peelable Random Uniform Hypergraphs 10.4230/LIPIcs.ESA.2019.38
• Martin Dietzfelbinger and Stefan Walzer Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications 10.4230/LIPIcs.ESA.2019.39
• Hu Ding, Haikuo Yu, and Zixiu Wang Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction 10.4230/LIPIcs.ESA.2019.40
• Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, and Manuel Penschuck Bidirectional Text Compression in External Memory 10.4230/LIPIcs.ESA.2019.41
• Eduard Eiben, Daniel Lokshtanov, and Amer E. Mouawad Bisection of Bounded Treewidth Graphs by Convolutions 10.4230/LIPIcs.ESA.2019.42
• Khaled Elbassioni and Kazuhisa Makino Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs 10.4230/LIPIcs.ESA.2019.43
• Yuval Emek, Adam Goldbraikh, and Erez Kantor Online Disjoint Set Cover Without Prior Knowledge 10.4230/LIPIcs.ESA.2019.44
• Yuval Emek, Shay Kutten, Ron Lavi, and Yangguang Shi Bayesian Generalized Network Design 10.4230/LIPIcs.ESA.2019.45
• Diodato Ferraioli, Adrian Meier, Paolo Penna, and Carmine Ventre Obviously Strategyproof Mechanisms for Machine Scheduling 10.4230/LIPIcs.ESA.2019.46
• Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi Going Far From Degeneracy 10.4230/LIPIcs.ESA.2019.47
• Robert Ganian, Sebastian Ordyniak, and C. S. Rahul Group Activity Selection with Few Agent Types 10.4230/LIPIcs.ESA.2019.48
• Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna Optimal Sorting with Persistent Comparison Errors 10.4230/LIPIcs.ESA.2019.49
• Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, and Luigi Laura Dynamic Dominators and Low-High Orders in DAGs 10.4230/LIPIcs.ESA.2019.50
• Daniel Gibney and Sharma V. Thankachan On the Hardness and Inapproximability of Recognizing Wheeler Graphs 10.4230/LIPIcs.ESA.2019.51
• Lars Gottesbüren, Michael Hamann, and Dorothea Wagner Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm 10.4230/LIPIcs.ESA.2019.52
• Fabrizio Grandoni, Stefan Kratsch, and Andreas Wiese Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack 10.4230/LIPIcs.ESA.2019.53
• Fabrizio Grandoni and Andreas Wiese Packing Cars into Narrow Roads: PTASs for Limited Supply Highway 10.4230/LIPIcs.ESA.2019.54
• Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, and Matthias Wolf Engineering Negative Cycle Canceling for Wind Farm Cabling 10.4230/LIPIcs.ESA.2019.55
• Arash Haddadan and Alantha Newman Towards Improving Christofides Algorithm for Half-Integer TSP 10.4230/LIPIcs.ESA.2019.56
• Yael Hitron and Merav Parter Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons 10.4230/LIPIcs.ESA.2019.57
• Michael Hoffmann and Boris Klemz Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian 10.4230/LIPIcs.ESA.2019.58
• Lorenz Hübschle-Schneider and Peter Sanders Parallel Weighted Random Sampling 10.4230/LIPIcs.ESA.2019.59
• John Iacono, Riko Jacob, and Konstantinos Tsakalidis External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms 10.4230/LIPIcs.ESA.2019.60
• Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto Shortest Reconfiguration of Perfect Matchings via Alternating Cycles 10.4230/LIPIcs.ESA.2019.61
• Klaus Jansen and Malin Rau Closing the Gap for Pseudo-Polynomial Strip Packing 10.4230/LIPIcs.ESA.2019.62
• Michael Jünger and Sven Mallach Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization 10.4230/LIPIcs.ESA.2019.63
• Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, and Micha Sharir Triangles and Girth in Disk Graphs and Transmission Graphs 10.4230/LIPIcs.ESA.2019.64
• Adam Karczmarz and Jakub Łącki Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs 10.4230/LIPIcs.ESA.2019.65
• Adam Karczmarz and Piotr Sankowski Min-Cost Flow in Unit-Capacity Planar Graphs 10.4230/LIPIcs.ESA.2019.66
• Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, and Carola Wenk Global Curve Simplification 10.4230/LIPIcs.ESA.2019.67
• Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, and Soumyabrata Pal Trace Reconstruction: Generalized and Parameterized 10.4230/LIPIcs.ESA.2019.68
• Ariel Kulik, Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai Generalized Assignment via Submodular Optimization with Reserved Capacity 10.4230/LIPIcs.ESA.2019.69
• Stefano Leucci, Chih-Hung Liu, and Simon Meierhans Resilient Dictionaries for Randomly Unreliable Memory 10.4230/LIPIcs.ESA.2019.70
• Huan Li, He Sun, and Luca Zanetti Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem 10.4230/LIPIcs.ESA.2019.71
• Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Paweł Rzążewski, and Manuel Sorge Packing Directed Circuits Quarter-Integrally 10.4230/LIPIcs.ESA.2019.72
• Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, and Karol Węgrzycki Equal-Subset-Sum Faster Than the Meet-in-the-Middle 10.4230/LIPIcs.ESA.2019.73
• Rasmus Pagh, Nina Mesing Stausholm, and Mikkel Thorup Hardness of Bichromatic Closest Pair with Jaccard Similarity 10.4230/LIPIcs.ESA.2019.74
• Harald Räcke and Stefan Schmid Compact Oblivious Routing 10.4230/LIPIcs.ESA.2019.75
• Marcel Radermacher and Ignaz Rutter Geometric Crossing-Minimization - A Scalable Randomized Approach 10.4230/LIPIcs.ESA.2019.76
• M. S. Ramanujan An Approximate Kernel for Connected Feedback Vertex Set 10.4230/LIPIcs.ESA.2019.77
• R. Ravi and Oleksandr Rudenko Multicommodity Multicast, Wireless and Fast 10.4230/LIPIcs.ESA.2019.78
• Jonathan Rollin, Lena Schlipf, and André Schulz Recognizing Planar Laman Graphs 10.4230/LIPIcs.ESA.2019.79
• Ignaz Rutter, Darren Strash, Peter Stumpf, and Michael Vollmer Simultaneous Representation of Proper and Unit Interval Graphs 10.4230/LIPIcs.ESA.2019.80
• Barna Saha and Sanjay Subramanian Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost 10.4230/LIPIcs.ESA.2019.81
• Roy Schwartz and Ran Yeheskel Graph Balancing with Orientation Costs 10.4230/LIPIcs.ESA.2019.82
• Elena Farahbakhsh Touli and Yusu Wang FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees 10.4230/LIPIcs.ESA.2019.83