Skip to content

International Symposium on Mathematical Foundations of Computer Science

MFCS

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

3,347

1973–2026

Papers per year

1973101 peak2026

MFCS papers

3,347 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2020Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs.Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari
2020A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps.Raul Lopes, Ignasi Sau
2020Minimum 0-Extension Problems on Directed Metrics.Hiroshi Hirai, Ryuhei Mizutani
2020Concurrent Games with Arbitrarily Many Players (Invited Talk).Nathalie Bertrand
2020Approximation in (Poly-) Logarithmic Space.Arindam Biswas, Venkatesh Raman, Saket Saurabh
2019Front Matter, Table of Contents, Preface, Conference Organization.
2019Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time (Invited Talk).Alexandra Silva
2019Lower Bounds for Multilinear Order-Restricted ABPs.C. Ramya, B. V. Raghavendra Rao
2019The Fluted Fragment with Transitivity.Ian Pratt-Hartmann, Lidia Tendera
2019Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time.Pawel Parys
2019Two variable fragment of Term Modal Logic.Anantha Padmanabha, R. Ramanujam
2019Approximating Activation Edge-Cover and Facility Location Problems.Zeev Nutov, Guy Kortsarz, Eli Shalom
2019Reconfiguration of Minimum Steiner Trees via Vertex Exchanges.Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2019Colouring H-Free Graphs of Bounded Diameter.Barnaby Martin, Danil Paulusma, Siani Smith
2019A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs.Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
2019Determinisation of Finitely-Ambiguous Copyless Cost Register Automata.Thodore Lopez, Benjamin Monmege, Jean-Marc Talbot
2019Picking Random Vertices (Invited Talk).Daniel Lokshtanov
2019The Power Word Problem.Markus Lohrey, Armin Wei
2019Uniformisation Gives the Full Strength of Regular Languages.Nathan Lhote, Vincent Michielini, Michal Skrzypczak
2019Petri Net Reachability Problem (Invited Talk).Jrme Leroux
2019Constrained Representations of Map Graphs and Half-Squares.Hong-Oanh Le, Van Bang Le
2019On the Strength of Uniqueness Quantification in Primitive Positive Formulas.Victor Lagerkvist, Gustav Nordh
2019Cluster Deletion on Interval Graphs and Split Related Graphs.Athanasios L. Konstantinidis, Charis Papadopoulos
2019Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs.Christian Konrad, Viktor Zamaraev
2019Uniform Random Expressions Lack Expressivity.Florent Koechlin, Cyril Nicaud, Pablo Rotondo
626650 of 3,347← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.