default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID41st STACS 2024: Clermont-Ferrand, France
- Olaf Beyersdorff
, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov:
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France. LIPIcs 289, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-311-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Igor C. Oliveira:
Polynomial-Time Pseudodeterministic Constructions (Invited Talk). 1:1-1:1 - Sofya Raskhodnikova:
The Role of Local Algorithms in Privacy (Invited Talk). 2:1-2:1 - Szymon Torunczyk:
Structurally Tractable Graph Classes (Invited Talk). 3:1-3:1 - Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski:
Max Weight Independent Set in Sparse Graphs with No Long Claws. 4:1-4:15 - C. Aiswarya, Soumodev Mal, Prakash Saivasan:
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers. 5:1-5:20 - Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On a Hierarchy of Spectral Invariants for Graphs. 6:1-6:18 - Jakub Balabán, Robert Ganian, Mathis Rocton:
Computing Twin-Width Parameterized by the Feedback Edge Number. 7:1-7:19 - Max Bannach, Florian Andreas Marwitz, Till Tantau:
Faster Graph Algorithms Through DAG Compression. 8:1-8:18 - Omkar Baraskar, Agrim Dewan, Chandan Saha:
Testing Equivalence to Design Polynomials. 9:1-9:22 - 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. 10:1-10:19 - Christoph Berkholz, Stefan Mengel, Hermann Wilhelm:
A Characterization of Efficiently Compilable Constraint Languages. 11:1-11:19 - Christoph Berkholz, Dietrich Kuske, Christian Schwarz:
Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form. 12:1-12:17 - Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. 13:1-13:12 - Marcin Bienkowski, Stefan Schmid:
A Subquadratic Bound for Online Bisection. 14:1-14:18 - Marcin Bienkowski, Guy Even:
An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. 15:1-15:19 - 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. 16:1-16:21 - Nicolás Bitar:
Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability. 17:1-17:18 - Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith:
Removable Online Knapsack and Advice. 18:1-18:17 - Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke:
The Complexity of Homomorphism Reconstructibility. 19:1-19:20 - Olivier Bournez, Riccardo Gozzi:
Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite. 20:1-20:19 - Nicolas Bousquet, Laurent Feuilloley, Sébastien Zeitoun:
Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters. 21:1-21:18 - Geoffroy Caillat-Grenier, Andrei E. Romashchenko:
Spectral Approach to the Communication Complexity of Multi-Party Key Agreement. 22:1-22:19 - Deeparnab Chakrabarty, Luc Côté, Ankita Sarkar:
Fault-tolerant k-Supplier with Outliers. 23:1-23:19 - Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching Under Edit Distance. 24:1-24:22 - Tameem Choudhury, Karteek Sreenivasaiah:
Depth-3 Circuit Lower Bounds for k-OV. 25:1-25:17 - Nicola Cotumaccio:
A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression. 26:1-26:19 - Julian D'Costa, Joël Ouaknine, James Worrell:
Nonnegativity Problems for Matrix Semigroups. 27:1-27:16 - Jack Dippel, Adrian Vetta:
One n Remains to Settle the Tree Conjecture. 28:1-28:16 - Andrei Draghici, Christoph Haase, Florin Manea:
Semënov Arithmetic, Affine {VASS}, and String Constraints. 29:1-29:19 - Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Fixed-Parameter Debordering of Waring Rank. 30:1-30:15 - 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. 31:1-31:16 - Franziska Eberle:
O(1/ε) Is the Answer in Online Weighted Throughput Maximization. 32:1-32:15 - Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf:
On the Exact Matching Problem in Dense Graphs. 33:1-33:17 - Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner:
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. 34:1-34:19 - Janosch Fuchs, Philip Whittington:
The 2-Attractor Problem Is NP-Complete. 35:1-35:13 - Moses Ganardi, Irmak Saglam, Georg Zetzsche:
Directed Regular and Context-Free Languages. 36:1-36:20 - Matthias Gehnen, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Bounded Predictions. 37:1-37:20 - Stefan Göller, Nathan Grosshans:
The AC⁰-Complexity of Visibly Pushdown Languages. 38:1-38:18 - Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye:
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. 39:1-39:19 - David G. Harris, N. S. Narayanaswamy:
A Faster Algorithm for Vertex Cover Parameterized by Solution Size. 40:1-40:18 - S. Hitarth, George Kenison, Laura Kovács, Anton Varonka:
Linear Loop Synthesis for Quadratic Invariants. 41:1-41:18 - Martin Hoefer, Carmine Ventre, Lisa Wilhelmi:
Algorithms for Claims Trading. 42:1-42:17 - Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee, Yutong Yang:
A Faster Algorithm for Constructing the Frequency Difference Consensus Tree. 43:1-43:17 - Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo:
Decremental Sensitivity Oracles for Covering and Packing Minors. 44:1-44:19 - Piotr Kawalek, Michael Kompatscher, Jacek Krzaczkowski:
Circuit Equivalence in 2-Nilpotent Algebras. 45:1-45:17 - Michael Kompatscher:
The Subpower Membership Problem of 2-Nilpotent Algebras. 46:1-46:17 - Katarzyna Anna Kowalska, Michal Pilipczuk:
Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane. 47:1-47:16 - Matthias Lanzinger, Igor Razgon:
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. 48:1-48:17 - Ying Liu, Shiteng Chen:
Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs. 49:1-49:18 - James C. A. Main:
Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games. 50:1-50:18 - Andreas Maletti, Andreea-Teodora Nász, Erik Paul:
Weighted HOM-Problem for Nonnegative Integers. 51:1-51:17 - Bodo Manthey, Jesse van Rhijn:
Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering. 52:1-52:16 - Daniel Neuen:
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. 53:1-53:12 - Pierre Ohlmann, Michal Skrzypczak:
Positionality in Σ⁰₂ and a Completeness Result. 54:1-54:18 - Christophe Paul, Evangelos Protopapas:
Tree-Layout Based Graph Classes: Proper Chordal Graphs. 55:1-55:18 - Swagato Sanyal:
Randomized Query Composition and Product Distributions. 56:1-56:19 - Ildikó Schlotter:
Shortest Two Disjoint Paths in Conservative Graphs. 57:1-57:17 - Haitao Wang:
Algorithms for Computing Closest Points for Segments. 58:1-58:17 - Emre Yolcu:
Lower Bounds for Set-Blocked Clauses Proofs. 59:1-59:17
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-10 18:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
