LIPIcs, Volume 254, STACS 2023

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