| 2019 | 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Berlin, Germany, March 13-16, 2019 Rolf Niedermeier, Christophe Paul |
| 2019 | A Characterization of Subshifts with Computable Language. Emmanuel Jeandel, Pascal Vanier |
| 2019 | A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen |
| 2019 | A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal |
| 2019 | A Unified Approach to Tail Estimates for Randomized Incremental Construction. Sandeep Sen |
| 2019 | A ZPP Thomas Watson |
| 2019 | Algorithmic Data Science (Invited Talk). Petra Mutzel |
| 2019 | Algorithmic Properties of Sparse Digraphs. Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz |
| 2019 | Average-Case Completeness in Tag Systems. Matthew Cook, Turlough Neary |
| 2019 | Best-Of-Two-Worlds Analysis of Online Search. Spyros Angelopoulos, Christoph Dürr, Shendan Jin |
| 2019 | Beyond Boolean Surjective VCSPs. Gregor Matl, Stanislav Zivný |
| 2019 | Bipartite Diameter and Other Measures Under Translation. Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan |
| 2019 | Bounding Quantum-Classical Separations for Classes of Nonlocal Games. Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee |
| 2019 | Building Strategies into QBF Proofs. Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan |
| 2019 | Car-Sharing on a Star Network: On-Line Scheduling with k Servers. Kelin Luo, Thomas Erlebach, Yinfeng Xu |
| 2019 | Closure Properties of Synchronized Relations. María Emilia Descotte, Diego Figueira, Santiago Figueira |
| 2019 | Complexity of the Steiner Network Problem with Respect to the Number of Terminals. Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý |
| 2019 | Compressed Decision Problems in Hyperbolic Groups. Derek F. Holt, Markus Lohrey, Saul Schleimer |
| 2019 | Computational Complexity and Partition Functions (Invited Talk). Leslie Ann Goldberg |
| 2019 | Constant-Time Retrieval with O(log m) Extra Bits. Martin Dietzfelbinger, Stefan Walzer |
| 2019 | Constructive Discrepancy Minimization with Hereditary L2 Guarantees. Kasper Green Larsen |
| 2019 | Depth First Search in the Semi-streaming Model. Shahbaz Khan, Shashank K. Mehta |
| 2019 | Dispersing Obnoxious Facilities on a Graph. Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger |
| 2019 | Distributed Coloring of Graphs with an Optimal Number of Colors. Étienne Bamas, Louis Esperet |
| 2019 | Dominating Sets and Connected Dominating Sets in Dynamic Graphs. Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic |
| 2019 | Enumerating Minimal Dominating Sets in Triangle-Free Graphs. Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond |
| 2019 | Fast and Longest Rollercoasters. Pawel Gawrychowski, Florin Manea, Radoslaw Serafin |
| 2019 | Fine-Grained Complexity Theory (Tutorial). Karl Bringmann |
| 2019 | Finite Sequentiality of Unambiguous Max-Plus Tree Automata. Erik Paul |
| 2019 | From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). Tobias Friedrich |
| 2019 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2019 | How to Secure Matchings Against Edge Failures. Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt |
| 2019 | Lean Tree-Cut Decompositions: Obstructions and Algorithms. Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos |
| 2019 | Lifting Theorems for Equality. Bruno Loff, Sagnik Mukhopadhyay |
| 2019 | Lower Bounds for DeMorgan Circuits of Bounded Negation Width. Stasys Jukna, Andrzej Lingas |
| 2019 | Modification to Planarity is Fixed Parameter Tractable. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2019 | On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. Stefan Kiefer, Corto Mascle |
| 2019 | On Kernelization for Edge Dominating Set under Structural Parameters. Eva-Maria C. Hols, Stefan Kratsch |
| 2019 | On the Descriptive Complexity of Color Coding. Max Bannach, Till Tantau |
| 2019 | Paging with Dynamic Memory Capacity. Enoch Peserico |
| 2019 | Pairwise Preferences in the Stable Marriage Problem. Ágnes Cseh, Attila Juhos |
| 2019 | Progressive Algorithms for Domination and Independence. Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2019 | Quantum Advantage for the LOCAL Model in Distributed Computing. François Le Gall, Harumichi Nishimura, Ansis Rosmanis |
| 2019 | Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension. Gleb Posobin, Alexander Shen |
| 2019 | Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari |
| 2019 | Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts. Julien Destombes, Andrei Romashchenko |
| 2019 | Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. David Auger, Pierre Coucheney, Yann Strozecki |
| 2019 | Space Lower Bounds for the Signal Detection Problem. Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu |
| 2019 | Sparsification of Binary CSPs. Silvia Butti, Stanislav Zivný |
| 2019 | Stabilization Time in Weighted Minority Processes. Pál András Papp, Roger Wattenhofer |
| 2019 | The Containment Problem for Unambiguous Register Automata. Antoine Mottet, Karin Quaas |
| 2019 | The Many Facets of String Transducers (Invited Talk). Anca Muscholl, Gabriele Puppis |
| 2019 | The Semialgebraic Orbit Problem. Shaull Almagor, Joël Ouaknine, James Worrell |
| 2019 | The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. Robert Krauthgamer, Ohad Trabelsi |
| 2019 | Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. Alexander Birx, Yann Disser |
| 2019 | Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. Dusan Knop, Michal Pilipczuk, Marcin Wrochna |
| 2019 | Token Sliding on Split Graphs. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora |
| 2019 | Tractable QBF by Knowledge Compilation. Florent Capelli, Stefan Mengel |
| 2019 | Tree Automata with Global Constraints for Infinite Trees. Patrick Landwehr, Christof Löding |
| 2019 | Visibly Pushdown Languages over Sliding Windows. Moses Ganardi |
| 2019 | Wealth Inequality and the Price of Anarchy. Kurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras |