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