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
Most published authors
MFCS papers
3,347 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2017 | Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis. | Xiaotie Deng, Yansong Gao, Jie Zhang |
| 2017 | Binary Search in Graphs Revisited. | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis |
| 2017 | The Hardness of Solving Simple Word Equations. | Joel D. Day, Florin Manea, Dirk Nowotka |
| 2017 | The Shortest Identities for Max-Plus Automata with Two States. | Laure Daviaud, Marianne Johnson |
| 2017 | Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices. | Laure Daviaud, Pierre Guillon, Glenn Merlet |
| 2017 | Another Characterization of the Higher K-Trivials. | Paul-Elliot Angls d'Auriac, Benot Monin |
| 2017 | Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network. | Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj |
| 2017 | Dividing Splittable Goods Evenly and With Limited Fragmentation. | Peter Damaschke |
| 2017 | K4-free Graphs as a Free Algebra. | Enric Cosme-Llpez, Damien Pous |
| 2017 | Automata in the Category of Glued Vector Spaces. | Thomas Colcombet, Daniela Petrisan |
| 2017 | Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak |
| 2017 | Faster Algorithms for Mean-Payoff Parity Games. | Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil |
| 2017 | Strategy Complexity of Concurrent Safety Games. | Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen |
| 2017 | A Characterisation of Pi^0_2 Regular Tree Languages. | Filippo Cavallari, Henryk Michalewski, Michal Skrzypczak |
| 2017 | Distributed Strategies Made Easy. | Simon Castellan, Pierre Clairambault, Glynn Winskel |
| 2017 | Combinatorial Properties and Recognition of Unit Square Visibility Graphs. | Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides |
| 2017 | The Complexity of Quantified Constraints Using the Algebraic Formulation. | Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk |
| 2017 | Reversible Kleene lattices. | Paul Brunet |
| 2017 | Walrasian Pricing in Multi-Unit Auctions. | Simina Brnzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng |
| 2017 | Recognizing Graphs Close to Bipartite Graphs. | Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Danil Paulusma |
| 2017 | Kernelization of the Subset General Position Problem in Geometry. | Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay |
| 2017 | Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. | Ivan Bliznets, Nikolay Karpov |
| 2017 | Clique-Width for Graph Classes Closed under Complementation. | Alexandre Blanch, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Danil Paulusma, Viktor Zamaraev |
| 2017 | Towards a Polynomial Kernel for Directed Feedback Vertex Set. | Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | Emptiness Problems for Integer Circuits. | Dominik Barth, Moritz Beck, Titus Dose, Christian Glaer, Larissa Michler, Marc Technau |
851–875 of 3,347← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing