| 2022 | 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, Marseille, France (Virtual Conference), March 15-18, 2022 Petra Berenbrink, Benjamin Monmege |
| 2022 | A 10-Approximation of the π/2-MST. Ahmad Biniaz, Majid Daliri, Amir Hossein Moradpour |
| 2022 | A Relativization Perspective on Meta-Complexity. Hanlin Ren, Rahul Santhanam |
| 2022 | A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die. Éric Goubault, Jérémy Ledent, Sergio Rajsbaum |
| 2022 | Analyzing XOR-Forrelation Through Stochastic Calculus. Xinyu Wu |
| 2022 | Approximability of Robust Network Design: The Directed Case. Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay |
| 2022 | Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths. Yung-Chung Chiu, Hsueh-I Lu |
| 2022 | Cardinality Constrained Scheduling in Online Models. Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder |
| 2022 | Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication. Michael Elkin, Ofer Neiman |
| 2022 | Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs. Patricia Bouyer, Mickael Randour, Pierre Vandenhove |
| 2022 | Classes of Intersection Digraphs with Good Algorithmic Properties. Lars Jaffke, O-joung Kwon, Jan Arne Telle |
| 2022 | Compact Representation for Matrices of Bounded Twin-Width. Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz |
| 2022 | Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer |
| 2022 | Delay-Robust Routes in Temporal Graphs. Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken |
| 2022 | Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin |
| 2022 | Determining a Slater Winner Is Complete for Parallel Access to NP. Michael Lampis |
| 2022 | Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk). Fabian Kuhn |
| 2022 | Detours in Directed Graphs. Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh |
| 2022 | Existential Definability over the Subword Ordering. Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2022 | Extending the Reach of the Point-To-Set Principle. Jack H. Lutz, Neil Lutz, Elvira Mayordomo |
| 2022 | Fairly Popular Matchings and Optimality. Telikepalli Kavitha |
| 2022 | Faster Counting and Sampling Algorithms Using Colorful Decision Oracle. Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
| 2022 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2022 | Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh |
| 2022 | Generalization Guarantees for Data-Driven Mechanism Design (Invited Talk). Maria-Florina Balcan |
| 2022 | High Quality Consistent Digital Curved Rays via Vector Field Rounding. Takeshi Tokuyama, Ryo Yoshimura |
| 2022 | If VNP Is Hard, Then so Are Equations for It. Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse |
| 2022 | Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. Slawomir Lasota |
| 2022 | Improved Quantum Lower and Upper Bounds for Matrix Scaling. Sander Gribling, Harold Nieuwboer |
| 2022 | Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order. Nikolay Bazhenov, Dariusz Kalocinski, Michal Wroclawski |
| 2022 | Isolation Schemes for Problems on Decomposable Graphs. Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki |
| 2022 | Linear Space Data Structures for Finite Groups with Constant Query-Time. Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar |
| 2022 | Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk). Marie Albenque |
| 2022 | Mapping Networks via Parallel kth-Hop Traceroute Queries. Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda |
| 2022 | Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi |
| 2022 | NP-Completeness of Perfect Matching Index of Cubic Graphs. Martin Skoviera, Peter Varsa |
| 2022 | Near-Optimal Algorithms for Point-Line Covering Problems. Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia |
| 2022 | Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum |
| 2022 | On Explicit Constructions of Extremely Depth Robust Graphs. Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee, Jin Young Son |
| 2022 | On Finer Separations Between Subclasses of Read-Once Oblivious ABPs. C. Ramya, Anamay Tengse |
| 2022 | On Robustness for the Skolem and Positivity Problems. S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala |
| 2022 | On Testing Decision Tree. Nader H. Bshouty, Catherine A. Haddad-Zaknoon |
| 2022 | One-To-Two-Player Lifting for Mildly Growing Memory. Alexander Kozachinskiy |
| 2022 | One-Way Communication Complexity and Non-Adaptive Decision Trees. Nikhil S. Mande, Swagato Sanyal, Suhail Sherif |
| 2022 | Online Scheduling on Identical Machines with a Metric State Space. Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita |
| 2022 | Optimal Oracles for Point-To-Set Principles. Donald M. Stull |
| 2022 | Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM). Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Guillaume Theyssier |
| 2022 | Probabilistic vs Deterministic Gamblers. Laurent Bienvenu, Valentino Delle Rose, Tomasz Steifer |
| 2022 | Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
| 2022 | Satisfiability of Circuits and Equations over Finite Malcev Algebras. Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski |
| 2022 | Scheduling with Communication Delay in Near-Linear Time. Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang |
| 2022 | Sharp Indistinguishability Bounds from Non-Uniform Approximations. Christopher Williamson |
| 2022 | Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi |
| 2022 | Star Transposition Gray Codes for Multiset Permutations. Petr Gregor, Torsten Mütze, Arturo Merino |
| 2022 | Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. Pierre Bergé, Guillaume Ducoffe, Michel Habib |
| 2022 | Superlinear Lower Bounds Based on ETH. András Z. Salamon, Michael Wehar |
| 2022 | Symmetry and Quantum Query-To-Communication Simulation. Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf |
| 2022 | The Aperiodic Domino Problem in Higher Dimension. Antonin Callard, Benjamin Hellouin de Menibus |
| 2022 | The Ideal Membership Problem and Abelian Groups. Andrei A. Bulatov, Akbar Rafiey |
| 2022 | The Isomorphism Problem for Plain Groups Is in Σ₃ Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß |
| 2022 | Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi |
| 2022 | Towards Uniform Certification in QBF. Leroy Chew, Friedrich Slivovsky |