default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th STACS 2019: Berlin, Germany
- Rolf Niedermeier, Christophe Paul:
36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Berlin, Germany, March 13-16, 2019. LIPIcs 126, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-100-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xvi
- Leslie Ann Goldberg
:
Computational Complexity and Partition Functions (Invited Talk). 1:1-1:3 - Anca Muscholl, Gabriele Puppis:
The Many Facets of String Transducers (Invited Talk). 2:1-2:21 - Petra Mutzel:
Algorithmic Data Science (Invited Talk). 3:1-3:15 - Karl Bringmann:
Fine-Grained Complexity Theory (Tutorial). 4:1-4:7 - Tobias Friedrich:
From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). 5:1-5:9 - Shaull Almagor, Joël Ouaknine, James Worrell:
The Semialgebraic Orbit Problem. 6:1-6:15 - Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Best-Of-Two-Worlds Analysis of Online Search. 7:1-7:17 - Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan:
Bipartite Diameter and Other Measures Under Translation. 8:1-8:14 - David Auger, Pierre Coucheney, Yann Strozecki:
Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. 9:1-9:16 - Étienne Bamas, Louis Esperet:
Distributed Coloring of Graphs with an Optimal Number of Colors. 10:1-10:15 - Max Bannach, Till Tantau:
On the Descriptive Complexity of Color Coding. 11:1-11:16 - Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee:
Bounding Quantum-Classical Separations for Classes of Nonlocal Games. 12:1-12:11 - Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. 13:1-13:17 - Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Building Strategies into QBF Proofs. 14:1-14:18 - Alexander Birx, Yann Disser:
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. 15:1-15:17 - Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond:
Enumerating Minimal Dominating Sets in Triangle-Free Graphs. 16:1-16:12 - Silvia Butti, Stanislav Zivný:
Sparsification of Binary CSPs. 17:1-17:8 - Florent Capelli, Stefan Mengel:
Tractable QBF by Knowledge Compilation. 18:1-18:16 - Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal:
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. 19:1-19:14 - Matthew Cook, Turlough Neary:
Average-Case Completeness in Tag Systems. 20:1-20:17 - Ágnes Cseh, Attila Juhos:
Pairwise Preferences in the Stable Marriage Problem. 21:1-21:16 - María Emilia Descotte, Diego Figueira, Santiago Figueira:
Closure Properties of Synchronized Relations. 22:1-22:17 - Julien Destombes, Andrei E. Romashchenko:
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts. 23:1-23:17 - Martin Dietzfelbinger, Stefan Walzer:
Constant-Time Retrieval with O(log m) Extra Bits. 24:1-24:16 - Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý:
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. 25:1-25:17 - Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
Space Lower Bounds for the Signal Detection Problem. 26:1-26:13 - Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Progressive Algorithms for Domination and Independence. 27:1-27:16 - Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Modification to Planarity is Fixed Parameter Tractable. 28:1-28:17 - Moses Ganardi:
Visibly Pushdown Languages over Sliding Windows. 29:1-29:17 - Pawel Gawrychowski, Florin Manea, Radoslaw Serafin:
Fast and Longest Rollercoasters. 30:1-30:17 - Kurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras:
Wealth Inequality and the Price of Anarchy. 31:1-31:16 - Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Lean Tree-Cut Decompositions: Obstructions and Algorithms. 32:1-32:14 - Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing Obnoxious Facilities on a Graph. 33:1-33:11 - Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari:
Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. 34:1-34:13 - Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic:
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. 35:1-35:17 - Eva-Maria C. Hols, Stefan Kratsch:
On Kernelization for Edge Dominating Set under Structural Parameters. 36:1-36:18 - Derek F. Holt, Markus Lohrey, Saul Schleimer:
Compressed Decision Problems in Hyperbolic Groups. 37:1-37:16 - Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings Against Edge Failures. 38:1-38:16 - Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen:
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. 39:1-39:18 - Emmanuel Jeandel, Pascal Vanier:
A Characterization of Subshifts with Computable Language. 40:1-40:16 - Stasys Jukna, Andrzej Lingas:
Lower Bounds for DeMorgan Circuits of Bounded Negation Width. 41:1-41:17 - Shahbaz Khan, Shashank K. Mehta:
Depth First Search in the Semi-streaming Model. 42:1-42:16 - Stefan Kiefer, Corto Mascle:
On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. 43:1-43:13 - Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. 44:1-44:15 - Robert Krauthgamer, Ohad Trabelsi:
The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. 45:1-45:15 - Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Algorithmic Properties of Sparse Digraphs. 46:1-46:20 - Patrick Landwehr, Christof Löding:
Tree Automata with Global Constraints for Infinite Trees. 47:1-47:15 - Kasper Green Larsen:
Constructive Discrepancy Minimization with Hereditary L2 Guarantees. 48:1-48:13 - François Le Gall, Harumichi Nishimura, Ansis Rosmanis:
Quantum Advantage for the LOCAL Model in Distributed Computing. 49:1-49:14 - Bruno Loff, Sagnik Mukhopadhyay:
Lifting Theorems for Equality. 50:1-50:19 - Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing on a Star Network: On-Line Scheduling with k Servers. 51:1-51:14 - Gregor Matl, Stanislav Zivný:
Beyond Boolean Surjective VCSPs. 52:1-52:15 - Antoine Mottet, Karin Quaas:
The Containment Problem for Unambiguous Register Automata. 53:1-53:15 - Pál András Papp, Roger Wattenhofer:
Stabilization Time in Weighted Minority Processes. 54:1-54:15 - Erik Paul:
Finite Sequentiality of Unambiguous Max-Plus Tree Automata. 55:1-55:17 - Enoch Peserico:
Paging with Dynamic Memory Capacity. 56:1-56:18 - Gleb Posobin, Alexander Shen:
Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension. 57:1-57:14 - Sandeep Sen:
A Unified Approach to Tail Estimates for Randomized Incremental Construction. 58:1-58:16 - Thomas Watson:
A ZPPNP[1] Lifting Theorem. 59:1-59:16
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-11-26 07:53 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:
