| 2021 | 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Saarbrücken, Germany (Virtual Conference), March 16-19, 2021 Markus Bläser, Benjamin Monmege |
| 2021 | 6-Uniform Maker-Breaker Game Is PSPACE-Complete. Md Lutfar Rahman, Thomas Watson |
| 2021 | A Characterization of Wreath Products Where Knapsack Is Decidable. Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche |
| 2021 | A Faster Algorithm for Finding Tarski Fixed Points. John Fearnley, Rahul Savani |
| 2021 | A Framework of Quantum Strong Exponential-Time Hypotheses. Harry Buhrman, Subhasree Patro, Florian Speelman |
| 2021 | A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. Marcin Bienkowski, Björn Feldkord, Pawel Schmidt |
| 2021 | A Ramsey Theorem for Finite Monoids. Ismaël Jecker |
| 2021 | A Unified Framework of Quantum Walk Search. Simon Apers, András Gilyén, Stacey Jeffery |
| 2021 | Absorbing Patterns in BST-Like Expression-Trees. Florent Koechlin, Pablo Rotondo |
| 2021 | Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means. Anna Arutyunova, Melanie Schmidt |
| 2021 | An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs. Andreas Björklund |
| 2021 | An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2021 | An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs. Meike Neuwohner |
| 2021 | An Improved Sketching Algorithm for Edit Distance. Ce Jin, Jelani Nelson, Kewen Wu |
| 2021 | Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. Jugal Garg, Edin Husic, László A. Végh |
| 2021 | Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. Joshua A. Grochow, Youming Qiao, Gang Tang |
| 2021 | Barrington Plays Cards: The Complexity of Card-Based Protocols. Pavel Dvorák, Michal Koucký |
| 2021 | Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. Corentin Barloy, Lorenzo Clemente |
| 2021 | Binary Matrix Completion Under Diameter Constraints. Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
| 2021 | Church Synthesis on Register Automata over Linearly Ordered Data Domains. Léo Exibard, Emmanuel Filiot, Ayrat Khalimov |
| 2021 | Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. Shaohua Li, Marcin Pilipczuk, Manuel Sorge |
| 2021 | Complexity of the List Homomorphism Problem in Hereditary Graph Classes. Karolina Okrasa, Pawel Rzazewski |
| 2021 | Digraph Coloring and Distance to Acyclicity. Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
| 2021 | Distance Computations in the Hybrid Network Model via Oracle Simulations. Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin |
| 2021 | Diverse Collections in Matroids and Graphs. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2021 | Efficiently Testing Simon's Congruence. Pawel Gawrychowski, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer |
| 2021 | Exploiting Dense Structures in Parameterized Complexity. William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2021 | Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard. Daniel Gibney, Sharma V. Thankachan |
| 2021 | Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. Marta Piecyk, Pawel Rzazewski |
| 2021 | First-Order Transductions of Graphs (Invited Talk). Patrice Ossona de Mendez |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2021 | Geometric Cover with Outliers Removal. Zhengyang Guo, Yi Li |
| 2021 | Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. Jacob Holm, Eva Rotenberg |
| 2021 | Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen |
| 2021 | Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio. Édouard Bonnet |
| 2021 | Inference and Mutual Information on Random Factor Graphs. Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch |
| 2021 | Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. Haim Kaplan, Jay Tenenbaum |
| 2021 | Lower Bounds for Graph-Walking Automata. Olga Martynova, Alexander Okhotin |
| 2021 | On Euclidean Steiner (1+ε)-Spanners. Sujoy Bhore, Csaba D. Tóth |
| 2021 | On the Fluted Fragment (Invited Talk). Lidia Tendera |
| 2021 | One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida |
| 2021 | Online Simple Knapsack with Reservation Costs. Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith |
| 2021 | Optimization, Complexity and Invariant Theory (Invited Talk). Peter Bürgisser |
| 2021 | Parameterised Counting in Logspace. Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao |
| 2021 | Quantum Approximate Counting with Nonadaptive Grover Iterations. Ramgopal Venkateswaran, Ryan O'Donnell |
| 2021 | Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete. Stefan Göller, Mathieu Hilaire |
| 2021 | Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le |
| 2021 | Resolution with Symmetry Rule Applied to Linear Equations. Pascal Schweitzer, Constantin Seebach |
| 2021 | Rice-Like Theorems for Automata Networks. Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier |
| 2021 | Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima |
| 2021 | Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. Timothy M. Chan, Saladi Rahul |
| 2021 | Solving One Variable Word Equations in the Free Group in Cubic Time. Robert Ferens, Artur Jez |
| 2021 | Spectrum Preserving Short Cycle Removal on Regular Graphs. Pedro Paredes |
| 2021 | Subgroup Membership in GL(2, Z). Markus Lohrey |
| 2021 | Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case. Libor Barto, Diego Battistelli, Kevin M. Berg |
| 2021 | Synchronizing Strongly Connected Partial DFAs. Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula |
| 2021 | The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. Ulrich A. Brodowsky, Stefan Hougardy |
| 2021 | The Complexity of the Distributed Constraint Satisfaction Problem. Silvia Butti, Victor Dalmau |
| 2021 | The Edit Distance to k-Subsequence Universality. Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer |
| 2021 | Tight Approximation Guarantees for Concave Coverage Problems. Siddharth Barman, Omar Fawzi, Paul Fermé |
| 2021 | b-Coloring Parameterized by Clique-Width. Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |