LIPIcs, Volume 244, ESA 2022

• Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman LIPIcs, Volume 244, ESA 2022, Complete Volume 10.4230/LIPIcs.ESA.2022
• Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ESA.2022.0
• Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, and Kevin Mann Enumerating Minimal Connected Dominating Sets 10.4230/LIPIcs.ESA.2022.1
• Raghavendra Addanki, Andrew McGregor, and Cameron Musco Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries 10.4230/LIPIcs.ESA.2022.2
• Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, and Nicole Wein Hardness of Token Swapping on Trees 10.4230/LIPIcs.ESA.2022.3
• Susanne Albers and Sebastian Schubert Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities 10.4230/LIPIcs.ESA.2022.4
• Henk Alkema, Mark de Berg, Morteza Monemizadeh, and Leonidas Theocharous TSP in a Simple Polygon 10.4230/LIPIcs.ESA.2022.5
• Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, and Miklos Santha Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming 10.4230/LIPIcs.ESA.2022.6
• Georg Anegg, Laura Vargas Koch, and Rico Zenklusen Techniques for Generalized Colorful k-Center Problems 10.4230/LIPIcs.ESA.2022.7
• Mohammad Ansari, Mohammad Saneian, and Hamid Zarrabi-Zadeh Simple Streaming Algorithms for Edge Coloring 10.4230/LIPIcs.ESA.2022.8
• Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, and Antonis Skarlatos Computing Smallest Convex Intersecting Polygons 10.4230/LIPIcs.ESA.2022.9
• Anna Arutyunova and Heiko Röglin The Price of Hierarchical Clustering 10.4230/LIPIcs.ESA.2022.10
• Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, and Alexander Wolff Bounding and Computing Obstacle Numbers of Graphs 10.4230/LIPIcs.ESA.2022.11
• Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, and Takaaki Nishimoto Computing NP-Hard Repetitiveness Measures via MAX-SAT 10.4230/LIPIcs.ESA.2022.12
• Nikhil Bansal and Christian Coester Online Metric Allocation and Time-Varying Regularization 10.4230/LIPIcs.ESA.2022.13
• Florian Barth, Stefan Funke, and Claudius Proissl An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions 10.4230/LIPIcs.ESA.2022.14
• Valentin Bartier, Nicolas Bousquet, and Amer E. Mouawad Galactic Token Sliding 10.4230/LIPIcs.ESA.2022.15
• Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul A. Chowdhury, Rob Johnson, Rishab Nithyanand, and Michael A. Bender When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting 10.4230/LIPIcs.ESA.2022.16
• Sayan Bhattacharya, Thatchaphol Saranurak, and Pattara Sukprasert Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary 10.4230/LIPIcs.ESA.2022.17
• Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, and Csaba D. Tóth Online Spanners in Metric Spaces 10.4230/LIPIcs.ESA.2022.18
• Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, and Mirko Rossi Sparse Temporal Spanners with Low Stretch 10.4230/LIPIcs.ESA.2022.19
• Daniel Blankenburg Resource Sharing Revisited: Local Weak Duality and Optimal Convergence 10.4230/LIPIcs.ESA.2022.20
• Thomas Bläsius and Philipp Fischbeck On the External Validity of Average-Case Analyses of Graph Algorithms 10.4230/LIPIcs.ESA.2022.21
• Václav Blažej, Pratibha Choudhary, Dušan Knop, Šimon Schierreich, Ondřej Suchý, and Tomáš Valla On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations 10.4230/LIPIcs.ESA.2022.22
• Kobi Bodek and Moran Feldman Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case 10.4230/LIPIcs.ESA.2022.23
• Hans L. Bodlaender, Carla Groenland, and Hugo Jacob List Colouring Trees in Logarithmic Space 10.4230/LIPIcs.ESA.2022.24
• Bartłomiej Bosek and Anna Zych-Pawlewicz Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget 10.4230/LIPIcs.ESA.2022.25
• Łukasz Bożyk and Michał Pilipczuk Polynomial Kernel for Immersion Hitting in Tournaments 10.4230/LIPIcs.ESA.2022.26
• Jendrik Brachter and Pascal Schweitzer A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension 10.4230/LIPIcs.ESA.2022.27
• Frederik Brüning, Jacobus Conradi, and Anne Driemel Faster Approximate Covering of Subcurves Under the Fréchet Distance 10.4230/LIPIcs.ESA.2022.28
• Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, and Frank Staals Efficient Fréchet Distance Queries for Segments 10.4230/LIPIcs.ESA.2022.29
• Benjamin Merlin Bumpus, Bart M. P. Jansen, and Jari J. H. de Kroon Search-Space Reduction via Essential Vertices 10.4230/LIPIcs.ESA.2022.30
• Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, and Lucia Williams Width Helps and Hinders Splitting Flows 10.4230/LIPIcs.ESA.2022.31
• Amit Chakrabarti and Themistoklis Haris Counting Simplices in Hypergraph Streams 10.4230/LIPIcs.ESA.2022.32
• Deeparnab Chakrabarty, Maryam Negahbani, and Ankita Sarkar Approximation Algorithms for Continuous Clustering and Facility Location Problems 10.4230/LIPIcs.ESA.2022.33
• Sourav Chakraborty, N. V. Vinodchandran¹, and Kuldeep S. Meel Distinct Elements in Streams: An Algorithm for the (Text) Book 10.4230/LIPIcs.ESA.2022.34
• Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Waleń, and Wiktor Zuba Approximate Circular Pattern Matching 10.4230/LIPIcs.ESA.2022.35
• Jiehua Chen and Sanjukta Roy Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space 10.4230/LIPIcs.ESA.2022.36
• Markus Chimani and Finn Stutzenstein Spanner Approximations in Practice 10.4230/LIPIcs.ESA.2022.37
• Radu Curticapean Determinants from Homomorphisms 10.4230/LIPIcs.ESA.2022.38
• Justin Dallant and John Iacono Conditional Lower Bounds for Dynamic Geometric Measure Problems 10.4230/LIPIcs.ESA.2022.39
• Syamantak Das and Andreas Wiese A Simpler QPTAS for Scheduling Jobs with Precedence Constraints 10.4230/LIPIcs.ESA.2022.40
• Argyrios Deligkas, Michail Fasoulakis, and Evangelos Markakis A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games 10.4230/LIPIcs.ESA.2022.41
• Dipan Dey and Manoj Gupta Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem 10.4230/LIPIcs.ESA.2022.42
• Tamal K. Dey and Tao Hou Fast Computation of Zigzag Persistence 10.4230/LIPIcs.ESA.2022.43
• Alexander Dobler, Manuel Sorge, and Anaïs Villedieu Turbocharging Heuristics for Weak Coloring Numbers 10.4230/LIPIcs.ESA.2022.44
• Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G.C. Resende, and Quico Spaen A Local Search Algorithm for Large Maximum Weight Independent Set Problems 10.4230/LIPIcs.ESA.2022.45
• Jan Dreier, Sebastian Ordyniak, and Stefan Szeider SAT Backdoors: Depth Beats Size 10.4230/LIPIcs.ESA.2022.46
• Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, and Stefan Szeider Finding a Cluster in Incomplete Data 10.4230/LIPIcs.ESA.2022.47
• Jonas Ellert Lyndon Arrays Simplified 10.4230/LIPIcs.ESA.2022.48
• Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, and Jens Schlöter Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty 10.4230/LIPIcs.ESA.2022.49
• Barış Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, and Roohani Sharma Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search 10.4230/LIPIcs.ESA.2022.50
• Esther Ezra and Micha Sharir Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection 10.4230/LIPIcs.ESA.2022.51
• Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, and Rico Zenklusen Submodular Maximization Subject to Matroid Intersection on the Fly 10.4230/LIPIcs.ESA.2022.52
• Aleksander Figiel, Vincent Froese, André Nichterlein, and Rolf Niedermeier There and Back Again: On Applying Data Reduction Rules by Undoing Others 10.4230/LIPIcs.ESA.2022.53
• Alejandro Flores-Velazco Improved Search of Relevant Points for Nearest-Neighbor Classification 10.4230/LIPIcs.ESA.2022.54
• Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, and Kirill Simonov Longest Cycle Above Erdős-Gallai Bound 10.4230/LIPIcs.ESA.2022.55
• Zachary Friggstad and Mahya Jamshidian Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters 10.4230/LIPIcs.ESA.2022.56
• Travis Gagie Simple Worst-Case Optimal Adaptive Prefix-Free Coding 10.4230/LIPIcs.ESA.2022.57
• Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Paweł Rzążewski, and Uéverton S. Souza Taming Graphs with No Large Creatures and Skinny Ladders 10.4230/LIPIcs.ESA.2022.58
• Younan Gao and Meng He Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product 10.4230/LIPIcs.ESA.2022.59
• Loukas Georgiadis, Giuseppe F. Italiano, and Evangelos Kosinas Computing the 4-Edge-Connected Components of a Graph: An Experimental Study 10.4230/LIPIcs.ESA.2022.60
• Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, and Yota Otachi Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited 10.4230/LIPIcs.ESA.2022.61
• Miriam Goetze, Paul Jungeblut, and Torsten Ueckerdt Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs 10.4230/LIPIcs.ESA.2022.62
• Bernhard Haepler, D. Ellis Hershkowitz, and Goran Zuzic Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings 10.4230/LIPIcs.ESA.2022.63
• Tesshu Hanaka and Michael Lampis Hedonic Games and Treewidth Revisited 10.4230/LIPIcs.ESA.2022.64
• Monika Henzinger, Ami Paz, and A. R. Sricharan Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs 10.4230/LIPIcs.ESA.2022.65
• D. Ellis Hershkowitz and Jason Li O(1) Steiner Point Removal in Series-Parallel Graphs 10.4230/LIPIcs.ESA.2022.66
• Thijs van der Horst, Maarten Löffler, and Frank Staals Chromatic k-Nearest Neighbor Queries 10.4230/LIPIcs.ESA.2022.67
• Chien-Chung Huang and François Sellier Maximum Weight b-Matchings in Random-Order Streams 10.4230/LIPIcs.ESA.2022.68
• Leo van Iersel, Mark Jones, and Mathias Weller Embedding Phylogenetic Trees in Networks of Low Treewidth 10.4230/LIPIcs.ESA.2022.69
• Han Jiang, Shang-En Huang, Thatchaphol Saranurak, and Tian Zhang Vertex Sparsifiers for Hyperedge Connectivity 10.4230/LIPIcs.ESA.2022.70
• Debajyoti Kar, Arindam Khan, and Andreas Wiese Approximation Algorithms for Round-UFP and Round-SAP 10.4230/LIPIcs.ESA.2022.71
• Shahbaz Khan and Alexandru I. Tomescu Optimizing Safe Flow Decompositions in DAGs 10.4230/LIPIcs.ESA.2022.72
• Dušan Knop and Martin Koutecký Scheduling Kernels via Configuration LP 10.4230/LIPIcs.ESA.2022.73
• Lex de Kogel, Marc van Kreveld, and Jordi L. Vermeulen Abstract Morphing Using the Hausdorff Distance and Voronoi Diagrams 10.4230/LIPIcs.ESA.2022.74
• Soh Kumabe and Yuichi Yoshida Average Sensitivity of the Knapsack Problem 10.4230/LIPIcs.ESA.2022.75
• Aleksander Łukasiewicz and Przemysław Uznański Cardinality Estimation Using Gumbel Distribution 10.4230/LIPIcs.ESA.2022.76
• Marten Maack, Simon Pukrop, and Anna Rodriguez Rasmussen (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling 10.4230/LIPIcs.ESA.2022.77
• Clément Maria and Owen Rouillé Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds 10.4230/LIPIcs.ESA.2022.78
• Wojciech Nadara, Michał Pilipczuk, and Marcin Smulewicz Computing Treedepth in Polynomial Space and Linear FPT Time 10.4230/LIPIcs.ESA.2022.79
• Bento Natura, Meike Neuwohner, and Stefan Weltge The Pareto Cover Problem 10.4230/LIPIcs.ESA.2022.80
• Ofer Neiman and Idan Shabat A Unified Framework for Hopsets 10.4230/LIPIcs.ESA.2022.81
• Zeev Nutov Data Structures for Node Connectivity Queries 10.4230/LIPIcs.ESA.2022.82
• Rajmohan Rajaraman and Omer Wasim Improved Bounds for Online Balanced Graph Re-Partitioning 10.4230/LIPIcs.ESA.2022.83
• Chris Schwiegelshohn and Omar Ali Sheikh-Omar An Empirical Evaluation of k-Means Coresets 10.4230/LIPIcs.ESA.2022.84
• Marek Szykuła and Adam Zyzik An Improved Algorithm for Finding the Shortest Synchronizing Words 10.4230/LIPIcs.ESA.2022.85
• Alexander Tiskin Fast RSK Correspondence by Doubling Search 10.4230/LIPIcs.ESA.2022.86
• Stefan Walzer Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold 10.4230/LIPIcs.ESA.2022.87
• Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, and Julian Shun ParGeo: A Library for Parallel Computational Geometry 10.4230/LIPIcs.ESA.2022.88
• Nils Werner and Tim Zeitz Combining Predicted and Live Traffic with Time-Dependent A* Potentials 10.4230/LIPIcs.ESA.2022.89
• Zoe Xi and William Kuszmaul Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings 10.4230/LIPIcs.ESA.2022.90
• Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, and Kanak Mahadik Correlated Stochastic Knapsack with a Submodular Objective 10.4230/LIPIcs.ESA.2022.91
• Or Zamir Faster Algorithm for Unique (k,2)-CSP 10.4230/LIPIcs.ESA.2022.92