LIPIcs, Volume 272, MFCS 2023

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