| 2020 | Lower Bounds for Arithmetic Circuits via the Hankel Matrix. | Nathanal Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre |
| 2020 | A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. | Lech Duraj |
| 2020 | NP-Completeness, Proof Systems, and Disjoint NP-Pairs. | Titus Dose, Christian Glaer |
| 2020 | Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs. | S. M. Dhannya, N. S. Narayanaswamy |
| 2020 | How Fast Can You Escape a Compact Polytope? | Julian D'Costa, Engel Lefaucheux, Jol Ouaknine, James Worrell |
| 2020 | Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. | Andrs Cristi, Andreas Wiese |
| 2020 | Fixed-Parameter Algorithms for Unsplittable Flow Cover. | Andrs Cristi, Mathieu Mari, Andreas Wiese |
| 2020 | Graphical Models: Queries, Complexity, Algorithms (Tutorial). | Martin C. Cooper, Simon de Givry, Thomas Schiex |
| 2020 | Unambiguous Separators for Tropical Tree Automata. | Thomas Colcombet, Sylvain Lombardy |
| 2020 | On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. | Suryajith Chillara |
| 2020 | Streaming Complexity of Spanning Tree Computation. | Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai |
| 2020 | Descriptive Complexity on Non-Polish Spaces. | Antonin Callard, Mathieu Hoyrup |
| 2020 | Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk). | Olivier Bournez |
| 2020 | Maximum Matchings in Geometric Intersection Graphs. | douard Bonnet, Sergio Cabello, Wolfgang Mulzer |
| 2020 | Shortest Reconfiguration of Colorings Under Kempe Changes. | Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mhlenthaler, Akira Suzuki, Kunihiro Wasa |
| 2020 | Typical Sequences Revisited - Computing Width Parameters of Graphs. | Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle |
| 2020 | Succinct Population Protocols for Presburger Arithmetic. | Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax |
| 2020 | Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. | Thomas Blsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann |
| 2020 | String Indexing with Compressed Patterns. | Philip Bille, Inge Li Grtz, Teresa Anna Steiner |
| 2020 | Observation and Distinction. Representing Information in Infinite Games. | Dietmar Berwanger, Laurent Doyen |
| 2020 | On Covering Segments with Unit Intervals. | Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj |
| 2020 | Information Distance Revisited. | Bruno Bauwens |
| 2020 | Domino Problem Under Horizontal Constraints. | Nathalie Aubrun, Julien Esnay, Mathieu Sablik |
| 2020 | Improved Bounds on Fourier Entropy and Min-Entropy. | Srinivasan Arunachalam, Sourav Chakraborty, Michal Kouck, Nitin Saurabh, Ronald de Wolf |
| 2020 | Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards. | Marcelo Arenas, Juan L. Reutter, Etienne Toussaint, Martn Ugarte, Francisco Jos Vial Prado, Domagoj Vrgoc |