<h2>LIPIcs, Volume 272, MFCS 2023</h2>
<ul>
<li>
<span class="authors">Jérôme Leroux, Sylvain Lombardy, and David Peleg</span>
<span class="title">LIPIcs, Volume 272, MFCS 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023">10.4230/LIPIcs.MFCS.2023</a>
</li>
<li>
<span class="authors">Jérôme Leroux, Sylvain Lombardy, and David Peleg</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.0">10.4230/LIPIcs.MFCS.2023.0</a>
</li>
<li>
<span class="authors">Marthe Bonamy</span>
<span class="title">Exploring the Space of Colourings with Kempe Changes (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.1">10.4230/LIPIcs.MFCS.2023.1</a>
</li>
<li>
<span class="authors">Joan Boyar</span>
<span class="title">Online Algorithms with Predictions (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.2">10.4230/LIPIcs.MFCS.2023.2</a>
</li>
<li>
<span class="authors">Artur Czumaj</span>
<span class="title">Modern Parallel Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.3">10.4230/LIPIcs.MFCS.2023.3</a>
</li>
<li>
<span class="authors">Laura Kovács</span>
<span class="title">Algebraic Reasoning for (Un)Solvable Loops (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.4">10.4230/LIPIcs.MFCS.2023.4</a>
</li>
<li>
<span class="authors">Nina Klobas, George B. Mertzios, and Paul G. Spirakis</span>
<span class="title">Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.5">10.4230/LIPIcs.MFCS.2023.5</a>
</li>
<li>
<span class="authors">Faisal N. Abu-Khzam, Henning Fernau, and Kevin Mann</span>
<span class="title">Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.6">10.4230/LIPIcs.MFCS.2023.6</a>
</li>
<li>
<span class="authors">Antonis Achilleos and Aggeliki Chalki</span>
<span class="title">Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.7">10.4230/LIPIcs.MFCS.2023.7</a>
</li>
<li>
<span class="authors">Deniz Ağaoğlu Çağırıcı, Onur Çağırıcı, Jan Derbisz, Tim A. Hartmann, Petr Hliněný, Jan Kratochvíl, Tomasz Krawczyk, and Peter Zeman</span>
<span class="title">Recognizing H-Graphs - Beyond Circular-Arc Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.8">10.4230/LIPIcs.MFCS.2023.8</a>
</li>
<li>
<span class="authors">Veeti Ahvonen, Damian Heiman, Lauri Hella, and Antti Kuusisto</span>
<span class="title">Descriptive Complexity for Distributed Computing with Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.9">10.4230/LIPIcs.MFCS.2023.9</a>
</li>
<li>
<span class="authors">Marianne Akian, Stéphane Gaubert, Ulysse Naepels, and Basile Terver</span>
<span class="title">Solving Irreducible Stochastic Mean-Payoff Games and Entropy Games by Relative Krasnoselskii-Mann Iteration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.10">10.4230/LIPIcs.MFCS.2023.10</a>
</li>
<li>
<span class="authors">Shaull Almagor, Arka Ghosh, Tim Leys, and Guillermo A. Pérez</span>
<span class="title">The Geometry of Reachability in Continuous Vector Addition Systems with States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.11">10.4230/LIPIcs.MFCS.2023.11</a>
</li>
<li>
<span class="authors">Spyros Angelopoulos</span>
<span class="title">Competitive Search in the Line and the Star with Predictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.12">10.4230/LIPIcs.MFCS.2023.12</a>
</li>
<li>
<span class="authors">Spyros Angelopoulos and Shahin Kamali</span>
<span class="title">Rényi-Ulam Games and Online Computation with Imperfect Advice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.13">10.4230/LIPIcs.MFCS.2023.13</a>
</li>
<li>
<span class="authors">Vikraman Arvind and Pushkar S. Joglekar</span>
<span class="title">Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.14">10.4230/LIPIcs.MFCS.2023.14</a>
</li>
<li>
<span class="authors">Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer</span>
<span class="title">Entropic Risk for Turn-Based Stochastic Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.15">10.4230/LIPIcs.MFCS.2023.15</a>
</li>
<li>
<span class="authors">Jiří Balun, Tomáš Masopust, and Petr Osička</span>
<span class="title">Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.16">10.4230/LIPIcs.MFCS.2023.16</a>
</li>
<li>
<span class="authors">Pablo Barceló, Diego Figueira, and Rémi Morvan</span>
<span class="title">Separating Automatic Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.17">10.4230/LIPIcs.MFCS.2023.17</a>
</li>
<li>
<span class="authors">Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, and Tommaso Piselli</span>
<span class="title">On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.18">10.4230/LIPIcs.MFCS.2023.18</a>
</li>
<li>
<span class="authors">Noy Biton, Reut Levi, and Moti Medina</span>
<span class="title">Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.19">10.4230/LIPIcs.MFCS.2023.19</a>
</li>
<li>
<span class="authors">Clotilde Bizière, Erich Grädel, and Matthias Naaf</span>
<span class="title">Locality Theorems in Semiring Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.20">10.4230/LIPIcs.MFCS.2023.20</a>
</li>
<li>
<span class="authors">Manon Blanc and Olivier Bournez</span>
<span class="title">A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with Analytic Discrete ODEs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.21">10.4230/LIPIcs.MFCS.2023.21</a>
</li>
<li>
<span class="authors">Ivan Bliznets and Vladislav Epifanov</span>
<span class="title">MaxCut Above Guarantee</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.22">10.4230/LIPIcs.MFCS.2023.22</a>
</li>
<li>
<span class="authors">Charles Bouillaguet, Florette Martinez, and Damien Vergnaud</span>
<span class="title">Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.23">10.4230/LIPIcs.MFCS.2023.23</a>
</li>
<li>
<span class="authors">Dylan Braithwaite, Jules Hedges, and Toby St Clere Smithe</span>
<span class="title">The Compositional Structure of Bayesian Inference</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.24">10.4230/LIPIcs.MFCS.2023.24</a>
</li>
<li>
<span class="authors">Cornelius Brand, Viktoriia Korchemna, and Michael Skotnica</span>
<span class="title">Deterministic Constrained Multilinear Detection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.25">10.4230/LIPIcs.MFCS.2023.25</a>
</li>
<li>
<span class="authors">Léonard Brice, Jean-François Raskin, and Marie van den Bogaard</span>
<span class="title">Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.26">10.4230/LIPIcs.MFCS.2023.26</a>
</li>
<li>
<span class="authors">Nader H. Bshouty</span>
<span class="title">On Property Testing of the Binary Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.27">10.4230/LIPIcs.MFCS.2023.27</a>
</li>
<li>
<span class="authors">Jakub Bulín and Michael Kompatscher</span>
<span class="title">Short Definitions in Constraint Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.28">10.4230/LIPIcs.MFCS.2023.28</a>
</li>
<li>
<span class="authors">Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, and Peter Rossmanith</span>
<span class="title">The Online Simple Knapsack Problem with Reservation and Removability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.29">10.4230/LIPIcs.MFCS.2023.29</a>
</li>
<li>
<span class="authors">Michaël Cadilhac, Arka Ghosh, Guillermo A. Pérez, and Ritam Raha</span>
<span class="title">Parikh One-Counter Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.30">10.4230/LIPIcs.MFCS.2023.30</a>
</li>
<li>
<span class="authors">Yixin Cao, Hanchun Yuan, and Jianxin Wang</span>
<span class="title">Modification Problems Toward Proper (Helly) Circular-Arc Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.31">10.4230/LIPIcs.MFCS.2023.31</a>
</li>
<li>
<span class="authors">Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, and Yann Vaxès</span>
<span class="title">Isometric Path Complexity of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.32">10.4230/LIPIcs.MFCS.2023.32</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty, Gunjan Kumar, and Kuldeep S. Meel</span>
<span class="title">Support Size Estimation: The Power of Conditioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.33">10.4230/LIPIcs.MFCS.2023.33</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay, Yogesh Dahiya, and Meena Mahajan</span>
<span class="title">Query Complexity of Search Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.34">10.4230/LIPIcs.MFCS.2023.34</a>
</li>
<li>
<span class="authors">Vera Chekan and Stefan Kratsch</span>
<span class="title">Tight Algorithmic Applications of Clique-Width Generalizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.35">10.4230/LIPIcs.MFCS.2023.35</a>
</li>
<li>
<span class="authors">Julien Clément and Antoine Genitrini</span>
<span class="title">An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.36">10.4230/LIPIcs.MFCS.2023.36</a>
</li>
<li>
<span class="authors">Liron Cohen, Bruno da Rocha Paiva, Vincent Rahli, and Ayberk Tosun</span>
<span class="title">Inductive Continuity via Brouwer Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.37">10.4230/LIPIcs.MFCS.2023.37</a>
</li>
<li>
<span class="authors">Mohan Dantam and Richard Mayr</span>
<span class="title">Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.38">10.4230/LIPIcs.MFCS.2023.38</a>
</li>
<li>
<span class="authors">Samir Datta, Asif Khan, and Anish Mukherjee</span>
<span class="title">Dynamic Planar Embedding Is in DynFO</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.39">10.4230/LIPIcs.MFCS.2023.39</a>
</li>
<li>
<span class="authors">Laure Daviaud and Andrew Ryzhikov</span>
<span class="title">Universality and Forall-Exactness of Cost Register Automata with Few Registers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.40">10.4230/LIPIcs.MFCS.2023.40</a>
</li>
<li>
<span class="authors">Tom Demeulemeester and Jannik Peters</span>
<span class="title">Relaxed Core Stability for Hedonic Games with Size-Dependent Utilities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.41">10.4230/LIPIcs.MFCS.2023.41</a>
</li>
<li>
<span class="authors">Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, and Nicolas Nisse</span>
<span class="title">Recontamination Helps a Lot to Hunt a Rabbit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.42">10.4230/LIPIcs.MFCS.2023.42</a>
</li>
<li>
<span class="authors">Matthew Earnshaw and Paweł Sobociński</span>
<span class="title">String Diagrammatic Trace Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.43">10.4230/LIPIcs.MFCS.2023.43</a>
</li>
<li>
<span class="authors">Fabian Egidy, Christian Glaßer, and Martin Herold</span>
<span class="title">Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.44">10.4230/LIPIcs.MFCS.2023.44</a>
</li>
<li>
<span class="authors">Eduard Eiben, Diptapriyo Majumdar, and M. S. Ramanujan</span>
<span class="title">Finding a Highly Connected Steiner Subgraph and its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.45">10.4230/LIPIcs.MFCS.2023.45</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Tomohiro Koana</span>
<span class="title">FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.46">10.4230/LIPIcs.MFCS.2023.46</a>
</li>
<li>
<span class="authors">Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, and Christos Tzamos</span>
<span class="title">Graph Connectivity with Noisy Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.47">10.4230/LIPIcs.MFCS.2023.47</a>
</li>
<li>
<span class="authors">Florian Frank, Stefan Milius, and Henning Urbat</span>
<span class="title">Positive Data Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.48">10.4230/LIPIcs.MFCS.2023.48</a>
</li>
<li>
<span class="authors">Harmender Gahlawat and Meirav Zehavi</span>
<span class="title">Parameterized Analysis of the Cops and Robber Game</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.49">10.4230/LIPIcs.MFCS.2023.49</a>
</li>
<li>
<span class="authors">Luisa Gargano and Adele A. Rescigno</span>
<span class="title">An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.50">10.4230/LIPIcs.MFCS.2023.50</a>
</li>
<li>
<span class="authors">Mika Göös, Ziyi Guan, and Tiberiu Mosnoi</span>
<span class="title">Depth-3 Circuits for Inner Product</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.51">10.4230/LIPIcs.MFCS.2023.51</a>
</li>
<li>
<span class="authors">Christoph Haase, Alessio Mansutti, and Amaury Pouly</span>
<span class="title">On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.52">10.4230/LIPIcs.MFCS.2023.52</a>
</li>
<li>
<span class="authors">Niklas Hahn and Michalis Xefteris</span>
<span class="title">The Covering Canadian Traveller Problem Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.53">10.4230/LIPIcs.MFCS.2023.53</a>
</li>
<li>
<span class="authors">Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, and Bernhard Seeger</span>
<span class="title">On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.54">10.4230/LIPIcs.MFCS.2023.54</a>
</li>
<li>
<span class="authors">Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, and Saket Saurabh</span>
<span class="title">Fixed-Parameter Algorithms for Fair Hitting Set Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.55">10.4230/LIPIcs.MFCS.2023.55</a>
</li>
<li>
<span class="authors">Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, and Saket Saurabh</span>
<span class="title">Parameterized Approximation Scheme for Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.56">10.4230/LIPIcs.MFCS.2023.56</a>
</li>
<li>
<span class="authors">Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, and Erik Jan van Leeuwen</span>
<span class="title">Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.57">10.4230/LIPIcs.MFCS.2023.57</a>
</li>
<li>
<span class="authors">Yasuaki Kobayashi, Kazuhiro Kurita, and Kunihiro Wasa</span>
<span class="title">Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.58">10.4230/LIPIcs.MFCS.2023.58</a>
</li>
<li>
<span class="authors">Michal Konečný, Sewon Park, and Holger Thies</span>
<span class="title">Formalizing Hyperspaces for Extracting Efficient Exact Real Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.59">10.4230/LIPIcs.MFCS.2023.59</a>
</li>
<li>
<span class="authors">Juha Kontinen, Max Sandström, and Jonni Virtema</span>
<span class="title">Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.60">10.4230/LIPIcs.MFCS.2023.60</a>
</li>
<li>
<span class="authors">Manuel Lafond and Weidong Luo</span>
<span class="title">Parameterized Complexity of Domination Problems Using Restricted Modular Partitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.61">10.4230/LIPIcs.MFCS.2023.61</a>
</li>
<li>
<span class="authors">Michael Lampis, Nikolaos Melissinos, and Manolis Vasilakis</span>
<span class="title">Parameterized Max Min Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.62">10.4230/LIPIcs.MFCS.2023.62</a>
</li>
<li>
<span class="authors">François Le Gall, Masayuki Miyamoto, and Harumichi Nishimura</span>
<span class="title">Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.63">10.4230/LIPIcs.MFCS.2023.63</a>
</li>
<li>
<span class="authors">Felicia Lucke, Daniël Paulusma, and Bernard Ries</span>
<span class="title">Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.64">10.4230/LIPIcs.MFCS.2023.64</a>
</li>
<li>
<span class="authors">Jack H. Lutz, Satyadev Nandakumar, and Subin Pulari</span>
<span class="title">A Weyl Criterion for Finite-State Dimension and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.65">10.4230/LIPIcs.MFCS.2023.65</a>
</li>
<li>
<span class="authors">Peter Mayr</span>
<span class="title">On the Complexity Dichotomy for the Satisfiability of Systems of Term Equations over Finite Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.66">10.4230/LIPIcs.MFCS.2023.66</a>
</li>
<li>
<span class="authors">Margarita Mikhelson and Alexander Okhotin</span>
<span class="title">Parallel Enumeration of Parse Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.67">10.4230/LIPIcs.MFCS.2023.67</a>
</li>
<li>
<span class="authors">Neeldhara Misra and Saraswati Girish Nanoti</span>
<span class="title">Spartan Bipartite Graphs Are Essentially Elementary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.68">10.4230/LIPIcs.MFCS.2023.68</a>
</li>
<li>
<span class="authors">Yoshiki Nakamura</span>
<span class="title">On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.69">10.4230/LIPIcs.MFCS.2023.69</a>
</li>
<li>
<span class="authors">Satyadev Nandakumar, Akhil S, and Prateek Vishnoi</span>
<span class="title">Effective Continued Fraction Dimension Versus Effective Hausdorff Dimension of Reals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.70">10.4230/LIPIcs.MFCS.2023.70</a>
</li>
<li>
<span class="authors">Taisei Nogami and Tachio Terauchi</span>
<span class="title">On the Expressive Power of Regular Expressions with Backreferences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.71">10.4230/LIPIcs.MFCS.2023.71</a>
</li>
<li>
<span class="authors">Sergei Ovcharov</span>
<span class="title">OBDD(Join) Proofs Cannot Be Balanced</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.72">10.4230/LIPIcs.MFCS.2023.72</a>
</li>
<li>
<span class="authors">Benedikt Pago</span>
<span class="title">Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.73">10.4230/LIPIcs.MFCS.2023.73</a>
</li>
<li>
<span class="authors">Theodoros Papamakarios</span>
<span class="title">A Super-Polynomial Separation Between Resolution and Cut-Free Sequent Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.74">10.4230/LIPIcs.MFCS.2023.74</a>
</li>
<li>
<span class="authors">Léo Paviet Salomon and Pascal Vanier</span>
<span class="title">Realizing Finitely Presented Groups as Projective Fundamental Groups of SFTs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.75">10.4230/LIPIcs.MFCS.2023.75</a>
</li>
<li>
<span class="authors">Stefan Ratschan</span>
<span class="title">Deciding Predicate Logical Theories Of Real-Valued Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.76">10.4230/LIPIcs.MFCS.2023.76</a>
</li>
<li>
<span class="authors">Guozhen Rong, Yongjie Yang, and Wenjun Li</span>
<span class="title">A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.77">10.4230/LIPIcs.MFCS.2023.77</a>
</li>
<li>
<span class="authors">Alex Rose and Alexander Okhotin</span>
<span class="title">Probabilistic Input-Driven Pushdown Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.78">10.4230/LIPIcs.MFCS.2023.78</a>
</li>
<li>
<span class="authors">Benjamin Scheidt and Nicole Schweikardt</span>
<span class="title">Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.79">10.4230/LIPIcs.MFCS.2023.79</a>
</li>
<li>
<span class="authors">Jonas Schmidt and Thomas Schwentick</span>
<span class="title">Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.80">10.4230/LIPIcs.MFCS.2023.80</a>
</li>
<li>
<span class="authors">Jonas Schmidt, Thomas Schwentick, and Jennifer Todtenhoefer</span>
<span class="title">On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.81">10.4230/LIPIcs.MFCS.2023.81</a>
</li>
<li>
<span class="authors">Tim Seppelt</span>
<span class="title">Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.82">10.4230/LIPIcs.MFCS.2023.82</a>
</li>
<li>
<span class="authors">Daniel Alexander Spenner</span>
<span class="title">Decomposing Finite Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.83">10.4230/LIPIcs.MFCS.2023.83</a>
</li>
<li>
<span class="authors">Meng-Tsung Tsai, Shi-Chun Tsai, and Tsung-Ta Wu</span>
<span class="title">Dependent k-Set Packing on Polynomoids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.84">10.4230/LIPIcs.MFCS.2023.84</a>
</li>
<li>
<span class="authors">Kei Uchizawa and Haruki Abe</span>
<span class="title">Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and Energy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.85">10.4230/LIPIcs.MFCS.2023.85</a>
</li>
<li>
<span class="authors">Martijn van Ee, Tim Oosterwijk, René Sitters, and Andreas Wiese</span>
<span class="title">Exact and Approximation Algorithms for Routing a Convoy Through a Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.86">10.4230/LIPIcs.MFCS.2023.86</a>
</li>
<li>
<span class="authors">Isa Vialard</span>
<span class="title">Ordinal Measures of the Set of Finite Multisets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.87">10.4230/LIPIcs.MFCS.2023.87</a>
</li>
<li>
<span class="authors">Nicolas Waldburger</span>
<span class="title">Checking Presence Reachability Properties on Parameterized Shared-Memory Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2023.88">10.4230/LIPIcs.MFCS.2023.88</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