MFCS

Keyphrases

Publications

2023

Benjamin Scheidt, Nicole Schweikardt
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. MFCS (2023)
Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer
On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages. MFCS (2023)
Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. MFCS (2023)
Shaull Almagor, Arka Ghosh, Tim Leys, Guillermo A. Pérez
The Geometry of Reachability in Continuous Vector Addition Systems with States. MFCS (2023)
Manuel Lafond, Weidong Luo
Parameterized Complexity of Domination Problems Using Restricted Modular Partitions. MFCS (2023)
Benedikt Pago
Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits. MFCS (2023)
Harmender Gahlawat, Meirav Zehavi
Parameterized Analysis of the Cops and Robber Game. MFCS (2023)
Antonis Achilleos, Aggeliki Chalki
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. MFCS (2023)
Florian Frank, Stefan Milius, Henning Urbat
Positive Data Languages. MFCS (2023)
Peter Mayr
On the Complexity Dichotomy for the Satisfiability of Systems of Term Equations over Finite Algebras. MFCS (2023)
Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith
The Online Simple Knapsack Problem with Reservation and Removability. MFCS (2023)
Pablo Barceló, Diego Figueira, Rémi Morvan
Separating Automatic Relations. MFCS (2023)
Charles Bouillaguet, Florette Martinez, Damien Vergnaud
Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator. MFCS (2023)
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. MFCS (2023)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. MFCS (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS (2023)
Jack H. Lutz, Satyadev Nandakumar, Subin Pulari
A Weyl Criterion for Finite-State Dimension and Applications. MFCS (2023)
Alex Rose, Alexander Okhotin
Probabilistic Input-Driven Pushdown Automata. MFCS (2023)
Christoph Haase, Alessio Mansutti, Amaury Pouly
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). MFCS (2023)
Marthe Bonamy
Exploring the Space of Colourings with Kempe Changes (Invited Talk). MFCS (2023)
Jakub Bulín, Michael Kompatscher
Short Definitions in Constraint Languages. MFCS (2023)
Neeldhara Misra, Saraswati Girish Nanoti
Spartan Bipartite Graphs Are Essentially Elementary. MFCS (2023)
Spyros Angelopoulos, Shahin Kamali
Rényi-Ulam Games and Online Computation with Imperfect Advice. MFCS (2023)
Meng-Tsung Tsai, Shi-Chun Tsai, Tsung-Ta Wu
Dependent k-Set Packing on Polynomoids. MFCS (2023)
Léonard Brice, Jean-François Raskin, Marie van den Bogaard
Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games. MFCS (2023)
Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto
Descriptive Complexity for Distributed Computing with Circuits. MFCS (2023)
Theodoros Papamakarios
A Super-Polynomial Separation Between Resolution and Cut-Free Sequent Calculus. MFCS (2023)
Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese
Exact and Approximation Algorithms for Routing a Convoy Through a Graph. MFCS (2023)
Margarita Mikhelson, Alexander Okhotin
Parallel Enumeration of Parse Trees. MFCS (2023)
Cornelius Brand, Viktoriia Korchemna, Michael Skotnica
Deterministic Constrained Multilinear Detection. MFCS (2023)
Michal Konecný, Sewon Park, Holger Thies
Formalizing Hyperspaces for Extracting Efficient Exact Real Computation. MFCS (2023)
Artur Czumaj
Modern Parallel Algorithms (Invited Talk). MFCS (2023)
Noy Biton, Reut Levi, Moti Medina
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. MFCS (2023)
Laura Kovács
Algebraic Reasoning for (Un)Solvable Loops (Invited Talk). MFCS (2023)
Nader H. Bshouty
On Property Testing of the Binary Rank. MFCS (2023)
Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, Christos Tzamos
Graph Connectivity with Noisy Queries. MFCS (2023)
Nina Klobas, George B. Mertzios, Paul G. Spirakis
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). MFCS (2023)
Isa Vialard
Ordinal Measures of the Set of Finite Multisets. MFCS (2023)
Vera Chekan, Stefan Kratsch
Tight Algorithmic Applications of Clique-Width Generalizations. MFCS (2023)
Vikraman Arvind, Pushkar S. Joglekar
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. MFCS (2023)
Kei Uchizawa, Haruki Abe
Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and Energy. MFCS (2023)
Tom Demeulemeester, Jannik Peters
Relaxed Core Stability for Hedonic Games with Size-Dependent Utilities. MFCS (2023)
Yoshiki Nakamura
On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation. MFCS (2023)
Clotilde Bizière, Erich Grädel, Matthias Naaf
Locality Theorems in Semiring Semantics. MFCS (2023)
Mika Göös, Ziyi Guan, Tiberiu Mosnoi
Depth-3 Circuits for Inner Product. MFCS (2023)
Juha Kontinen, Max Sandström, Jonni Virtema
Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity. MFCS (2023)
Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan
Query Complexity of Search Problems. MFCS (2023)
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. MFCS (2023)
Front Matter, Table of Contents, Preface, Conference Organization. MFCS (2023)

volume 272, 2023

48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France MFCS 272 (2023)