| 2023 | 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, Hamburg, Germany, March 7-9, 2023 Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté |
| 2023 | A Brief History of History-Determinism (Invited Talk). Karoliina Lehtinen |
| 2023 | A Regular and Complete Notion of Delay for Streaming String Transducers. Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter |
| 2023 | Amortised Analysis of Dynamic Data Structures (Invited Talk). Eva Rotenberg |
| 2023 | An Algebraic Approach to Vectorial Programs. Charles Paperman, Sylvain Salvati, Claire Soyez-Martin |
| 2023 | An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. Marc Dufay, Claire Mathieu, Hang Zhou |
| 2023 | An 𝒪(3.82 HaoHong Li, Ge Xia |
| 2023 | Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. Georgios Amanatidis, Pieter Kleer |
| 2023 | Approximate Selection with Unreliable Comparisons in Optimal Expected Time. Shengyu Huang, Chih-Hung Liu, Daniel Rutschmann |
| 2023 | Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. Pierre Bergé, Édouard Bonnet, Hugues Déprés, Rémi Watrigant |
| 2023 | Avoidance Games Are PSPACE-Complete. Valentin Gledel, Nacim Oijid |
| 2023 | Barriers for Faster Dimensionality Reduction. Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen |
| 2023 | Counting Temporal Paths. Jessica A. Enright, Kitty Meeks, Hendrik Molter |
| 2023 | Cut Paths and Their Remainder Structure, with Applications. Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli |
| 2023 | Distributed Quantum Interactive Proofs. François Le Gall, Masayuki Miyamoto, Harumichi Nishimura |
| 2023 | Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. Yaniv Sadeh, Haim Kaplan |
| 2023 | Dynamic Data Structures for Parameterized String Problems. Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz |
| 2023 | Dynamic Maintenance of Monotone Dynamic Programs and Applications. Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid |
| 2023 | Enumerating Regular Languages with Bounded Delay. Antoine Amarilli, Mikaël Monet |
| 2023 | Exact Matching: Algorithms and Related Problems. Nicolas El Maalouly |
| 2023 | Extending Merge Resolution to a Family of QBF-Proof Systems. Sravanthi Chede, Anil Shukla |
| 2023 | Finding and Counting Patterns in Sparse Graphs. Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2023 | Gap Preserving Reductions Between Reconfiguration Problems. Naoto Ohsaka |
| 2023 | Geometric Amortization of Enumeration Algorithms. Florent Capelli, Yann Strozecki |
| 2023 | Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. Dror Chawin, Ishay Haviv |
| 2023 | Improved Weighted Matching in the Sliding Window Model. Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad, Kheeran K. Naidu |
| 2023 | Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability. Tomohiro Koana |
| 2023 | Logical Algorithmics: From Theory to Practice (Invited Talk). Moshe Y. Vardi |
| 2023 | Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. Konrad Majewski, Michal Pilipczuk, Marek Sokolowski |
| 2023 | Maximum Matching via Maximal Matching Queries. Christian Konrad, Kheeran K. Naidu, Arun Steward |
| 2023 | New Clocks, Optimal Line Formation and Self-Replication Population Protocols. Leszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak |
| 2023 | Non-Adaptive Proper Learning Polynomials. Nader H. Bshouty |
| 2023 | On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. Suryajith Chillara, Coral Grichener, Amir Shpilka |
| 2023 | On Rational Recursive Sequences. Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk |
| 2023 | On the Multilinear Complexity of Associative Algebras. Markus Bläser, Hendrik Mayer, Devansh Shringi |
| 2023 | One Drop of Non-Determinism in a Random Deterministic Automaton. Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud |
| 2023 | Online Paging with Heterogeneous Cache Slots. Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young |
| 2023 | Packing Odd Walks and Trails in Multiterminal Networks. Maxim Akhmedov, Maxim A. Babenko |
| 2023 | Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. Klaus Heeger, André Nichterlein, Rolf Niedermeier |
| 2023 | Real Numbers Equally Compressible in Every Base. Satyadev Nandakumar, Subin Pulari |
| 2023 | Reconfiguration of Digraph Homomorphisms. Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan |
| 2023 | Reconstructing Words Using Queries on Subwords or Factors. Gwénaël Richomme, Matthieu Rosenfeld |
| 2023 | Regular Separability in Büchi VASS. Pascal Baumann, Roland Meyer, Georg Zetzsche |
| 2023 | Relating Description Complexity to Entropy. Reijo Jaakkola, Antti Kuusisto, Miikka Vilander |
| 2023 | Representation of Short Distances in Structurally Sparse Graphs. Zdenek Dvorák |
| 2023 | Restless Temporal Path Parameterized Above Lower Bounds. Philipp Zschoche |
| 2023 | Semigroup Intersection Problems in the Heisenberg Groups. Ruiwen Dong |
| 2023 | Solving Homogeneous Linear Equations over Polynomial Semirings. Ruiwen Dong |
| 2023 | Strongly Hyperbolic Unit Disk Graphs. Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan |
| 2023 | Sublinear-Time Probabilistic Cellular Automata. Augusto Modanese |
| 2023 | The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term. Erhard Aichinger, Simon Grünbacher |
| 2023 | The Complexity of Translationally Invariant Problems Beyond Ground State Energies. James D. Watson, Johannes Bausch, Sevag Gharibian |
| 2023 | Tight Bounds for Connectivity Problems Parameterized by Cutwidth. Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch |
| 2023 | Tight Bounds for Repeated Balls-Into-Bins. Dimitrios Los, Thomas Sauerwald |
| 2023 | Tight Lower Bounds for Problems Parameterized by Rank-Width. Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof |
| 2023 | Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé |