| 2020 | 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, Montpellier, France, March 10-13, 2020 Christophe Paul, Markus Bläser |
| 2020 | A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. Lech Duraj |
| 2020 | A Trichotomy for Regular Trail Queries. Wim Martens, Matthias Niewerth, Tina Trautner |
| 2020 | An Automaton Group with PSPACE-Complete Word Problem. Jan Philipp Wächter, Armin Weiß |
| 2020 | An FPT Algorithm for Minimum Additive Spanner Problem. Yusuke Kobayashi |
| 2020 | Asymptotic Divergences and Strong Dichotomy. Xiang Huang, Jack H. Lutz, Elvira Mayordomo, Donald M. Stull |
| 2020 | Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. Mirmahdi Rahgoshay, Mohammad R. Salavatipour |
| 2020 | Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. Andrés Cristi, Andreas Wiese |
| 2020 | Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk). Olivier Bournez |
| 2020 | Computing Maximum Matchings in Temporal Graphs. George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche |
| 2020 | Computing Shrub-Depth Decompositions. Jakub Gajarský, Stephan Kreutzer |
| 2020 | Constant-Time Dynamic (Δ+1)-Coloring. Monika Henzinger, Pan Peng |
| 2020 | Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards. Marcelo Arenas, Juan L. Reutter, Etienne Toussaint, Martín Ugarte, Francisco José Vial Prado, Domagoj Vrgoc |
| 2020 | Decidability and Periodicity of Low Complexity Tilings. Jarkko Kari, Etienne Moutot |
| 2020 | Descriptive Complexity on Non-Polish Spaces. Antonin Callard, Mathieu Hoyrup |
| 2020 | Domino Problem Under Horizontal Constraints. Nathalie Aubrun, Julien Esnay, Mathieu Sablik |
| 2020 | Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths. Stefan Kratsch, Florian Nelles |
| 2020 | Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
| 2020 | Existential Length Universality. Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula |
| 2020 | Fixed-Parameter Algorithms for Unsplittable Flow Cover. Andrés Cristi, Mathieu Mari, Andreas Wiese |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2020 | Generalised Pattern Matching Revisited. Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya |
| 2020 | Graphical Models: Queries, Complexity, Algorithms (Tutorial). Martin C. Cooper, Simon de Givry, Thomas Schiex |
| 2020 | Grundy Coloring & Friends, Half-Graphs, Bicliques. Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora |
| 2020 | How Fast Can You Escape a Compact Polytope? Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell |
| 2020 | Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky |
| 2020 | Improved Bounds on Fourier Entropy and Min-Entropy. Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf |
| 2020 | Inapproximability Results for Scheduling with Interval and Resource Restrictions. Marten Maack, Klaus Jansen |
| 2020 | Information Distance Revisited. Bruno Bauwens |
| 2020 | Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. Nikhil Vyas, R. Ryan Williams |
| 2020 | Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre |
| 2020 | Maximum Matchings in Geometric Intersection Graphs. Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer |
| 2020 | NP-Completeness, Proof Systems, and Disjoint NP-Pairs. Titus Dose, Christian Glaßer |
| 2020 | Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas |
| 2020 | New Bounds for Randomized List Update in the Paid Exchange Model. Susanne Albers, Maximilian Janke |
| 2020 | Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements. Mitsuru Funakoshi, Julian Pape-Lange |
| 2020 | Observation and Distinction. Representing Information in Infinite Games. Dietmar Berwanger, Laurent Doyen |
| 2020 | On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. Suryajith Chillara |
| 2020 | On Covering Segments with Unit Intervals. Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj |
| 2020 | On the Termination of Flooding. Walter Hussak, Amitabh Trehan |
| 2020 | Oracle Complexity Classes and Local Measurements on Physical Hamiltonians. Sevag Gharibian, Stephen Piddock, Justin Yirka |
| 2020 | Parameterized Pre-Coloring Extension and List Coloring Problems. Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström |
| 2020 | Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs. S. M. Dhannya, N. S. Narayanaswamy |
| 2020 | Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. Taisuke Izumi, François Le Gall, Frédéric Magniez |
| 2020 | Randomness and Initial Segment Complexity for Probability Measures. André Nies, Frank Stephan |
| 2020 | Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. Michal Wrona |
| 2020 | Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. Jacobo Torán, Florian Wörz |
| 2020 | Secret Key Agreement from Correlated Data, with No Prior Information. Marius Zimand |
| 2020 | Shortest Reconfiguration of Colorings Under Kempe Changes. Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa |
| 2020 | Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space. Falko Hegerfeld, Stefan Kratsch |
| 2020 | Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann |
| 2020 | Statistical Physics and Algorithms (Invited Talk). Dana Randall |
| 2020 | Streaming Complexity of Spanning Tree Computation. Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai |
| 2020 | String Indexing with Compressed Patterns. Philip Bille, Inge Li Gørtz, Teresa Anna Steiner |
| 2020 | Succinct Population Protocols for Presburger Arithmetic. Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax |
| 2020 | The SDP Value for Random Two-Eigenvalue CSPs. Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes |
| 2020 | The Tandem Duplication Distance Is NP-Hard. Manuel Lafond, Binhai Zhu, Peng Zou |
| 2020 | Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. Brieuc Guinard, Amos Korman |
| 2020 | Typical Sequences Revisited - Computing Width Parameters of Graphs. Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle |
| 2020 | Unambiguous Separators for Tropical Tree Automata. Thomas Colcombet, Sylvain Lombardy |
| 2020 | Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before. Michal Ganczorz |
| 2020 | Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). Martin Grohe |