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