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