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