<h2>LIPIcs, Volume 274, ESA 2023</h2>
<ul>
<li>
<span class="authors">Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman</span>
<span class="title">LIPIcs, Volume 274, ESA 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023">10.4230/LIPIcs.ESA.2023</a>
</li>
<li>
<span class="authors">Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, 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.2023.0">10.4230/LIPIcs.ESA.2023.0</a>
</li>
<li>
<span class="authors">Martin Dietzfelbinger</span>
<span class="title">On Hashing by (Random) Equations (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.1">10.4230/LIPIcs.ESA.2023.1</a>
</li>
<li>
<span class="authors">Amir Abboud, Mina Dalirrooyfard, Ray Li, and Virginia Vassilevska Williams</span>
<span class="title">On Diameter Approximation in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.2">10.4230/LIPIcs.ESA.2023.2</a>
</li>
<li>
<span class="authors">Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., and Ron Safier</span>
<span class="title">Can You Solve Closest String Faster Than Exhaustive Search?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.3">10.4230/LIPIcs.ESA.2023.3</a>
</li>
<li>
<span class="authors">Amir Abboud, Shay Mozes, and Oren Weimann</span>
<span class="title">What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.4">10.4230/LIPIcs.ESA.2023.4</a>
</li>
<li>
<span class="authors">Ahmed Abdelkader and David M. Mount</span>
<span class="title">Smooth Distance Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.5">10.4230/LIPIcs.ESA.2023.5</a>
</li>
<li>
<span class="authors">Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, and Thomas Weighill</span>
<span class="title">Reconfiguration of Polygonal Subdivisions via Recombination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.6">10.4230/LIPIcs.ESA.2023.6</a>
</li>
<li>
<span class="authors">Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, and Zixuan Xu</span>
<span class="title">Faster Detours in Undirected Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.7">10.4230/LIPIcs.ESA.2023.7</a>
</li>
<li>
<span class="authors">Shyan Akmal and Nicole Wein</span>
<span class="title">A Local-To-Global Theorem for Congested Shortest Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.8">10.4230/LIPIcs.ESA.2023.8</a>
</li>
<li>
<span class="authors">Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, and Torsten Ueckerdt</span>
<span class="title">Axis-Parallel Right Angle Crossing Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.9">10.4230/LIPIcs.ESA.2023.9</a>
</li>
<li>
<span class="authors">Simon Apers, Stacey Jeffery, Galina Pass, and Michael Walter</span>
<span class="title">(No) Quantum Space-Time Tradeoff for USTCON</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.10">10.4230/LIPIcs.ESA.2023.10</a>
</li>
<li>
<span class="authors">Júlia Baligács, Yann Disser, Irene Heinrich, and Pascal Schweitzer</span>
<span class="title">Exploration of Graphs with Excluded Minors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.11">10.4230/LIPIcs.ESA.2023.11</a>
</li>
<li>
<span class="authors">Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, and Michalis Xefteris</span>
<span class="title">Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.12">10.4230/LIPIcs.ESA.2023.12</a>
</li>
<li>
<span class="authors">Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, and Saket Saurabh</span>
<span class="title">A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.13">10.4230/LIPIcs.ESA.2023.13</a>
</li>
<li>
<span class="authors">Hideo Bannai and Jonas Ellert</span>
<span class="title">Lyndon Arrays in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.14">10.4230/LIPIcs.ESA.2023.14</a>
</li>
<li>
<span class="authors">Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, and Nicola Prezza</span>
<span class="title">Sorting Finite Automata via Partition Refinement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.15">10.4230/LIPIcs.ESA.2023.15</a>
</li>
<li>
<span class="authors">Matthias Bentert, Klaus Heeger, and Tomohiro Koana</span>
<span class="title">Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.16">10.4230/LIPIcs.ESA.2023.16</a>
</li>
<li>
<span class="authors">Aaron Berger, Jenny Kaufmann, and Virginia Vassilevska Williams</span>
<span class="title">Approximating Min-Diameter: Standard and Bichromatic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.17">10.4230/LIPIcs.ESA.2023.17</a>
</li>
<li>
<span class="authors">Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, and Erik Jan van Leeuwen</span>
<span class="title">Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.18">10.4230/LIPIcs.ESA.2023.18</a>
</li>
<li>
<span class="authors">Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, and Peter Sanders</span>
<span class="title">High Performance Construction of RecSplit Based Minimal Perfect Hash Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.19">10.4230/LIPIcs.ESA.2023.19</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, and Ziena Zeif</span>
<span class="title">On the Giant Component of Geometric Inhomogeneous Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.20">10.4230/LIPIcs.ESA.2023.20</a>
</li>
<li>
<span class="authors">Thomas Bläsius and Max Göttlicher</span>
<span class="title">An Efficient Algorithm for Power Dominating Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.21">10.4230/LIPIcs.ESA.2023.21</a>
</li>
<li>
<span class="authors">Joakim Blikstad and Peter Kiss</span>
<span class="title">Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.22">10.4230/LIPIcs.ESA.2023.22</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, and Alexandra Wesolek</span>
<span class="title">Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.23">10.4230/LIPIcs.ESA.2023.23</a>
</li>
<li>
<span class="authors">Karl Bringmann and Alejandro Cassis</span>
<span class="title">Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.24">10.4230/LIPIcs.ESA.2023.24</a>
</li>
<li>
<span class="authors">Gerth Stølting Brodal and Sebastian Wild</span>
<span class="title">Funnelselect: Cache-Oblivious Multiple Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.25">10.4230/LIPIcs.ESA.2023.25</a>
</li>
<li>
<span class="authors">Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, and Sampson Wong</span>
<span class="title">Oriented Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.26">10.4230/LIPIcs.ESA.2023.26</a>
</li>
<li>
<span class="authors">Martin Bullinger and René Romen</span>
<span class="title">Online Coalition Formation Under Random Arrival or Coalition Dissolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.27">10.4230/LIPIcs.ESA.2023.27</a>
</li>
<li>
<span class="authors">Sergio Cabello and Panos Giannopoulos</span>
<span class="title">On k-Means for Segments and Polylines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.28">10.4230/LIPIcs.ESA.2023.28</a>
</li>
<li>
<span class="authors">Dongrun Cai, Xue Chen, and Pan Peng</span>
<span class="title">Effective Resistances in Non-Expander Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.29">10.4230/LIPIcs.ESA.2023.29</a>
</li>
<li>
<span class="authors">Victor Campos, Jonas Costa, Raul Lopes, and Ignasi Sau</span>
<span class="title">New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.30">10.4230/LIPIcs.ESA.2023.30</a>
</li>
<li>
<span class="authors">Yixin Cao</span>
<span class="title">Enumerating Maximal Induced Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.31">10.4230/LIPIcs.ESA.2023.31</a>
</li>
<li>
<span class="authors">Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, and Liren Shan</span>
<span class="title">Approximation Algorithm for Norm Multiway Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.32">10.4230/LIPIcs.ESA.2023.32</a>
</li>
<li>
<span class="authors">Parinya Chalermsook, Fedor Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, and Ly Orgo</span>
<span class="title">Polynomial-Time Approximation of Independent Set Parameterized by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.33">10.4230/LIPIcs.ESA.2023.33</a>
</li>
<li>
<span class="authors">Adil Chhabra, Marcelo Fonseca Faraj, and Christian Schulz</span>
<span class="title">Faster Local Motif Clustering via Maximum Flows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.34">10.4230/LIPIcs.ESA.2023.34</a>
</li>
<li>
<span class="authors">Ilan Reuven Cohen and Binghui Peng</span>
<span class="title">Primal-Dual Schemes for Online Matching in Bounded Degree Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.35">10.4230/LIPIcs.ESA.2023.35</a>
</li>
<li>
<span class="authors">Michael Czekanski, Shelby Kimmel, and R. Teal Witter</span>
<span class="title">Robust and Space-Efficient Dual Adversary Quantum Query Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.36">10.4230/LIPIcs.ESA.2023.36</a>
</li>
<li>
<span class="authors">Arthur Carvalho Walraven Da Cunha, Francesco d'Amore, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, and Laurent Viennot</span>
<span class="title">Revisiting the Random Subset Sum Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.37">10.4230/LIPIcs.ESA.2023.37</a>
</li>
<li>
<span class="authors">Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, and Ruilong Zhang</span>
<span class="title">Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.38">10.4230/LIPIcs.ESA.2023.38</a>
</li>
<li>
<span class="authors">Max Deppert, Matthias Kaul, and Matthias Mnich</span>
<span class="title">A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.39">10.4230/LIPIcs.ESA.2023.39</a>
</li>
<li>
<span class="authors">Xiangyun Ding, Xiaojun Dong, Yan Gu, Youzhe Liu, and Yihan Sun</span>
<span class="title">Efficient Parallel Output-Sensitive Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.40">10.4230/LIPIcs.ESA.2023.40</a>
</li>
<li>
<span class="authors">Ming Ding and Peng Zhang</span>
<span class="title">Efficient 1-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.41">10.4230/LIPIcs.ESA.2023.41</a>
</li>
<li>
<span class="authors">Dani Dorfman, Haim Kaplan, Robert E. Tarjan, and Uri Zwick</span>
<span class="title">Optimal Energetic Paths for Electric Cars</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.42">10.4230/LIPIcs.ESA.2023.42</a>
</li>
<li>
<span class="authors">Jan Dreier, Daniel Mock, and Peter Rossmanith</span>
<span class="title">Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.43">10.4230/LIPIcs.ESA.2023.43</a>
</li>
<li>
<span class="authors">Yuval Emek, Yuval Gil, Maciej Pacut, and Stefan Schmid</span>
<span class="title">Online Algorithms with Randomly Infused Advice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.44">10.4230/LIPIcs.ESA.2023.44</a>
</li>
<li>
<span class="authors">Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, and Christian Scheffer</span>
<span class="title">The Lawn Mowing Problem: From Algebra to Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.45">10.4230/LIPIcs.ESA.2023.45</a>
</li>
<li>
<span class="authors">Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, and Giorgio Vinciguerra</span>
<span class="title">Learned Monotone Minimal Perfect Hashing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.46">10.4230/LIPIcs.ESA.2023.46</a>
</li>
<li>
<span class="authors">Aleksander Figiel, Tomohiro Koana, André Nichterlein, and Niklas Wünsche</span>
<span class="title">Correlating Theory and Practice in Finding Clubs and Plexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.47">10.4230/LIPIcs.ESA.2023.47</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Kernelization for Spreading Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.48">10.4230/LIPIcs.ESA.2023.48</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, and Meirav Zehavi</span>
<span class="title">Lossy Kernelization for (Implicit) Hitting Set Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.49">10.4230/LIPIcs.ESA.2023.49</a>
</li>
<li>
<span class="authors">Sebastian Forster, Gramoz Goranci, Yasamin Nazari, and Antonis Skarlatos</span>
<span class="title">Bootstrapping Dynamic Distance Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.50">10.4230/LIPIcs.ESA.2023.50</a>
</li>
<li>
<span class="authors">Daniel Funke, Nicolai Hüning, and Peter Sanders</span>
<span class="title">A Sweep-Plane Algorithm for Calculating the Isolation of Mountains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.51">10.4230/LIPIcs.ESA.2023.51</a>
</li>
<li>
<span class="authors">Amit Ganz, Pranav Nuti, and Roy Schwartz</span>
<span class="title">A Tight Competitive Ratio for Online Submodular Welfare Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.52">10.4230/LIPIcs.ESA.2023.52</a>
</li>
<li>
<span class="authors">Colin Geniet and Stéphan Thomassé</span>
<span class="title">First Order Logic and Twin-Width in Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.53">10.4230/LIPIcs.ESA.2023.53</a>
</li>
<li>
<span class="authors">Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, and Kevin Schewior</span>
<span class="title">Improved Approximation Algorithms for the Expanding Search Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.54">10.4230/LIPIcs.ESA.2023.54</a>
</li>
<li>
<span class="authors">Christoph Grunau, Ahmet Alper Özüdoğru, and Václav Rozhoň</span>
<span class="title">Noisy k-Means++ Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.55">10.4230/LIPIcs.ESA.2023.55</a>
</li>
<li>
<span class="authors">Elfarouk Harb, Kent Quanrud, and Chandra Chekuri</span>
<span class="title">Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.56">10.4230/LIPIcs.ESA.2023.56</a>
</li>
<li>
<span class="authors">David G. Harris</span>
<span class="title">Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.57">10.4230/LIPIcs.ESA.2023.57</a>
</li>
<li>
<span class="authors">Úrsula Hébert-Johnson, Daniel Lokshtanov, and Eric Vigoda</span>
<span class="title">Counting and Sampling Labeled Chordal Graphs in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.58">10.4230/LIPIcs.ESA.2023.58</a>
</li>
<li>
<span class="authors">Falko Hegerfeld and Stefan Kratsch</span>
<span class="title">Tight Algorithms for Connectivity Problems Parameterized by Clique-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.59">10.4230/LIPIcs.ESA.2023.59</a>
</li>
<li>
<span class="authors">Demian Hespe, Peter Sanders, Sabine Storandt, and Carina Truschel</span>
<span class="title">Pareto Sums of Pareto Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.60">10.4230/LIPIcs.ESA.2023.60</a>
</li>
<li>
<span class="authors">Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, and Johnathan Wilson</span>
<span class="title">Solving Edge Clique Cover Exactly via Synergistic Data Reduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.61">10.4230/LIPIcs.ESA.2023.61</a>
</li>
<li>
<span class="authors">Martin Hoefer and Kevin Schewior</span>
<span class="title">Threshold Testing and Semi-Online Prophet Inequalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.62">10.4230/LIPIcs.ESA.2023.62</a>
</li>
<li>
<span class="authors">Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, and Vaishali Surianarayanan</span>
<span class="title">Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.63">10.4230/LIPIcs.ESA.2023.63</a>
</li>
<li>
<span class="authors">Adam Izdebski and Ronald de Wolf</span>
<span class="title">Improved Quantum Boosting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.64">10.4230/LIPIcs.ESA.2023.64</a>
</li>
<li>
<span class="authors">Ashwin Jacob, Michał Włodarczyk, and Meirav Zehavi</span>
<span class="title">Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.65">10.4230/LIPIcs.ESA.2023.65</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen, Jari J. H. de Kroon, and Michał Włodarczyk</span>
<span class="title">5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.66">10.4230/LIPIcs.ESA.2023.66</a>
</li>
<li>
<span class="authors">Haim Kaplan, Matthew J. Katz, Rachel Saban, and Micha Sharir</span>
<span class="title">The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.67">10.4230/LIPIcs.ESA.2023.67</a>
</li>
<li>
<span class="authors">Adam Karczmarz and Marcin Smulewicz</span>
<span class="title">On Fully Dynamic Strongly Connected Components</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.68">10.4230/LIPIcs.ESA.2023.68</a>
</li>
<li>
<span class="authors">Dor Katzelnick, Aditya Pillai, Roy Schwartz, and Mohit Singh</span>
<span class="title">An Improved Approximation Algorithm for the Max-3-Section Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.69">10.4230/LIPIcs.ESA.2023.69</a>
</li>
<li>
<span class="authors">Evangelos Kipouridis</span>
<span class="title">Fitting Tree Metrics with Minimum Disagreements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.70">10.4230/LIPIcs.ESA.2023.70</a>
</li>
<li>
<span class="authors">Felix Klingelhoefer and Alantha Newman</span>
<span class="title">Coloring Tournaments with Few Colors: Algorithms and Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.71">10.4230/LIPIcs.ESA.2023.71</a>
</li>
<li>
<span class="authors">Tomasz Kociumaka and Adam Polak</span>
<span class="title">Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.72">10.4230/LIPIcs.ESA.2023.72</a>
</li>
<li>
<span class="authors">Shimon Kogan and Merav Parter</span>
<span class="title">Towards Bypassing Lower Bounds for Graph Shortcuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.73">10.4230/LIPIcs.ESA.2023.73</a>
</li>
<li>
<span class="authors">Dominik Köppl, Florian Kurpicz, and Daniel Meyer</span>
<span class="title">Faster Block Tree Construction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.74">10.4230/LIPIcs.ESA.2023.74</a>
</li>
<li>
<span class="authors">Evangelos Kosinas</span>
<span class="title">Connectivity Queries Under Vertex Failures: Not Optimal, but Practical</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.75">10.4230/LIPIcs.ESA.2023.75</a>
</li>
<li>
<span class="authors">Adam Kurpisz and Silvan Suter</span>
<span class="title">Improved Approximations for Translational Packing of Convex Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.76">10.4230/LIPIcs.ESA.2023.76</a>
</li>
<li>
<span class="authors">Michael Lampis and Manolis Vasilakis</span>
<span class="title">Structural Parameterizations for Two Bounded Degree Problems Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.77">10.4230/LIPIcs.ESA.2023.77</a>
</li>
<li>
<span class="authors">Zelin Li, Pan Peng, and Xianbin Zhu</span>
<span class="title">Massively Parallel Algorithms for the Stochastic Block Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.78">10.4230/LIPIcs.ESA.2023.78</a>
</li>
<li>
<span class="authors">Zihui Liang, Bakh Khoussainov, Toru Takisaka, and Mingyu Xiao</span>
<span class="title">Connectivity in the Presence of an Opponent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.79">10.4230/LIPIcs.ESA.2023.79</a>
</li>
<li>
<span class="authors">Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, and Renfei Zhou</span>
<span class="title">On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.80">10.4230/LIPIcs.ESA.2023.80</a>
</li>
<li>
<span class="authors">Nikhil S. Mande and Ronald de Wolf</span>
<span class="title">Tight Bounds for Quantum Phase Estimation and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.81">10.4230/LIPIcs.ESA.2023.81</a>
</li>
<li>
<span class="authors">Isja Mannens and Jesper Nederlof</span>
<span class="title">A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.82">10.4230/LIPIcs.ESA.2023.82</a>
</li>
<li>
<span class="authors">Francesco Masillo</span>
<span class="title">Matching Statistics Speed up BWT Construction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.83">10.4230/LIPIcs.ESA.2023.83</a>
</li>
<li>
<span class="authors">Ismail Naderi, Mohsen Rezapour, and Mohammad R. Salavatipour</span>
<span class="title">Approximation Schemes for Min-Sum k-Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.84">10.4230/LIPIcs.ESA.2023.84</a>
</li>
<li>
<span class="authors">Eunjin Oh and Seunghyeok Oh</span>
<span class="title">Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.85">10.4230/LIPIcs.ESA.2023.85</a>
</li>
<li>
<span class="authors">George Osipov and Magnus Wahlström</span>
<span class="title">Parameterized Complexity of Equality MinCSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.86">10.4230/LIPIcs.ESA.2023.86</a>
</li>
<li>
<span class="authors">Ioannis Panagiotas, Grégoire Pichon, Somesh Singh, and Bora Uçar</span>
<span class="title">Engineering Fast Algorithms for the Bottleneck Matching Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.87">10.4230/LIPIcs.ESA.2023.87</a>
</li>
<li>
<span class="authors">Krzysztof Pióro</span>
<span class="title">Subcubic Algorithm for (Unweighted) Unrooted Tree Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.88">10.4230/LIPIcs.ESA.2023.88</a>
</li>
<li>
<span class="authors">Jakub Radoszewski</span>
<span class="title">Linear Time Construction of Cover Suffix Tree and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.89">10.4230/LIPIcs.ESA.2023.89</a>
</li>
<li>
<span class="authors">Ignaz Rutter and Peter Stumpf</span>
<span class="title">Simultaneous Representation of Interval Graphs in the Sunflower Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.90">10.4230/LIPIcs.ESA.2023.90</a>
</li>
<li>
<span class="authors">Menachem Sadigurschi, Moshe Shechner, and Uri Stemmer</span>
<span class="title">Relaxed Models for Adversarial Streaming: The Bounded Interruptions Model and the Advice Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.91">10.4230/LIPIcs.ESA.2023.91</a>
</li>
<li>
<span class="authors">Thatchaphol Saranurak and Wuwei Yuan</span>
<span class="title">Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.92">10.4230/LIPIcs.ESA.2023.92</a>
</li>
<li>
<span class="authors">Baruch Schieber and Soroush Vahidi</span>
<span class="title">Approximating Connected Maximum Cuts via Local Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.93">10.4230/LIPIcs.ESA.2023.93</a>
</li>
<li>
<span class="authors">François Sellier</span>
<span class="title">Parameterized Matroid-Constrained Maximum Coverage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.94">10.4230/LIPIcs.ESA.2023.94</a>
</li>
<li>
<span class="authors">Chinmay Sonar, Subhash Suri, and Jie Xue</span>
<span class="title">Fault Tolerance in Euclidean Committee Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.95">10.4230/LIPIcs.ESA.2023.95</a>
</li>
<li>
<span class="authors">Jacek Sroka and Jerzy Tyszkiewicz</span>
<span class="title">Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.96">10.4230/LIPIcs.ESA.2023.96</a>
</li>
<li>
<span class="authors">Enze Sun, Zonghan Yang, and Yuhao Zhang</span>
<span class="title">Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.97">10.4230/LIPIcs.ESA.2023.97</a>
</li>
<li>
<span class="authors">Xiaoming Sun, Jialin Zhang, and Zhijie Zhang</span>
<span class="title">Simple Deterministic Approximation for Submodular Multiple Knapsack Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.98">10.4230/LIPIcs.ESA.2023.98</a>
</li>
<li>
<span class="authors">André van Renssen, Yuan Sha, Yucheng Sun, and Sampson Wong</span>
<span class="title">The Tight Spanning Ratio of the Rectangle Delaunay Triangulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.99">10.4230/LIPIcs.ESA.2023.99</a>
</li>
<li>
<span class="authors">Oleg Verbitsky and Maksim Zhukovskii</span>
<span class="title">Canonization of a Random Graph by Two Matrix-Vector Multiplications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.100">10.4230/LIPIcs.ESA.2023.100</a>
</li>
<li>
<span class="authors">Haitao Wang and Yiming Zhao</span>
<span class="title">Improved Algorithms for Distance Selection and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.101">10.4230/LIPIcs.ESA.2023.101</a>
</li>
<li>
<span class="authors">Rowan Warneke, Farhana Choudhury, and Anthony Wirth</span>
<span class="title">Maximum Coverage in Random-Arrival Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.102">10.4230/LIPIcs.ESA.2023.102</a>
</li>
<li>
<span class="authors">Chuhan Yang and Christopher Musco</span>
<span class="title">Efficient Block Approximate Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.103">10.4230/LIPIcs.ESA.2023.103</a>
</li>
<li>
<span class="authors">Goran Zuzic</span>
<span class="title">A Simple Boosting Framework for Transshipment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2023.104">10.4230/LIPIcs.ESA.2023.104</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