| 2020 | 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, Prague, Czech Republic, August 24-28, 2020 Javier Esparza, Daniel Král' |
| 2020 | A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. Vít Jelínek, Michal Opler, Jakub Pekárek |
| 2020 | A Polynomial Kernel for 3-Leaf Power Deletion. Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum |
| 2020 | A Quasiorder-Based Perspective on Residual Automata. Pierre Ganty, Elena Gutiérrez, Pedro Valero |
| 2020 | A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. Raul Lopes, Ignasi Sau |
| 2020 | A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2020 | A Timecop's Work Is Harder Than You Think. Nils Morawietz, Carolin Rehs, Mathias Weller |
| 2020 | Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes. Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen |
| 2020 | All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words. Jarkko Peltomäki, Markus A. Whiteland |
| 2020 | Ambiguity Hierarchy of Regular Infinite Tree Languages. Alexander Rabinovich, Doron Tiferet |
| 2020 | An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints. Kim Thang Nguyen |
| 2020 | Analysing Spatial Properties on Neighbourhood Spaces. Sven Linker, Fabio Papacchini, Michele Sevegnani |
| 2020 | Approximation in (Poly-) Logarithmic Space. Arindam Biswas, Venkatesh Raman, Saket Saurabh |
| 2020 | Best Fit Bin Packing with Random Order Revisited. Susanne Albers, Arindam Khan, Leon Ladewig |
| 2020 | Building Large k-Cores from Sparse Graphs. Fedor V. Fomin, Danil Sagunov, Kirill Simonov |
| 2020 | Classically Simulating Quantum Circuits with Local Depolarizing Noise. Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani |
| 2020 | Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. Emirhan Gürpinar, Andrei Romashchenko |
| 2020 | Complexity of Computing the Anti-Ramsey Numbers for Paths. Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi |
| 2020 | Complexity of Counting First-Order Logic for the Subword Order. Dietrich Kuske, Christian Schwarz |
| 2020 | Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary |
| 2020 | Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon |
| 2020 | Concurrent Games with Arbitrarily Many Players (Invited Talk). Nathalie Bertrand |
| 2020 | Continuous and Monotone Machines. Michal Konecný, Florian Steinberg, Holger Thies |
| 2020 | Decidability in Group Shifts and Group Cellular Automata. Pierre Béaur, Jarkko Kari |
| 2020 | Dynamic Time Warping-Based Proximity Problems. Boris Aronov, Matthew J. Katz, Elad Sulami |
| 2020 | Efficient Enumerations for Minimal Multicuts and Multiway Cuts. Kazuhiro Kurita, Yasuaki Kobayashi |
| 2020 | Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari |
| 2020 | Elimination Distance to Bounded Degree on Planar Graphs. Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny |
| 2020 | Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. Alessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi |
| 2020 | Even Faster Algorithms for CSAT Over supernilpotent Algebras. Piotr Kawalek, Jacek Krzaczkowski |
| 2020 | Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev |
| 2020 | Extending Nearly Complete 1-Planar Drawings in Polynomial Time. Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg |
| 2020 | Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. Zeyu Guo |
| 2020 | Fast Algorithms for General Spin Systems on Bipartite Expanders. Andreas Galanis, Leslie Ann Goldberg, James Stewart |
| 2020 | Fractional Covers of Hypergraphs with Bounded Multi-Intersection. Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2020 | Graph Clustering in All Parameter Regimes. Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang |
| 2020 | Hierarchical Clusterings of Unweighted Graphs. Svein Høgemo, Christophe Paul, Jan Arne Telle |
| 2020 | Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. Ignasi Sau, Uéverton dos Santos Souza |
| 2020 | Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain. Arpitha P. Bharathi, Monaldo Mastrolilli |
| 2020 | Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. Palash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy |
| 2020 | Isomorphism Problem for S_d-Graphs. Deniz Agaoglu, Petr Hlinený |
| 2020 | Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. Markus Lohrey, Georg Zetzsche |
| 2020 | Layered Fan-Planar Graph Drawings. Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou |
| 2020 | Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. Paul Gallot, Aurélien Lemay, Sylvain Salvati |
| 2020 | List Homomorphism Problems for Signed Graphs. Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková |
| 2020 | List-Decodability of Structured Ensembles of Codes (Invited Talk). Mary Wootters |
| 2020 | Minimum 0-Extension Problems on Directed Metrics. Hiroshi Hirai, Ryuhei Mizutani |
| 2020 | On Affine Reachability Problems. Stefan Jaax, Stefan Kiefer |
| 2020 | On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. Toghrul Karimov, Joël Ouaknine, James Worrell |
| 2020 | On Repetition Languages. Orna Kupferman, Ofer Leshkowitz |
| 2020 | On a Temporal Logic of Prefixes and Infixes. Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala |
| 2020 | On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma |
| 2020 | Optimally Resilient Strategies in Pushdown Safety Games. Daniel Neider, Patrick Totzke, Martin Zimmermann |
| 2020 | PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations. Alexandre Clément, Simon Perdrix |
| 2020 | Palindromic k-Factorization in Pure Linear Time. Mikhail Rubinchik, Arseny M. Shur |
| 2020 | Preservation of Equations by Monoidal Monads. Louis Parlant, Jurriaan Rot, Alexandra Silva, Bas Westerbaan |
| 2020 | Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs |
| 2020 | Quantum-Inspired Classical Algorithms for Singular Value Transformation. Dhawal Jethwani, François Le Gall, Sanjay Kumar Singh |
| 2020 | Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming. Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, Chunhao Wang |
| 2020 | Quick Separation in Chordal and Split Graphs. Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma |
| 2020 | Randomization in Non-Uniform Finite Automata. Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith |
| 2020 | Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests. Janaky Murthy, Vineet Nair, Chandan Saha |
| 2020 | Randomness and Effective Dimension of Continued Fractions. Satyadev Nandakumar, Prateek Vishnoi |
| 2020 | Reducing Graph Transversals via Edge Contractions. Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza |
| 2020 | Register Transducers Are Marble Transducers. Gaëtan Douéneau-Tabot, Emmanuel Filiot, Paul Gastin |
| 2020 | Regular Choice Functions and Uniformisations For countable Domains. Vincent Michielini, Michal Skrzypczak |
| 2020 | Regular Resynchronizability of Origin Transducers Is Undecidable. Denis Kuperberg, Jan Martens |
| 2020 | Sensitivity Lower Bounds from Linear Dependencies. Sophie Laplante, Reza Naserasr, Anupa Sunny |
| 2020 | Simplified Game of Life: Algorithms and Complexity. Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda |
| 2020 | Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras. Markus Bläser, Vladimir Lysikov |
| 2020 | Solving Packing Problems with Few Small Items Using Rainbow Matchings. Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath |
| 2020 | Some Open Problems in Computational Geometry (Invited Talk). Sergio Cabello |
| 2020 | Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers. Mikolaj Bojanczyk, Janusz Schmude |
| 2020 | Span Programs and Quantum Time Complexity. Arjan Cornelissen, Stacey Jeffery, Maris Ozols, Alvaro Piedrafita |
| 2020 | Structural Parameterizations of Clique Coloring. Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
| 2020 | Synchronizing Deterministic Push-Down Automata Can Be Really Hard. Henning Fernau, Petra Wolf, Tomoyuki Yamakami |
| 2020 | Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions. Mitsunori Ogihara, Kei Uchizawa |
| 2020 | The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. Caterina Viola, Stanislav Zivný |
| 2020 | The Complexity of Approximating the Complex-Valued Potts Model. Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos |
| 2020 | The Mergegram of a Dendrogram and Its Stability. Yury Elkin, Vitaliy Kurlin |
| 2020 | Topological Influence and Locality in Swap Schelling Games. Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor |
| 2020 | U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. Jan Kratochvíl, Tomás Masarík, Jana Novotná |
| 2020 | Unary Prime Languages. Ismaël Jecker, Orna Kupferman, Nicolas Mazzocchi |
| 2020 | VC Density of Set Systems Definable in Tree-Like Graphs. Adam Paszke, Michal Pilipczuk |
| 2020 | Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann |
| 2020 | ∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten |