STACS

Keyphrases

Publications

2023

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

volume 254, 2023

40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany. STACS 254 (2023)