<h2>LIPIcs, Volume 327, STACS 2025</h2>
<ul>
<li>
<span class="authors">Olaf Beyersdorff, Michał Pilipczuk, Elaine Pimentel, and Nguyễn Kim Thắng</span>
<span class="title">LIPIcs, Volume 327, STACS 2025, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025">10.4230/LIPIcs.STACS.2025</a>
</li>
<li>
<span class="authors">Olaf Beyersdorff, Michał Pilipczuk, Elaine Pimentel, and Nguyễn Kim Thắng</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.0">10.4230/LIPIcs.STACS.2025.0</a>
</li>
<li>
<span class="authors">Albert Atserias</span>
<span class="title">Proof Complexity and Its Relations to SAT Solving (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.1">10.4230/LIPIcs.STACS.2025.1</a>
</li>
<li>
<span class="authors">Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, and László A. Végh</span>
<span class="title">A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.2">10.4230/LIPIcs.STACS.2025.2</a>
</li>
<li>
<span class="authors">Anupam Das</span>
<span class="title">Algebras for Automata: Reasoning with Regularity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.3">10.4230/LIPIcs.STACS.2025.3</a>
</li>
<li>
<span class="authors">Susanna F. de Rezende</span>
<span class="title">Some Recent Advancements in Monotone Circuit Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.4">10.4230/LIPIcs.STACS.2025.4</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Shaily Verma</span>
<span class="title">Parameterized Saga of First-Fit and Last-Fit Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.5">10.4230/LIPIcs.STACS.2025.5</a>
</li>
<li>
<span class="authors">Jungho Ahn, Hugo Jacob, Noleen Köhler, Christophe Paul, Amadeus Reinald, and Sebastian Wiederrecht</span>
<span class="title">Twin-Width One</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.6">10.4230/LIPIcs.STACS.2025.6</a>
</li>
<li>
<span class="authors">Shyan Akmal and Tomohiro Koana</span>
<span class="title">Faster Edge Coloring by Partition Sieving</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.7">10.4230/LIPIcs.STACS.2025.7</a>
</li>
<li>
<span class="authors">Yaroslav Alekseev, Dima Grigoriev, and Edward A. Hirsch</span>
<span class="title">Tropical Proof Systems: Between R(CP) and Resolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.8">10.4230/LIPIcs.STACS.2025.8</a>
</li>
<li>
<span class="authors">Sharareh Alipour, Ermiya Farokhnejad, and Tobias Mömke</span>
<span class="title">Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.9">10.4230/LIPIcs.STACS.2025.9</a>
</li>
<li>
<span class="authors">Quentin Aristote</span>
<span class="title">Monotone Weak Distributive Laws over the Lifted Powerset Monad in Categories of Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.10">10.4230/LIPIcs.STACS.2025.10</a>
</li>
<li>
<span class="authors">Srinivasan Arunachalam and Louis Schatzki</span>
<span class="title">Generalized Inner Product Estimation with Limited Quantum Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.11">10.4230/LIPIcs.STACS.2025.11</a>
</li>
<li>
<span class="authors">Christine Awofeso, Patrick Greaves, Oded Lachish, and Felix Reidl</span>
<span class="title">Results on H-Freeness Testing in Graphs of Bounded r-Admissibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.12">10.4230/LIPIcs.STACS.2025.12</a>
</li>
<li>
<span class="authors">Samuel Baguley, Yannic Maus, Janosch Ruff, and George Skretas</span>
<span class="title">Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.13">10.4230/LIPIcs.STACS.2025.13</a>
</li>
<li>
<span class="authors">Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, and Saket Saurabh</span>
<span class="title">Multivariate Exploration of Metric Dilation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.14">10.4230/LIPIcs.STACS.2025.14</a>
</li>
<li>
<span class="authors">Max Bannach and Markus Hecher</span>
<span class="title">Structure-Guided Automated Reasoning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.15">10.4230/LIPIcs.STACS.2025.15</a>
</li>
<li>
<span class="authors">Nastaran Behrooznia and Torsten Mütze</span>
<span class="title">Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.16">10.4230/LIPIcs.STACS.2025.16</a>
</li>
<li>
<span class="authors">Matthias Bentert, Fedor V. Fomin, and Petr A. Golovach</span>
<span class="title">Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.17">10.4230/LIPIcs.STACS.2025.17</a>
</li>
<li>
<span class="authors">Marcin Bienkowski, Jarosław Byrka, and Łukasz Jeż</span>
<span class="title">Online Disjoint Set Covers: Randomization Is Not Necessary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.18">10.4230/LIPIcs.STACS.2025.18</a>
</li>
<li>
<span class="authors">Benjamin Bordais, Daniel Neider, and Rajarshi Roy</span>
<span class="title">The Complexity of Learning LTL, CTL and ATL Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.19">10.4230/LIPIcs.STACS.2025.19</a>
</li>
<li>
<span class="authors">Roberto Borelli, Luca Geatti, Marco Montali, and Angelo Montanari</span>
<span class="title">On Cascades of Reset Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.20">10.4230/LIPIcs.STACS.2025.20</a>
</li>
<li>
<span class="authors">Antonin Callard, Léo Paviet Salomon, and Pascal Vanier</span>
<span class="title">Computability of Extender Sets in Multidimensional Subshifts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.21">10.4230/LIPIcs.STACS.2025.21</a>
</li>
<li>
<span class="authors">Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, and Noleen Köhler</span>
<span class="title">CMSO-Transducing Tree-Like Graph Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.22">10.4230/LIPIcs.STACS.2025.22</a>
</li>
<li>
<span class="authors">Rémy Cerda and Lionel Vaux Auclair</span>
<span class="title">How to Play the Accordion: Uniformity and the (Non-)Conservativity of the Linear Approximation of the λ-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.23">10.4230/LIPIcs.STACS.2025.23</a>
</li>
<li>
<span class="authors">Keerti Choudhary and Rishabh Dhiman</span>
<span class="title">A Deterministic Approach to Shortest Path Restoration in Edge Faulty Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.24">10.4230/LIPIcs.STACS.2025.24</a>
</li>
<li>
<span class="authors">Aleksander Bjørn Christiansen, Ivor van der Hoog, and Eva Rotenberg</span>
<span class="title">Local Density and Its Distributed Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.25">10.4230/LIPIcs.STACS.2025.25</a>
</li>
<li>
<span class="authors">Nikolai Chukhin, Alexander S. Kulikov, and Ivan Mihajlin</span>
<span class="title">Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.26">10.4230/LIPIcs.STACS.2025.26</a>
</li>
<li>
<span class="authors">Nathan Claudet and Simon Perdrix</span>
<span class="title">Local Equivalence of Stabilizer States: A Graphical Characterisation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.27">10.4230/LIPIcs.STACS.2025.27</a>
</li>
<li>
<span class="authors">Radu Curticapean, Simon Döring, Daniel Neuen, and Jiaheng Wang</span>
<span class="title">Can You Link Up With Treewidth?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.28">10.4230/LIPIcs.STACS.2025.28</a>
</li>
<li>
<span class="authors">Dariusz Dereniowski, Aleksander Łukasiewicz, and Przemysław Uznański</span>
<span class="title">Noisy (Binary) Searching: Simple, Fast and Correct</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.29">10.4230/LIPIcs.STACS.2025.29</a>
</li>
<li>
<span class="authors">Stéphane Devismes, David Ilcinkas, Colette Johnen, and Frédéric Mazoit</span>
<span class="title">Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.30">10.4230/LIPIcs.STACS.2025.30</a>
</li>
<li>
<span class="authors">Leah Epstein and Asaf Levin</span>
<span class="title">Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.31">10.4230/LIPIcs.STACS.2025.31</a>
</li>
<li>
<span class="authors">Nick Fischer, Evangelos Kipouridis, Jonas Klausen, and Mikkel Thorup</span>
<span class="title">A Faster Algorithm for Constrained Correlation Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.32">10.4230/LIPIcs.STACS.2025.32</a>
</li>
<li>
<span class="authors">Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale</span>
<span class="title">Metric Dimension and Geodetic Set Parameterized by Vertex Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.33">10.4230/LIPIcs.STACS.2025.33</a>
</li>
<li>
<span class="authors">Pierre Fraigniaud, Minh Hang Nguyen, and Ami Paz</span>
<span class="title">Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.34">10.4230/LIPIcs.STACS.2025.34</a>
</li>
<li>
<span class="authors">Ameet Gadekar and Tanmay Inamdar</span>
<span class="title">Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.35">10.4230/LIPIcs.STACS.2025.35</a>
</li>
<li>
<span class="authors">Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, and Roohani Sharma</span>
<span class="title">MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.36">10.4230/LIPIcs.STACS.2025.36</a>
</li>
<li>
<span class="authors">Jorge Gallego-Hernández and Alessio Mansutti</span>
<span class="title">On the Existential Theory of the Reals Enriched with Integer Powers of a Computable Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.37">10.4230/LIPIcs.STACS.2025.37</a>
</li>
<li>
<span class="authors">Arnab Ganguly, Daniel Gibney, Rahul Shah, and Sharma V. Thankachan</span>
<span class="title">Two-Dimensional Longest Common Extension Queries in Compact Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.38">10.4230/LIPIcs.STACS.2025.38</a>
</li>
<li>
<span class="authors">Ebrahim Ghorbani, Jonah Leander Hoff, and Matthias Mnich</span>
<span class="title">A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like Multigraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.39">10.4230/LIPIcs.STACS.2025.39</a>
</li>
<li>
<span class="authors">Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, and Paul Wild</span>
<span class="title">Identity-Preserving Lax Extensions and Where to Find Them</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.40">10.4230/LIPIcs.STACS.2025.40</a>
</li>
<li>
<span class="authors">Jakob Greilhuber, Philipp Schepper, and Philip Wellnitz</span>
<span class="title">Residue Domination in Bounded-Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.41">10.4230/LIPIcs.STACS.2025.41</a>
</li>
<li>
<span class="authors">Mohit Gurumukhani, Ramamohan Paturi, Michael Saks, and Navid Talebanfard</span>
<span class="title">Local Enumeration: The Not-All-Equal Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.42">10.4230/LIPIcs.STACS.2025.42</a>
</li>
<li>
<span class="authors">Sariel Har-Peled and Saladi Rahul</span>
<span class="title">Approximating Densest Subgraph in Geometric Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.43">10.4230/LIPIcs.STACS.2025.43</a>
</li>
<li>
<span class="authors">Tim A. Hartmann and Dániel Marx</span>
<span class="title">Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.44">10.4230/LIPIcs.STACS.2025.44</a>
</li>
<li>
<span class="authors">Deborah Haun, Laura Merker, and Sergey Pupyrev</span>
<span class="title">Forbidden Patterns in Mixed Linear Layouts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.45">10.4230/LIPIcs.STACS.2025.45</a>
</li>
<li>
<span class="authors">Úrsula Hébert-Johnson and Daniel Lokshtanov</span>
<span class="title">Sampling Unlabeled Chordal Graphs in Expected Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.46">10.4230/LIPIcs.STACS.2025.46</a>
</li>
<li>
<span class="authors">Klaus Heeger and Hendrik Molter</span>
<span class="title">Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.47">10.4230/LIPIcs.STACS.2025.47</a>
</li>
<li>
<span class="authors">Benjamin Hellouin de Menibus and Pacôme Perrotin</span>
<span class="title">Subshifts Defined by Nondeterministic and Alternating Plane-Walking Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.48">10.4230/LIPIcs.STACS.2025.48</a>
</li>
<li>
<span class="authors">Quentin Hillebrand, Vorapong Suppakitpaisarn, and Tetsuo Shibuya</span>
<span class="title">Cycle Counting Under Local Differential Privacy for Degeneracy-Bounded Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.49">10.4230/LIPIcs.STACS.2025.49</a>
</li>
<li>
<span class="authors">Martin Hoefer, Conrad Schecker, and Kevin Schewior</span>
<span class="title">Designing Exploration Contracts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.50">10.4230/LIPIcs.STACS.2025.50</a>
</li>
<li>
<span class="authors">Felix Hommelsheim, Zhenwei Liu, Nicole Megow, and Guochuan Zhang</span>
<span class="title">Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.51">10.4230/LIPIcs.STACS.2025.51</a>
</li>
<li>
<span class="authors">Séhane Bel Houari-Durand, Eduard Eiben, and Magnus Wahlström</span>
<span class="title">Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.52">10.4230/LIPIcs.STACS.2025.52</a>
</li>
<li>
<span class="authors">Pavel Hrubeš and Pushkar S. Joglekar</span>
<span class="title">On Read-k Projections of the Determinant</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.53">10.4230/LIPIcs.STACS.2025.53</a>
</li>
<li>
<span class="authors">Stacey Jeffery and Galina Pass</span>
<span class="title">Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.54">10.4230/LIPIcs.STACS.2025.54</a>
</li>
<li>
<span class="authors">Jean Christoph Jung and Jędrzej Kołodziejski</span>
<span class="title">Modal Separation of Fixpoint Formulae</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.55">10.4230/LIPIcs.STACS.2025.55</a>
</li>
<li>
<span class="authors">Julia Katheder, Michael Kaufmann, Sergey Pupyrev, and Torsten Ueckerdt</span>
<span class="title">Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.56">10.4230/LIPIcs.STACS.2025.56</a>
</li>
<li>
<span class="authors">Matthias Kaul, Kelin Luo, Matthias Mnich, and Heiko Röglin</span>
<span class="title">Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.57">10.4230/LIPIcs.STACS.2025.57</a>
</li>
<li>
<span class="authors">Piotr Kawałek and Armin Weiß</span>
<span class="title">Violating Constant Degree Hypothesis Requires Breaking Symmetry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.58">10.4230/LIPIcs.STACS.2025.58</a>
</li>
<li>
<span class="authors">Yasushi Kawase and Tomohiro Nakayoshi</span>
<span class="title">Online Matching with Delays and Size-Based Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.59">10.4230/LIPIcs.STACS.2025.59</a>
</li>
<li>
<span class="authors">Amirhossein Kazeminia and Andrei A. Bulatov</span>
<span class="title">Modular Counting CSP: Reductions and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.60">10.4230/LIPIcs.STACS.2025.60</a>
</li>
<li>
<span class="authors">Stefan Kiefer and Andrew Ryzhikov</span>
<span class="title">Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.61">10.4230/LIPIcs.STACS.2025.61</a>
</li>
<li>
<span class="authors">Tomohiro Koana and Magnus Wahlström</span>
<span class="title">Faster Algorithms on Linear Delta-Matroids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.62">10.4230/LIPIcs.STACS.2025.62</a>
</li>
<li>
<span class="authors">Petr Kolman</span>
<span class="title">Approximation of Spanning Tree Congestion Using Hereditary Bisection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.63">10.4230/LIPIcs.STACS.2025.63</a>
</li>
<li>
<span class="authors">Manuel Lafond, Alitzel López Sánchez, and Weidong Luo</span>
<span class="title">Cluster Editing on Cographs and Related Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.64">10.4230/LIPIcs.STACS.2025.64</a>
</li>
<li>
<span class="authors">Yuwei Liu, Yijia Chen, Shuangle Li, Bingkai Lin, and Xin Zheng</span>
<span class="title">On Average Baby PIH and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.65">10.4230/LIPIcs.STACS.2025.65</a>
</li>
<li>
<span class="authors">Bruno Loff and Alexey Milovanov</span>
<span class="title">The Hardness of Decision Tree Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.66">10.4230/LIPIcs.STACS.2025.66</a>
</li>
<li>
<span class="authors">Aliaume Lopez</span>
<span class="title">Commutative ℕ-Rational Series of Polynomial Growth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.67">10.4230/LIPIcs.STACS.2025.67</a>
</li>
<li>
<span class="authors">Lê Thành Dũng (Tito) Nguyễn and Gabriele Vanoni</span>
<span class="title">Slightly Non-Linear Higher-Order Tree Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.68">10.4230/LIPIcs.STACS.2025.68</a>
</li>
<li>
<span class="authors">Damian Niwiński, Paweł Parys, and Michał Skrzypczak</span>
<span class="title">A Dichotomy Theorem for Ordinal Ranks in MSO</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.69">10.4230/LIPIcs.STACS.2025.69</a>
</li>
<li>
<span class="authors">Boaz Patt-Shamir, Adi Rosén, and Seeun William Umboh</span>
<span class="title">Colorful Vertex Recoloring of Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.70">10.4230/LIPIcs.STACS.2025.70</a>
</li>
<li>
<span class="authors">Patrick Schnider, Linus Stalder, and Simon Weber</span>
<span class="title">Unfairly Splitting Separable Necklaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.71">10.4230/LIPIcs.STACS.2025.71</a>
</li>
<li>
<span class="authors">Kazumasa Shinagawa and Koji Nuida</span>
<span class="title">Card-Based Protocols Imply PSM Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.72">10.4230/LIPIcs.STACS.2025.72</a>
</li>
<li>
<span class="authors">Anastasiia Tkachenko and Haitao Wang</span>
<span class="title">Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.73">10.4230/LIPIcs.STACS.2025.73</a>
</li>
<li>
<span class="authors">Noam Touitou</span>
<span class="title">Nearly-Optimal Algorithm for Non-Clairvoyant Service with Delay</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.74">10.4230/LIPIcs.STACS.2025.74</a>
</li>
<li>
<span class="authors">Oleg Verbitsky and Maksim Zhukovskii</span>
<span class="title">Canonical Labeling of Sparse Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.75">10.4230/LIPIcs.STACS.2025.75</a>
</li>
<li>
<span class="authors">Haitao Wang and Yiming Zhao</span>
<span class="title">Dynamic Unit-Disk Range Reporting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2025.76">10.4230/LIPIcs.STACS.2025.76</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