LIPIcs, Volume 204, ESA 2021

• Petra Mutzel, Rasmus Pagh, and Grzegorz Herman LIPIcs, Volume 204, ESA 2021, Complete Volume 10.4230/LIPIcs.ESA.2021
• Petra Mutzel, Rasmus Pagh, and Grzegorz Herman Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ESA.2021.0
• Lukas Glomb, Benno Hoch, Frauke Liers, and Florian Rösel Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk) 10.4230/LIPIcs.ESA.2021.1
• Aaron Roth A User Friendly Power Tool for Deriving Online Learning Algorithms (Invited Talk) 10.4230/LIPIcs.ESA.2021.2
• Saman Ahmadi, Guido Tack, Daniel Harabor, and Philip Kilby Bi-Objective Search with Bi-Directional A* 10.4230/LIPIcs.ESA.2021.3
• Maor Akav and Liam Roditty A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs 10.4230/LIPIcs.ESA.2021.4
• Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savić, Hendrik Schrezenmaier, Carlos Seara, and Martin Suderland The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination 10.4230/LIPIcs.ESA.2021.5
• Markus Anders and Pascal Schweitzer Parallel Computation of Combinatorial Symmetries 10.4230/LIPIcs.ESA.2021.6
• Sepehr Assadi, Deeparnab Chakrabarty, and Sanjeev Khanna Graph Connectivity and Single Element Recovery via Linear and OR Queries 10.4230/LIPIcs.ESA.2021.7
• Sepehr Assadi and Shay Solomon Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach 10.4230/LIPIcs.ESA.2021.8
• Nikhil Ayyadevara and Ashish Chiplunkar The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential 10.4230/LIPIcs.ESA.2021.9
• Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, and Jens Schlöter Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty 10.4230/LIPIcs.ESA.2021.10
• Jørgen Bang-Jensen, Kristine Vitting Klinkby, and Saket Saurabh k-Distinct Branchings Admits a Polynomial Kernel 10.4230/LIPIcs.ESA.2021.11
• Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, and Clifford Stein Incremental Edge Orientation in Forests 10.4230/LIPIcs.ESA.2021.12
• Mark de Berg, Morteza Monemizadeh, and Yu Zhong k-Center Clustering with Outliers in the Sliding-Window Model 10.4230/LIPIcs.ESA.2021.13
• Aaron Bernstein, Aditi Dudeja, and Seth Pettie Incremental SCC Maintenance in Sparse Graphs 10.4230/LIPIcs.ESA.2021.14
• Nico Bertram, Jonas Ellert, and Johannes Fischer Lyndon Words Accelerate Suffix Sorting 10.4230/LIPIcs.ESA.2021.15
• Sujoy Bhore and Csaba D. Tóth Online Euclidean Spanners 10.4230/LIPIcs.ESA.2021.16
• Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, and Graeme Stroud Distant Representatives for Rectangles in the Plane 10.4230/LIPIcs.ESA.2021.17
• Davide Bilò, Sarel Cohen, Tobias Friedrich, and Martin Schirneck Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles 10.4230/LIPIcs.ESA.2021.18
• Thomas Bläsius, Simon D. Fink, and Ignaz Rutter Synchronized Planarity with Applications to Constrained Planarity Problems 10.4230/LIPIcs.ESA.2021.19
• Thomas Bläsius, Tobias Friedrich, and Maximilian Katzmann Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry 10.4230/LIPIcs.ESA.2021.20
• Thomas Bläsius, Tobias Friedrich, and Christopher Weyand Efficiently Computing Maximum Flows in Scale-Free Networks 10.4230/LIPIcs.ESA.2021.21
• Alexander Braun, Matthias Buttkus, and Thomas Kesselheim Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions 10.4230/LIPIcs.ESA.2021.22
• David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete 10.4230/LIPIcs.ESA.2021.23
• Jean Cardinal, Justin Dallant, and John Iacono An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility 10.4230/LIPIcs.ESA.2021.24
• Jean Cardinal, John Iacono, and Grigorios Koumoutsos Worst-Case Efficient Dynamic Geometric Independent Set 10.4230/LIPIcs.ESA.2021.25
• Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, and Ziena Zeif Balanced Crown Decomposition for Connectivity Constraints 10.4230/LIPIcs.ESA.2021.26
• Timothy M. Chan All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error 10.4230/LIPIcs.ESA.2021.27
• Timothy M. Chan and Zhengcheng Huang Dynamic Colored Orthogonal Range Searching 10.4230/LIPIcs.ESA.2021.28
• Karthekeyan Chandrasekaran and Weihang Wang 𝓁_p-Norm Multiway Cut 10.4230/LIPIcs.ESA.2021.29
• Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, and Jakub Radoszewski Faster Algorithms for Longest Common Substring 10.4230/LIPIcs.ESA.2021.30
• Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, and Qian Yu Feature Cross Search via Submodular Optimization 10.4230/LIPIcs.ESA.2021.31
• Éric Colin de Verdière and Thomas Magnard An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes 10.4230/LIPIcs.ESA.2021.32
• Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk, Moritz Venzin, and Robert Weismantel Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity 10.4230/LIPIcs.ESA.2021.33
• Radu Curticapean, Holger Dell, and Thore Husfeldt Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths 10.4230/LIPIcs.ESA.2021.34
• Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, and Grigory Reznikov Minimum Common String Partition: Exact Algorithms 10.4230/LIPIcs.ESA.2021.35
• Daniel Dadush, Zhuan Khye Koh, Bento Natura, and László A. Végh An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems 10.4230/LIPIcs.ESA.2021.36
• Michał Dębski, Marta Piecyk, and Paweł Rzążewski Faster 3-Coloring of Small-Diameter Graphs 10.4230/LIPIcs.ESA.2021.37
• Hu Ding Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning 10.4230/LIPIcs.ESA.2021.38
• Pavel Dvořák, Michal Koucký, Karel Král, and Veronika Slívová Data Structures Lower Bounds and Popular Conjectures 10.4230/LIPIcs.ESA.2021.39
• Zdeněk Dvořák and Abhiruk Lahiri Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs 10.4230/LIPIcs.ESA.2021.40
• Yaron Fairstein, Ariel Kulik, and Hadas Shachnai Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping 10.4230/LIPIcs.ESA.2021.41
• Hendrik Fichtenberger, Monika Henzinger, and Lara Ost Differentially Private Algorithms for Graphs Under Continual Observation 10.4230/LIPIcs.ESA.2021.42
• Simon D. Fink, Matthias Pfretzschner, and Ignaz Rutter Experimental Comparison of PC-Trees and PQ-Trees 10.4230/LIPIcs.ESA.2021.43
• Alejandro Flores-Velazco and David M. Mount Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification 10.4230/LIPIcs.ESA.2021.44
• Moses Ganardi Compression by Contracting Straight-Line Programs 10.4230/LIPIcs.ESA.2021.45
• Younan Gao and Meng He Space Efficient Two-Dimensional Orthogonal Colored Range Counting 10.4230/LIPIcs.ESA.2021.46
• Loukas Georgiadis, Giuseppe F. Italiano, and Evangelos Kosinas Computing the 4-Edge-Connected Components of a Graph in Linear Time 10.4230/LIPIcs.ESA.2021.47
• Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, and Daniel Seemaier Deep Multilevel Graph Partitioning 10.4230/LIPIcs.ESA.2021.48
• Fabrizio Grandoni, Tobias Mömke, and Andreas Wiese Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back 10.4230/LIPIcs.ESA.2021.49
• Yassine Hamoudi Quantum Sub-Gaussian Mean Estimator 10.4230/LIPIcs.ESA.2021.50
• Sariel Har-Peled and Timothy Zhou Improved Approximation Algorithms for Tverberg Partitions 10.4230/LIPIcs.ESA.2021.51
• Zhiyang He, Jason Li, and Magnus Wahlström Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs 10.4230/LIPIcs.ESA.2021.52
• Klaus Jansen and Malin Rau Closing the Gap for Single Resource Constraint Scheduling 10.4230/LIPIcs.ESA.2021.53
• Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, and Chee Yap Certified Approximation Algorithms for the Fermat Point and n-Ellipses 10.4230/LIPIcs.ESA.2021.54
• Leon Kellerhals, Malte Renken, and Philipp Zschoche Parameterized Algorithms for Diverse Multistage Problems 10.4230/LIPIcs.ESA.2021.55
• Dominik Kempa and Ben Langmead Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing 10.4230/LIPIcs.ESA.2021.56
• Boris Klemz Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing 10.4230/LIPIcs.ESA.2021.57
• Benoît Larose, Petar Marković, Barnaby Martin, Daniël Paulusma, Siani Smith, and Stanislav Živný QCSP on Reflexive Tournaments 10.4230/LIPIcs.ESA.2021.58
• Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing 10.4230/LIPIcs.ESA.2021.59
• David J. Lee, Samuel McCauley, Shikha Singh, and Max Stein Telescoping Filter: A Practical Adaptive Filter 10.4230/LIPIcs.ESA.2021.60
• Jasper C.H. Lee, Jerry Li, Christopher Musco, Jeff M. Phillips, and Wai Ming Tai Finding an Approximate Mode of a Kernel Density Estimate 10.4230/LIPIcs.ESA.2021.61
• Marilena Leichter, Benjamin Moseley, and Kirk Pruhs An Efficient Reduction of a Gammoid to a Partition Matroid 10.4230/LIPIcs.ESA.2021.62
• Daniel Lokshtanov, Subhash Suri, and Jie Xue Efficient Algorithms for Least Square Piecewise Polynomial Regression 10.4230/LIPIcs.ESA.2021.63
• Grigorios Loukides and Solon P. Pissis Bidirectional String Anchors: A New String Sampling Mechanism 10.4230/LIPIcs.ESA.2021.64
• Anna Lubiw and Anurag Murty Naredla The Visibility Center of a Simple Polygon 10.4230/LIPIcs.ESA.2021.65
• Ryoga Mahara Extension of Additive Valuations to General Valuations on the Existence of EFX 10.4230/LIPIcs.ESA.2021.66
• Tomás Martínez-Muñoz and Andreas Wiese FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees 10.4230/LIPIcs.ESA.2021.67
• Claire Mathieu and Hang Zhou A Simple Algorithm for Graph Reconstruction 10.4230/LIPIcs.ESA.2021.68
• William Maxwell and Amir Nayyeri Generalized Max-Flows and Min-Cuts in Simplicial Complexes 10.4230/LIPIcs.ESA.2021.69
• J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, and Sebastian Wild Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima 10.4230/LIPIcs.ESA.2021.70
• Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, and Marek Sokołowski Determining 4-Edge-Connected Components in Linear Time 10.4230/LIPIcs.ESA.2021.71
• Daniel Neuen Isomorphism Testing Parameterized by Genus and Beyond 10.4230/LIPIcs.ESA.2021.72
• Katarzyna Paluch and Mateusz Wasylkiewicz Restricted t-Matchings via Half-Edges 10.4230/LIPIcs.ESA.2021.73
• Ojas Parekh and Kevin Thompson Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems 10.4230/LIPIcs.ESA.2021.74
• Eden Pelleg and Stanislav Živný Additive Sparsification of CSPs 10.4230/LIPIcs.ESA.2021.75
• Krzysztof Potępa Faster Deterministic Modular Subset Sum 10.4230/LIPIcs.ESA.2021.76
• Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, and Wiktor Zuba Hardness of Detecting Abelian and Additive Square Factors in Strings 10.4230/LIPIcs.ESA.2021.77
• M. S. Ramanujan On Approximate Compressions for Connected Minor-Hitting Sets 10.4230/LIPIcs.ESA.2021.78
• Guillaume Sagnol and Daniel Schmidt genannt Waldschmidt Restricted Adaptivity in Stochastic Scheduling 10.4230/LIPIcs.ESA.2021.79
• Yishu Wang, Arnaud Mary, Marie-France Sagot, and Blerina Sinaimeri A General Framework for Enumerating Equivalence Classes of Solutions 10.4230/LIPIcs.ESA.2021.80
• Marvin Williams, Peter Sanders, and Roman Dementiev Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues 10.4230/LIPIcs.ESA.2021.81
• Florian Wörz and Jan-Hendrik Lorenz Evidence for Long-Tails in SLS Algorithms 10.4230/LIPIcs.ESA.2021.82