<h2>LIPIcs, Volume 283, ISAAC 2023</h2>
<ul>
<li>
<span class="authors">Satoru Iwata and Naonori Kakimura</span>
<span class="title">LIPIcs, Volume 283, ISAAC 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023">10.4230/LIPIcs.ISAAC.2023</a>
</li>
<li>
<span class="authors">Satoru Iwata and Naonori Kakimura</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.0">10.4230/LIPIcs.ISAAC.2023.0</a>
</li>
<li>
<span class="authors">Edith Elkind</span>
<span class="title">Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.1">10.4230/LIPIcs.ISAAC.2023.1</a>
</li>
<li>
<span class="authors">Seok-Hee Hong</span>
<span class="title">Faithful Graph Drawing (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.2">10.4230/LIPIcs.ISAAC.2023.2</a>
</li>
<li>
<span class="authors">Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, and Carola Wenk</span>
<span class="title">Realizability of Free Spaces of Curves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.3">10.4230/LIPIcs.ISAAC.2023.3</a>
</li>
<li>
<span class="authors">Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, and Dirk Nowotka</span>
<span class="title">k-Universality of Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.4">10.4230/LIPIcs.ISAAC.2023.4</a>
</li>
<li>
<span class="authors">Jungho Ahn, Jinha Kim, and O-joung Kwon</span>
<span class="title">Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.5">10.4230/LIPIcs.ISAAC.2023.5</a>
</li>
<li>
<span class="authors">Henk Alkema and Mark de Berg</span>
<span class="title">Geometric TSP on Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.6">10.4230/LIPIcs.ISAAC.2023.6</a>
</li>
<li>
<span class="authors">Kazuyuki Amano</span>
<span class="title">Depth-Three Circuits for Inner Product and Majority Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.7">10.4230/LIPIcs.ISAAC.2023.7</a>
</li>
<li>
<span class="authors">Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, and Stéphane Vialette</span>
<span class="title">Recognizing Unit Multiple Intervals Is Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.8">10.4230/LIPIcs.ISAAC.2023.8</a>
</li>
<li>
<span class="authors">Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, and Fanny Pascual</span>
<span class="title">Non-Clairvoyant Makespan Minimization Scheduling with Predictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.9">10.4230/LIPIcs.ISAAC.2023.9</a>
</li>
<li>
<span class="authors">Gabriel Bathie, Tomasz Kociumaka, and Tatiana Starikovskaya</span>
<span class="title">Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.10">10.4230/LIPIcs.ISAAC.2023.10</a>
</li>
<li>
<span class="authors">Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guśpiel, Petr Hliněný, Filip Pokrývka, and Marek Sokołowski</span>
<span class="title">Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.11">10.4230/LIPIcs.ISAAC.2023.11</a>
</li>
<li>
<span class="authors">Giulia Bernardini, Gabriele Fici, Paweł Gawrychowski, and Solon P. Pissis</span>
<span class="title">Substring Complexity in Sublinear Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.12">10.4230/LIPIcs.ISAAC.2023.12</a>
</li>
<li>
<span class="authors">Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, and Tobias Stamm</span>
<span class="title">New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.13">10.4230/LIPIcs.ISAAC.2023.13</a>
</li>
<li>
<span class="authors">Jannis Blauth, Meike Neuwohner, Luise Puhlmann, and Jens Vygen</span>
<span class="title">Improved Guarantees for the a Priori TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.14">10.4230/LIPIcs.ISAAC.2023.14</a>
</li>
<li>
<span class="authors">Michaela Borzechowski, Patrick Schnider, and Simon Weber</span>
<span class="title">An FPT Algorithm for Splitting a Necklace Among Two Thieves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.15">10.4230/LIPIcs.ISAAC.2023.15</a>
</li>
<li>
<span class="authors">Cornelius Brand and Alexandra Lassota</span>
<span class="title">Fast Convolutions for Near-Convex Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.16">10.4230/LIPIcs.ISAAC.2023.16</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty and Sanjana Dey</span>
<span class="title">Matrix Completion: Approximating the Minimum Diameter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.17">10.4230/LIPIcs.ISAAC.2023.17</a>
</li>
<li>
<span class="authors">Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, and Daniel J. Zhang</span>
<span class="title">Distance Queries over Dynamic Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.18">10.4230/LIPIcs.ISAAC.2023.18</a>
</li>
<li>
<span class="authors">Huairui Chu and Bingkai Lin</span>
<span class="title">FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.19">10.4230/LIPIcs.ISAAC.2023.19</a>
</li>
<li>
<span class="authors">Tomer Cohen, Ariel Kulik, and Hadas Shachnai</span>
<span class="title">Improved Approximation for Two-Dimensional Vector Multiple Knapsack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.20">10.4230/LIPIcs.ISAAC.2023.20</a>
</li>
<li>
<span class="authors">Alessio Conte, Roberto Grossi, Giulia Punzi, and Takeaki Uno</span>
<span class="title">A Compact DAG for Storing and Searching Maximal Common Subsequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.21">10.4230/LIPIcs.ISAAC.2023.21</a>
</li>
<li>
<span class="authors">Nicola Cotumaccio</span>
<span class="title">Prefix Sorting DFAs: A Recursive Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.22">10.4230/LIPIcs.ISAAC.2023.22</a>
</li>
<li>
<span class="authors">Mark de Berg, Leyla Biabani, Morteza Monemizadeh, and Leonidas Theocharous</span>
<span class="title">Clustering in Polygonal Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.23">10.4230/LIPIcs.ISAAC.2023.23</a>
</li>
<li>
<span class="authors">Mark de Berg, Andrés López Martínez, and Frits Spieksma</span>
<span class="title">Finding Diverse Minimum s-t Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.24">10.4230/LIPIcs.ISAAC.2023.24</a>
</li>
<li>
<span class="authors">Anubhav Dhar, Soumita Hait, and Sudeshna Kolay</span>
<span class="title">Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.25">10.4230/LIPIcs.ISAAC.2023.25</a>
</li>
<li>
<span class="authors">Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, and Maurizio Patrignani</span>
<span class="title">Rectilinear-Upward Planarity Testing of Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.26">10.4230/LIPIcs.ISAAC.2023.26</a>
</li>
<li>
<span class="authors">Yann Disser and Nils Mosis</span>
<span class="title">A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.27">10.4230/LIPIcs.ISAAC.2023.27</a>
</li>
<li>
<span class="authors">Nicolas El Maalouly, Raphael Steiner, and Lasse Wulf</span>
<span class="title">Exact Matching: Correct Parity and FPT Parameterized by Independence Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.28">10.4230/LIPIcs.ISAAC.2023.28</a>
</li>
<li>
<span class="authors">Matthias Englert, Nicolaos Matsakis, and Pavel Veselý</span>
<span class="title">Approximation Guarantees for Shortest Superstrings: Simpler and Better</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.29">10.4230/LIPIcs.ISAAC.2023.29</a>
</li>
<li>
<span class="authors">David Eppstein and Daniel Frishberg</span>
<span class="title">Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.30">10.4230/LIPIcs.ISAAC.2023.30</a>
</li>
<li>
<span class="authors">Carl Feghali, Felicia Lucke, Daniël Paulusma, and Bernard Ries</span>
<span class="title">Matching Cuts in Graphs of High Girth and H-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.31">10.4230/LIPIcs.ISAAC.2023.31</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Giannos Stamoulis</span>
<span class="title">Computing Paths of Large Rank in Planar Frameworks Deterministically</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.32">10.4230/LIPIcs.ISAAC.2023.32</a>
</li>
<li>
<span class="authors">Petr Gregor, Torsten Mütze, and Namrata</span>
<span class="title">Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.33">10.4230/LIPIcs.ISAAC.2023.33</a>
</li>
<li>
<span class="authors">Joachim Gudmundsson, Zijin Huang, André van Renssen, and Sampson Wong</span>
<span class="title">Computing a Subtrajectory Cluster from c-Packed Trajectories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.34">10.4230/LIPIcs.ISAAC.2023.34</a>
</li>
<li>
<span class="authors">Joachim Gudmundsson and Yuan Sha</span>
<span class="title">Shortest Beer Path Queries in Digraphs with Bounded Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.35">10.4230/LIPIcs.ISAAC.2023.35</a>
</li>
<li>
<span class="authors">Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Paweł Rzążewski, Alexander Wolff, and Johannes Zink</span>
<span class="title">Coloring and Recognizing Mixed Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.36">10.4230/LIPIcs.ISAAC.2023.36</a>
</li>
<li>
<span class="authors">Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, and Kosuke Sugiyama</span>
<span class="title">Shortest Beer Path Queries Based on Graph Decomposition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.37">10.4230/LIPIcs.ISAAC.2023.37</a>
</li>
<li>
<span class="authors">Hovhannes A. Harutyunyan, Kamran Koupayi, and Denis Pankratov</span>
<span class="title">Temporal Separators with Deadlines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.38">10.4230/LIPIcs.ISAAC.2023.38</a>
</li>
<li>
<span class="authors">Shuichi Hirahara and Dana Moshkovitz</span>
<span class="title">Regularization of Low Error PCPs and an Application to MCSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.39">10.4230/LIPIcs.ISAAC.2023.39</a>
</li>
<li>
<span class="authors">Lars Jaffke, Paloma T. Lima, and Roohani Sharma</span>
<span class="title">Structural Parameterizations of b-Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.40">10.4230/LIPIcs.ISAAC.2023.40</a>
</li>
<li>
<span class="authors">Ragesh Jaiswal and Amit Kumar</span>
<span class="title">Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.41">10.4230/LIPIcs.ISAAC.2023.41</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen, Jari J. H. de Kroon, and Michał Włodarczyk</span>
<span class="title">Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.42">10.4230/LIPIcs.ISAAC.2023.42</a>
</li>
<li>
<span class="authors">Ben Jourdan, Peter Macgregor, and He Sun</span>
<span class="title">Is the Algorithmic Kadison-Singer Problem Hard?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.43">10.4230/LIPIcs.ISAAC.2023.43</a>
</li>
<li>
<span class="authors">Frank Kammer and Johannes Meintrup</span>
<span class="title">Succinct Planar Encoding with Minor Operations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.44">10.4230/LIPIcs.ISAAC.2023.44</a>
</li>
<li>
<span class="authors">Mong-Jen Kao</span>
<span class="title">Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.45">10.4230/LIPIcs.ISAAC.2023.45</a>
</li>
<li>
<span class="authors">Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, and Kirill Simonov</span>
<span class="title">The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.46">10.4230/LIPIcs.ISAAC.2023.46</a>
</li>
<li>
<span class="authors">Kei Kimura and Kazuhisa Makino</span>
<span class="title">A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.47">10.4230/LIPIcs.ISAAC.2023.47</a>
</li>
<li>
<span class="authors">Yusuke Kobayashi, Ryoga Mahara, and Tamás Schwarcz</span>
<span class="title">Reconfiguration of the Union of Arborescences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.48">10.4230/LIPIcs.ISAAC.2023.48</a>
</li>
<li>
<span class="authors">Yusuke Kobayashi and Takashi Noguchi</span>
<span class="title">An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.49">10.4230/LIPIcs.ISAAC.2023.49</a>
</li>
<li>
<span class="authors">Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, and Mong-Jen Kao</span>
<span class="title">On Min-Max Graph Balancing with Strict Negative Correlation Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.50">10.4230/LIPIcs.ISAAC.2023.50</a>
</li>
<li>
<span class="authors">Gang Liu and Haitao Wang</span>
<span class="title">On the Line-Separable Unit-Disk Coverage and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.51">10.4230/LIPIcs.ISAAC.2023.51</a>
</li>
<li>
<span class="authors">Bodo Manthey and Jesse van Rhijn</span>
<span class="title">Improved Smoothed Analysis of 2-Opt for the Euclidean TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.52">10.4230/LIPIcs.ISAAC.2023.52</a>
</li>
<li>
<span class="authors">Neeldhara Misra, Harshil Mittal, Saket Saurabh, and Dhara Thakkar</span>
<span class="title">On the Complexity of the Eigenvalue Deletion Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.53">10.4230/LIPIcs.ISAAC.2023.53</a>
</li>
<li>
<span class="authors">Joydeep Mukherjee and Tamojit Saha</span>
<span class="title">Connected Vertex Cover on AT-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.54">10.4230/LIPIcs.ISAAC.2023.54</a>
</li>
<li>
<span class="authors">Supartha Podder, Penghui Yao, and Zekun Ye</span>
<span class="title">On the Fine-Grained Query Complexity of Symmetric Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.55">10.4230/LIPIcs.ISAAC.2023.55</a>
</li>
<li>
<span class="authors">Sampriti Roy and Yadu Vasudev</span>
<span class="title">Testing Properties of Distributions in the Streaming Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.56">10.4230/LIPIcs.ISAAC.2023.56</a>
</li>
<li>
<span class="authors">Shuai Shao and Stanislav Živný</span>
<span class="title">A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2023.57">10.4230/LIPIcs.ISAAC.2023.57</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