default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID43rd STACS 2026: Grenoble, France
- Meena Mahajan
, Florin Manea, Annabelle McIver, Kim Thang Nguyen:
43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026. LIPIcs 364, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2026, ISBN 978-3-95977-412-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xxviii
- Martin Grohe:
Query Languages for Machine-Learning Models (Invited Talk). 1:1-1:18 - Laura Kovács:
Moments in Time: Algebraic Analysis for Solvable Loops (Invited Talk). 2:1-2:2 - Ola Svensson:
Advancements in Online Edge Coloring Algorithms (Invited Talk). 3:1-3:1 - Cezar-Mihail Alexandru, Adithya Diddapur, Magnús M. Halldórsson, Christian Konrad, Kheeran K. Naidu:
Unit Interval Selection in Random Order Streams. 4:1-4:20 - Antoine Amarilli, Mikaël Monet, Paul Raphaël, Sylvain Salvati:
On the Complexity of Language Membership for Probabilistic Words. 5:1-5:21 - Flora Angileri, Andrea Clementi, Emanuele Natale, Michele Salvi, Isabella Ziccardi:
Threshold-Driven Streaming Graph: Expansion and Rumor Spreading. 6:1-6:21 - Antonios Antoniadis, Denise Graafsma, Ruben Hoeksma, Maria Vlasiou:
Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms. 7:1-7:19 - Piotr Bacik, Joël Ouaknine, David Purser, James Worrell:
On the p-adic Skolem Problem. 8:1-8:20 - Corentin Barloy, Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Algebraic Characterizations of Classes of Regular Languages in DynFO. 9:1-9:19 - Julien Baste, Lucas de Meyer, Ugo Giocanti, Étienne Objois, Timothé Picavet:
A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths. 10:1-10:17 - Zylan Benjert, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi:
The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs. 11:1-11:21 - Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein:
Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density. 12:1-12:20 - Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana:
Line Cover and Related Problems. 13:1-13:18 - Leander Besting, Martin Hoefer, Lars Huth:
Computing Tarski Fixed Points in Financial Networks. 14:1-14:18 - Manuel Bodirsky, Zaneta Semanisinová:
The Complexity of Resilience for Digraph Queries. 15:1-15:20 - Sander Borst, Moritz Venzin:
To Buy or Not to Buy: Online Rent-Or-Buy on Node-Weighted Graphs. 16:1-16:16 - Marin Bougeret, Eric Brandwein, Ignasi Sau:
Kernelization Dichotomies for Hitting Minors Under Structural Parameterizations. 17:1-17:19 - Yann Bourreau, Ananth Narayanan, Alexandre Nolin:
Optimal Deterministic Rendezvous in Labeled Lines. 18:1-18:20 - Nicolas Bousquet, Daniel W. Cranston:
A Linear Kernel for Independent Set Reconfiguration in Planar Graphs. 19:1-19:18 - Hauke Brinkop, Hua Chen, Lin Chen, Klaus Jansen, Guochuan Zhang:
Approximation Algorithms for Integer Programming with Resource Augmentation. 20:1-20:20 - Hera Brown, Jakub Konieczny:
Decidability of Extensions of Presburger Arithmetic by Hardy Field Functions. 21:1-21:17 - Andrei A. Bulatov, Amirhossein Kazeminia:
Modular Counting over 3-Element and Conservative Domains. 22:1-22:20 - Marco Carmosino, Ngu Dang, Tim Jackman:
Simple Circuit Extensions for XOR in PTIME. 23:1-23:20 - Justine Cauvi, Nils Morawietz, Laurent Viennot:
Foremost, Fastest, Shortest: Temporal Graph Realization Under Various Path Metrics. 24:1-24:19 - Marek Cerný, Tim Seppelt:
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing. 25:1-25:20 - Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed:
Approximate Cartesian Tree Matching with Substitutions. 26:1-26:21 - George Christodoulou, Elias Koutsoupias, Annamária Kovács, Ioannis Vlachos:
The Communication Complexity of Combinatorial Auctions in Graphs. 27:1-27:20 - Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin, Arina Smirnova:
Conditional Complexity Hardness: Monotone Circuit Size, Matrix Rigidity, and Tensor Rank. 28:1-28:21 - Yoav Danieli:
A Pumping-Like Lemma for Languages over Infinite Alphabets. 29:1-29:19 - Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy:
Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions. 30:1-30:21 - Yann Disser, Georg Loho, Matthew T. Maat, Nils Mosis:
Lower Bounds for Ranking-Based Pivot Rules. 31:1-31:19 - Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlöter:
Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid. 32:1-32:20 - Joseph Dorfer:
Higher Hardness Results for the Reconfiguration of Odd Matchings. 33:1-33:16 - Laurent Doyen, Shibashis Guha:
Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games. 34:1-34:20 - Pavel Dvorák, Bruno Loff, Suhail Sherif:
A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity. 35:1-35:20 - Jonas Ellert, Tomasz Kociumaka:
Time-Optimal Construction of String Synchronizing Sets. 36:1-36:22 - Oskar Fiuk:
Random Models and Guarded Logic. 37:1-37:21 - Sebastian Forster, Gramoz Goranci, Ali Momeni:
Fully Dynamic Spectral Sparsification for Directed Hypergraphs. 38:1-38:20 - Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova:
Planting and MCMC Sampling from the Potts Model. 39:1-39:19 - Florian Galliot, Jonas Sénizergues:
Maker-Maker Games of Rank 4 Are PSPACE-Complete. 40:1-40:17 - Moses Ganardi, Markus Lohrey:
On the Complexity of Computing Strahler Numbers. 41:1-41:22 - Robert Ganian, Mathis Rocton:
Computing Twin-Width via Treedepth and Vertex Integrity. 42:1-42:20 - Matthias Gehnen, Moritz Stocker:
Stealing from the Dragon's Hoard: Online Unbounded Knapsack With Removal. 43:1-43:17 - Konstantinos Georgiou:
Optimal Average Disk-Inspection via Fermat's Principle. 44:1-44:19 - Timo Gervens, Martin Grohe, Louis Härtel, Philipp da Silva Fonseca:
The Complexity of Homomorphism Reconstruction Revisited. 45:1-45:19 - Mikhail Goncharov, Alexander S. Kulikov, Georgie Levtsov:
Smaller Circuits for Bit Addition. 46:1-46:15 - Elena Grigorescu, Alice Moayyedi:
On the Hardness of the One-Sided Code Sparsifier Problem. 47:1-47:10 - Bruno Guillon, Luca Prigioniero, Javad Taheri:
Polynomial Complementation of Nondeterministic Two-Way Finite Automata by 1-Limited Automata. 48:1-48:18 - Rohit Gurjar, Kilian Rothmund, Thomas Thierauf:
2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs. 49:1-49:22 - Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi:
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs. 50:1-50:18 - Niko Hastrich, Kirill Simonov:
Structural Parameterization of Steiner Tree Packing. 51:1-51:18 - Edward A. Hirsch, Ilya Volkovich:
Upper and Lower Bounds for the Linear Ordering Principle. 52:1-52:19 - Florian Hörsch:
Maximum Reachability Orientation of Mixed Graphs. 53:1-53:17 - Stefan Hougardy, Bart Zondervan:
A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm. 54:1-54:17 - Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny:
Testing H-Freeness on Sparse Graphs, the Case of Bounded Expansion. 55:1-55:18 - Klaus Jansen, Felix Ohnesorge:
A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling. 56:1-56:20 - Antoine Joux, Karol Wegrzycki:
Improving Lagarias-Odlyzko Algorithm for Average-Case Subset Sum: Modular Arithmetic Approach. 57:1-57:19 - Andreas Kalavas, Charalampos Platanos, Thanos Tolias:
A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP. 58:1-58:17 - Artem Kaznatcheev, Sofia Vazquez Alferez:
When Is Local Search Both Effective and Efficient? 59:1-59:19 - Stefan Kiefer, Andrew Ryzhikov:
The Asymptotic Size of Finite Irreducible Semigroups of Rational Matrices. 60:1-60:20 - Prajval Koul, Satyadev Nandakumar:
On Effective Banach-Mazur Games and an Application to the Poincaré Recurrence Theorem for Category. 61:1-61:12 - Muhammed Oguzhan Külekci, Mano Prakash Parthasarathi, Rahul Shah, Sharma V. Thankachan:
Relative Compressed Reverse Suffix Array. 62:1-62:21 - Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak:
Generalised Quantifiers Based on Rabin-Mostowski Index. 63:1-63:22 - Slawomir Lasota, Mathieu Lehaut, Julie Parreaux, Radoslaw Piórkowski:
One-Clock Synthesis Problems. 64:1-64:21 - Fabian Lenke, Nico Wittrock, Stefan Milius, Henning Urbat:
Demystifying Codensity Monads via Duality. 65:1-65:20 - Yupan Liu:
Computational Hardness of Estimating Quantum Entropies via Binary Entropy Bounds. 66:1-66:23 - Filip Mazowiecki, Antoni Puch, Daniel Smertnig:
Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata. 67:1-67:21 - Arshia Ataee Naeini, Amir-Parsa Mobed, Masoud Seddighin, Saeed Seddighin:
Dynamic Pattern Matching with Wildcards. 68:1-68:20 - Étienne Objois, Adrian Vladu:
Approximating q → p Norms of Non-Negative Matrices in Nearly-Linear Time. 69:1-69:19 - Priyanshu Pant, Surabhi Chakrabartty, Ranveer Singh:
A Permanental Analog of the Rank-Nullity Theorem for Symmetric Matrices. 70:1-70:12 - Anton Paramonov, Roger Wattenhofer:
Broadcast in Almost Mixing Time. 71:1-71:20 - Christophe Paul, Ignaz Rutter:
Circle Graphs Can Be Recognized in Linear Time. 72:1-72:20 - Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen:
Colouring Probe H-Free Graphs. 73:1-73:20 - Marta Piecyk, Pawel Rzazewski:
List Coloring Ordered Graphs with Forbidden Induced Subgraphs. 74:1-74:17 - Matthew Rayman:
Effective Versions of Strong Measure Zero. 75:1-75:18 - Katarzyna Rybarczyk, Malgorzata Sulkowska:
Modularity of Preferential Attachment Graphs. 76:1-76:19 - Aleksi Saarela:
An Improved Version of Hmelevskii's Theorem on Three-Variable Word Equations. 77:1-77:14 - Roohani Sharma, Michal Wlodarczyk:
Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors. 78:1-78:21 - Mihail Stoian:
Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and More. 79:1-79:19 - Alexander Thumm, Armin Weiß:
Efficient Compression in Semigroups. 80:1-80:20 - Haitao Wang:
Counting Unit Circular Arc Intersections. 81:1-81:18
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 2026-09-02 23:17 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
