STACS

Keyphrases

Publications

2024

Katarzyna Anna Kowalska, Michal Pilipczuk
Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane. STACS (2024)
Franziska Eberle
O(1/ε) Is the Answer in Online Weighted Throughput Maximization. STACS (2024)
Julian D'Costa, Joël Ouaknine, James Worrell
Nonnegativity Problems for Matrix Semigroups. STACS (2024)
Jack Dippel, Adrian Vetta
One n Remains to Settle the Tree Conjecture. STACS (2024)
Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. STACS (2024)
Stefan Göller, Nathan Grosshans
The AC⁰-Complexity of Visibly Pushdown Languages. STACS (2024)
Swagato Sanyal
Randomized Query Composition and Product Distributions. STACS (2024)
Marcin Bienkowski, Guy Even
An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. STACS (2024)
Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski
Max Weight Independent Set in Sparse Graphs with No Long Claws. STACS (2024)
Ying Liu, Shiteng Chen
Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs. STACS (2024)
Emre Yolcu
Lower Bounds for Set-Blocked Clauses Proofs. STACS (2024)
Front Matter, Table of Contents, Preface, Conference Organization. STACS (2024)
Harsh Beohar, Sebastian Gurke, Barbara König, Karla Messing, Jonas Forster, Lutz Schröder, Paul Wild
Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach. STACS (2024)
Pierre Ohlmann, Michal Skrzypczak
Positionality in Σ⁰₂ and a Completeness Result. STACS (2024)
Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke
The Complexity of Homomorphism Reconstructibility. STACS (2024)
Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo
Decremental Sensitivity Oracles for Covering and Packing Minors. STACS (2024)
Igor C. Oliveira
Polynomial-Time Pseudodeterministic Constructions (Invited Talk). STACS (2024)
S. Hitarth, George Kenison, Laura Kovács, Anton Varonka
Linear Loop Synthesis for Quadratic Invariants. STACS (2024)
Jakub Balabán, Robert Ganian, Mathis Rocton
Computing Twin-Width Parameterized by the Feedback Edge Number. STACS (2024)
C. Aiswarya, Soumodev Mal, Prakash Saivasan
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers. STACS (2024)
Ildikó Schlotter
Shortest Two Disjoint Paths in Conservative Graphs. STACS (2024)
Omkar Baraskar, Agrim Dewan, Chandan Saha
Testing Equivalence to Design Polynomials. STACS (2024)
Piotr Kawalek, Michael Kompatscher, Jacek Krzaczkowski
Circuit Equivalence in 2-Nilpotent Algebras. STACS (2024)
Andrei Draghici, Christoph Haase, Florin Manea
Semënov Arithmetic, Affine {VASS}, and String Constraints. STACS (2024)
Marcin Bienkowski, Stefan Schmid
A Subquadratic Bound for Online Bisection. STACS (2024)
Christophe Paul, Evangelos Protopapas
Tree-Layout Based Graph Classes: Proper Chordal Graphs. STACS (2024)
Olivier Bournez, Riccardo Gozzi
Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite. STACS (2024)
Andreas Maletti, Andreea-Teodora Nász, Erik Paul
Weighted HOM-Problem for Nonnegative Integers. STACS (2024)
James C. A. Main
Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games. STACS (2024)
Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar
On the Power of Border Width-2 ABPs over Fields of Characteristic 2. STACS (2024)
Daniel Neuen
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. STACS (2024)
Christoph Berkholz, Dietrich Kuske, Christian Schwarz
Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form. STACS (2024)
Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. STACS (2024)
Martin Hoefer, Carmine Ventre, Lisa Wilhelmi
Algorithms for Claims Trading. STACS (2024)
Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf
On the Exact Matching Problem in Dense Graphs. STACS (2024)
Bodo Manthey, Jesse van Rhijn
Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering. STACS (2024)
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
Fixed-Parameter Debordering of Waring Rank. STACS (2024)
Stéphane Bessy, Stéphan Thomassé, Laurent Viennot
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS (2024)
Szymon Torunczyk
Structurally Tractable Graph Classes (Invited Talk). STACS (2024)
Matthias Lanzinger, Igor Razgon
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. STACS (2024)
Sofya Raskhodnikova
The Role of Local Algorithms in Privacy (Invited Talk). STACS (2024)
Deeparnab Chakrabarty, Luc Côté, Ankita Sarkar
Fault-tolerant k-Supplier with Outliers. STACS (2024)
Max Bannach, Florian Andreas Marwitz, Till Tantau
Faster Graph Algorithms Through DAG Compression. STACS (2024)
Nicolás Bitar
Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability. STACS (2024)
Moses Ganardi, Irmak Saglam, Georg Zetzsche
Directed Regular and Context-Free Languages. STACS (2024)
Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun
Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters. STACS (2024)
Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang
A Faster Algorithm for Constructing the Frequency Difference Consensus Tree. STACS (2024)
Geoffroy Caillat-Grenier, Andrei E. Romashchenko
Spectral Approach to the Communication Complexity of Multi-Party Key Agreement. STACS (2024)
Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith
Removable Online Knapsack and Advice. STACS (2024)

volume 289, 2024

41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France STACS 289 (2024)