LIPIcs, Volume 173, ESA 2020

• Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders LIPIcs, Volume 173, ESA 2020, Complete Volume 10.4230/LIPIcs.ESA.2020
• Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ESA.2020.0
• A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, and Joseph S. B. Mitchell Planar Bichromatic Bottleneck Spanning Trees 10.4230/LIPIcs.ESA.2020.1
• Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, and Sam Westrick Parallel Batch-Dynamic Trees via Change Propagation 10.4230/LIPIcs.ESA.2020.2
• Ramtin Afshar, Michael T. Goodrich, Pedro Matias, and Martha C. Osegueda Reconstructing Biological and Digital Phylogenetic Trees in Parallel 10.4230/LIPIcs.ESA.2020.3
• Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem 10.4230/LIPIcs.ESA.2020.4
• Amihood Amir, Itai Boneh, Michael Itzhaki, and Eitan Kondratovsky Analysis of the Period Recovery Error Bound 10.4230/LIPIcs.ESA.2020.5
• Eugenio Angriman, Maria Predari, Alexander van der Grinten, and Henning Meyerhenke Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis 10.4230/LIPIcs.ESA.2020.6
• Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, and Csaba D. Tóth Cutting Polygons into Small Pieces with Chords: Laser-Based Localization 10.4230/LIPIcs.ESA.2020.7
• Yossi Azar, Ashish Chiplunkar, Shay Kutten, and Noam Touitou Set Cover with Delay - Clairvoyance Is Not Required 10.4230/LIPIcs.ESA.2020.8
• Sayan Bandyapadhyay Improved Bounds for Metric Capacitated Covering Problems 10.4230/LIPIcs.ESA.2020.9
• Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, and Dror Rawitz Minimum Neighboring Degree Realization in Graphs and Trees 10.4230/LIPIcs.ESA.2020.10
• Siddharth Barman, Umang Bhaskar, Anand Krishna, and Ranjani G. Sundaram Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations 10.4230/LIPIcs.ESA.2020.11
• Surender Baswana, Shiv Gupta, and Till Knollmann Mincut Sensitivity Data Structures for the Insertion of an Edge 10.4230/LIPIcs.ESA.2020.12
• Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, and Martin Strehler Linear Time LexDFS on Chordal Graphs 10.4230/LIPIcs.ESA.2020.13
• Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Yota Otachi Grundy Distinguishes Treewidth from Pathwidth 10.4230/LIPIcs.ESA.2020.14
• Jason W. Bentley, Daniel Gibney, and Sharma V. Thankachan On the Complexity of BWT-Runs Minimization via Alphabet Reordering 10.4230/LIPIcs.ESA.2020.15
• Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, and Hung Tran Simulating Population Protocols in Sub-Constant Time per Interaction 10.4230/LIPIcs.ESA.2020.16
• Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Miloš Trujić, and Emo Welzl An Optimal Decentralized (Δ + 1)-Coloring Algorithm 10.4230/LIPIcs.ESA.2020.17
• Anup Bhattacharya, Jan Eube, Heiko Röglin, and Melanie Schmidt Noisy, Greedy and Not so Greedy k-Means++ 10.4230/LIPIcs.ESA.2020.18
• Sujoy Bhore, Guangping Li, and Martin Nöllenburg An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling 10.4230/LIPIcs.ESA.2020.19
• Johannes Blum and Sabine Storandt Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies 10.4230/LIPIcs.ESA.2020.20
• Thomas Bläsius, Tobias Friedrich, and Martin Schirneck The Minimization of Random Hypergraphs 10.4230/LIPIcs.ESA.2020.21
• Jan Bok, Nikola Jedlic̆ková, Barnaby Martin, Daniël Paulusma, and Siani Smith Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs 10.4230/LIPIcs.ESA.2020.22
• Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, and Rémi Watrigant An Algorithmic Weakening of the Erdős-Hajnal Conjecture 10.4230/LIPIcs.ESA.2020.23
• Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, and Kunihiro Wasa Reconfiguration of Spanning Trees with Many or Few Leaves 10.4230/LIPIcs.ESA.2020.24
• Karl Bringmann, Marvin Künnemann, and André Nusser When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation 10.4230/LIPIcs.ESA.2020.25
• Peter A. Brooksbank, Yinan Li, Youming Qiao, and James B. Wilson Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice 10.4230/LIPIcs.ESA.2020.26
• Kevin Buchin, Sariel Har-Peled, and Dániel Oláh Sometimes Reliable Spanners of Almost Linear Size 10.4230/LIPIcs.ESA.2020.27
• Parinya Chalermsook and Wanchote Po Jiamjitrak New Binary Search Tree Bounds via Geometric Inversions 10.4230/LIPIcs.ESA.2020.28
• Timothy M. Chan and Qizheng He More on Change-Making and Related Problems 10.4230/LIPIcs.ESA.2020.29
• Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, and Minshen Zhu The Maximum Binary Tree Problem 10.4230/LIPIcs.ESA.2020.30
• Panagiotis Charalampopoulos and Adam Karczmarz Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs 10.4230/LIPIcs.ESA.2020.31
• Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, and Wiktor Zuba The Number of Repetitions in 2D-Strings 10.4230/LIPIcs.ESA.2020.32
• Lin Chen, Martin Koutecký, Lei Xu, and Weidong Shi New Bounds on Augmenting Steps of Block-Structured Integer Programs 10.4230/LIPIcs.ESA.2020.33
• Man-Kwun Chiu, Matias Korman, Martin Suderland, and Takeshi Tokuyama Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays 10.4230/LIPIcs.ESA.2020.34
• Maria Chudnovsky, Jason King, Michał Pilipczuk, Paweł Rzążewski, and Sophie Spirkl Finding Large H-Colorable Subgraphs in Hereditary Graph Classes 10.4230/LIPIcs.ESA.2020.35
• Philipp Czerner and Harald Räcke Compact Oblivious Routing in Weighted Graphs 10.4230/LIPIcs.ESA.2020.36
• Shichuan Deng, Jian Li, and Yuval Rabani Approximation Algorithms for Clustering with Dynamic Points 10.4230/LIPIcs.ESA.2020.37
• Hu Ding A Sub-Linear Time Framework for Geometric Optimization with Outliers in High Dimensions 10.4230/LIPIcs.ESA.2020.38
• Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, and Florian Kurpicz Practical Performance of Space Efficient Data Structures for Longest Common Extensions 10.4230/LIPIcs.ESA.2020.39
• Jan Dreier, Philipp Kuinke, and Peter Rossmanith First-Order Model-Checking in Random Graphs and Complex Networks 10.4230/LIPIcs.ESA.2020.40
• Franziska Eberle, Nicole Megow, and Kevin Schewior Optimally Handling Commitment Issues in Online Throughput Maximization 10.4230/LIPIcs.ESA.2020.41
• Eduard Eiben and William Lochet A Polynomial Kernel for Line Graph Deletion 10.4230/LIPIcs.ESA.2020.42
• Friedrich Eisenbrand and Moritz Venzin Approximate CVP_p in Time 2^{0.802 n} 10.4230/LIPIcs.ESA.2020.43
• Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, and Hadas Shachnai A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem 10.4230/LIPIcs.ESA.2020.44
• Chenglin Fan and Benjamin Raichel Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams 10.4230/LIPIcs.ESA.2020.45
• Andreas Emil Feldmann and David Saulpic Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs 10.4230/LIPIcs.ESA.2020.46
• Alejandro Flores-Velazco and David M. Mount Coresets for the Nearest-Neighbor Rule 10.4230/LIPIcs.ESA.2020.47
• Fedor V. Fomin and Petr A. Golovach Kernelization of Whitney Switches 10.4230/LIPIcs.ESA.2020.48
• Fedor V. Fomin and Petr A. Golovach Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs 10.4230/LIPIcs.ESA.2020.49
• Fedor V. Fomin, Petr Golovach, Pranabendu Misra, and M. S. Ramanujan On the Complexity of Recovering Incidence Matrices 10.4230/LIPIcs.ESA.2020.50
• Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL 10.4230/LIPIcs.ESA.2020.51
• Zachary Friggstad and Chaitanya Swamy A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time 10.4230/LIPIcs.ESA.2020.52
• Henry Förster and Michael Kaufmann On Compact RAC Drawings 10.4230/LIPIcs.ESA.2020.53
• Younan Gao, Meng He, and Yakov Nekrich Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing 10.4230/LIPIcs.ESA.2020.54
• Naveen Garg and Nikhil Kumar Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow 10.4230/LIPIcs.ESA.2020.55
• Martin Held and Stefan de Lorenzo An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams 10.4230/LIPIcs.ESA.2020.56
• Monika Henzinger and Sagar Kale Fully-Dynamic Coresets 10.4230/LIPIcs.ESA.2020.57
• Monika Henzinger, Shahbaz Khan, Richard Paul, and Christian Schulz Dynamic Matching Algorithms in Practice 10.4230/LIPIcs.ESA.2020.58
• Monika Henzinger, Alexander Noe, Christian Schulz, and Darren Strash Finding All Global Minimum Cuts in Practice 10.4230/LIPIcs.ESA.2020.59
• Eva-Maria C. Hols, Stefan Kratsch, and Astrid Pieterse Approximate Turing Kernelization for Problems Parameterized by Treewidth 10.4230/LIPIcs.ESA.2020.60
• Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, and Sharma V. Thankachan The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance 10.4230/LIPIcs.ESA.2020.61
• Tanmay Inamdar and Kasturi Varadarajan Capacitated Sum-Of-Radii Clustering: An FPT Approximation 10.4230/LIPIcs.ESA.2020.62
• Bart M. P. Jansen and Michał Włodarczyk Optimal Polynomial-Time Compression for Boolean Max CSP 10.4230/LIPIcs.ESA.2020.63
• Mamadou Moustapha Kanté, Christophe Paul, and Dimitrios M. Thilikos A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth 10.4230/LIPIcs.ESA.2020.64
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer Exploiting c-Closure in Kernelization Algorithms for Graph Problems 10.4230/LIPIcs.ESA.2020.65
• Łukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, and Magnus Wahlström Many Visits TSP Revisited 10.4230/LIPIcs.ESA.2020.66
• Hung Le and Shay Solomon Light Euclidean Spanners with Steiner Points 10.4230/LIPIcs.ESA.2020.67
• Victor Lecomte and Omri Weinstein Settling the Relationship Between Wilber’s Bounds for Dynamic Optimality 10.4230/LIPIcs.ESA.2020.68
• Lily Li and Aleksandar Nikolov On the Computational Complexity of Linear Discrepancy 10.4230/LIPIcs.ESA.2020.69
• Bogdan-Adrian Manghiuc, Pan Peng, and He Sun Augmenting the Algebraic Connectivity of Graphs 10.4230/LIPIcs.ESA.2020.70
• Dániel Marx Chordless Cycle Packing Is Fixed-Parameter Tractable 10.4230/LIPIcs.ESA.2020.71
• Dániel Marx and R. B. Sandeep Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy 10.4230/LIPIcs.ESA.2020.72
• Zeev Nutov Approximating k-Connected m-Dominating Sets 10.4230/LIPIcs.ESA.2020.73
• Karolina Okrasa, Marta Piecyk, and Paweł Rzążewski Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs 10.4230/LIPIcs.ESA.2020.74
• Georg Osang, Mael Rouxel-Labbé, and Monique Teillaud Generalizing CGAL Periodic Delaunay Triangulations 10.4230/LIPIcs.ESA.2020.75
• Ioannis Panagiotas and Bora Uçar Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching 10.4230/LIPIcs.ESA.2020.76
• Jakub Radoszewski and Juliusz Straszyński Efficient Computation of 2-Covers of a String 10.4230/LIPIcs.ESA.2020.77
• Rajiv Raman and Saurabh Ray Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions 10.4230/LIPIcs.ESA.2020.78
• Hanlin Ren Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time 10.4230/LIPIcs.ESA.2020.79
• Philipp Schepper Fine-Grained Complexity of Regular Expression Pattern Matching and Membership 10.4230/LIPIcs.ESA.2020.80
• Ben Strasser, Dorothea Wagner, and Tim Zeitz Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks 10.4230/LIPIcs.ESA.2020.81
• Hanrui Zhang Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents 10.4230/LIPIcs.ESA.2020.82
• Xianghui Zhong On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP 10.4230/LIPIcs.ESA.2020.83