Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Walter Hussak, Amitabh Trehan |
On the Termination of Flooding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France., pp. 17:1-17:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dana Randall |
Statistical Physics and Algorithms (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France., pp. 1:1-1:6, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Colcombet, Sylvain Lombardy |
Unambiguous Separators for Tropical Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France., pp. 32:1-32:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt |
How to Secure Matchings Against Edge Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 38:1-38:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic |
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 35:1-35:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Jeandel, Pascal Vanier |
A Characterization of Subshifts with Computable Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 40:1-40:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee |
Bounding Quantum-Classical Separations for Classes of Nonlocal Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 12:1-12:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Florent Capelli, Stefan Mengel |
Tractable QBF by Knowledge Compilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 18:1-18:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ágnes Cseh, Attila Juhos |
Pairwise Preferences in the Stable Marriage Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 21:1-21:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Shaull Almagor, Joël Ouaknine, James Worrell 0001 |
The Semialgebraic Orbit Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 6:1-6:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Patrick Landwehr, Christof Löding |
Tree Automata with Global Constraints for Infinite Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 47:1-47:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich 0001, Sebastian Siebertz |
Algorithmic Properties of Sparse Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 46:1-46:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Modification to Planarity is Fixed Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 28:1-28:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Enoch Peserico |
Paging with Dynamic Memory Capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 56:1-56:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Derek F. Holt, Markus Lohrey, Saul Schleimer |
Compressed Decision Problems in Hyperbolic Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 37:1-37:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Stasys Jukna, Andrzej Lingas |
Lower Bounds for DeMorgan Circuits of Bounded Negation Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 41:1-41:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Leslie Ann Goldberg |
Computational Complexity and Partition Functions (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 1:1-1:3, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Rolf Niedermeier, Christophe Paul (eds.) |
36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Stefan Kiefer, Corto Mascle |
On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 43:1-43:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Martin Dietzfelbinger, Stefan Walzer |
Constant-Time Retrieval with O(log m) Extra Bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 24:1-24:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Moses Ganardi |
Visibly Pushdown Languages over Sliding Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 29:1-29:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Gleb Posobin, Alexander Shen |
Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 57:1-57:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Shahbaz Khan 0004, Shashank K. Mehta |
Depth First Search in the Semi-streaming Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 42:1-42:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | María Emilia Descotte, Diego Figueira, Santiago Figueira |
Closure Properties of Synchronized Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 22:1-22:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 39:1-39:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | David Auger, Pierre Coucheney, Yann Strozecki |
Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 9:1-9:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Florin Manea, Radoslaw Serafin |
Fast and Longest Rollercoasters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 30:1-30:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | François Le Gall, Harumichi Nishimura, Ansis Rosmanis |
Quantum Advantage for the LOCAL Model in Distributed Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 49:1-49:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Gregor Matl, Stanislav Zivný |
Beyond Boolean Surjective VCSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 52:1-52:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Petra Mutzel |
Algorithmic Data Science (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 3:1-3:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 0:i-0:xvi, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger |
Dispersing Obnoxious Facilities on a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 33:1-33:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Tobias Friedrich 0001 |
From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 5:1-5:9, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Étienne Bamas, Louis Esperet |
Distributed Coloring of Graphs with an Optimal Number of Colors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 10:1-10:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan |
Bipartite Diameter and Other Measures Under Translation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 8:1-8:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos |
Lean Tree-Cut Decompositions: Obstructions and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 32:1-32:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kasper Green Larsen |
Constructive Discrepancy Minimization with Hereditary L2 Guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 48:1-48:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Birx, Yann Disser |
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 15:1-15:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Robert Krauthgamer, Ohad Trabelsi |
The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 45:1-45:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Cook 0001, Turlough Neary |
Average-Case Completeness in Tag Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 20:1-20:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sandeep Sen |
A Unified Approach to Tail Estimates for Randomized Incremental Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 58:1-58:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Eva-Maria C. Hols, Stefan Kratsch |
On Kernelization for Edge Dominating Set under Structural Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 36:1-36:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Anca Muscholl, Gabriele Puppis |
The Many Facets of String Transducers (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 2:1-2:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Erik Paul |
Finite Sequentiality of Unambiguous Max-Plus Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 55:1-55:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Max Bannach, Till Tantau |
On the Descriptive Complexity of Color Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 11:1-11:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu |
Space Lower Bounds for the Signal Detection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 26:1-26:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Dusan Knop, Michal Pilipczuk, Marcin Wrochna |
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 44:1-44:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Chetan Gupta 0002, Vimal Raj Sharma, Raghunath Tewari |
Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 34:1-34:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Spyros Angelopoulos 0001, Christoph Dürr, Shendan Jin |
Best-Of-Two-Worlds Analysis of Online Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 7:1-7:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Julien Destombes, Andrei E. Romashchenko |
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 23:1-23:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora |
Token Sliding on Split Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 13:1-13:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pál András Papp, Roger Wattenhofer |
Stabilization Time in Weighted Minority Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 54:1-54:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý |
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 25:1-25:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan |
Building Strategies into QBF Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 14:1-14:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond |
Enumerating Minimal Dominating Sets in Triangle-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 16:1-16:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Silvia Butti, Stanislav Zivný |
Sparsification of Binary CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 17:1-17:8, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras |
Wealth Inequality and the Price of Anarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 31:1-31:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
Car-Sharing on a Star Network: On-Line Scheduling with k Servers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 51:1-51:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Loff, Sagnik Mukhopadhyay |
Lifting Theorems for Equality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 50:1-50:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Antoine Mottet, Karin Quaas |
The Containment Problem for Unambiguous Register Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 53:1-53:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Watson 0001 |
A ZPPNP[1] Lifting Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 59:1-59:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Parinya Chalermsook, Andreas Schmid 0003, Sumedha Uniyal |
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 19:1-19:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
Progressive Algorithms for Domination and Independence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 27:1-27:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann |
Fine-Grained Complexity Theory (Tutorial). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, pp. 4:1-4:7, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-100-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Barbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu 0001, Paolo Penna |
Optimal Dislocation with Persistent Errors in Subquadratic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 36:1-36:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Isolde Adler, Frederik Harwath |
Property Testing for Bounded Degree Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 6:1-6:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy |
Solving the Rubik's Cube Optimally is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 24:1-24:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný |
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 19:1-19:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Damien Pous |
On the Positive Calculus of Relations with Transitive Closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 3:1-3:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Yasuhiro Takahashi, Seiichiro Tani |
Power of Uninitialized Qubits in Shallow Quantum Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 57:1-57:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | André Nies, Frank Stephan 0001 |
Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 51:1-51:10, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Masashi Kiyomi, Hirotaka Ono 0001, Yota Otachi, Pascal Schweitzer, Jun Tarui |
Space-Efficient Algorithms for Longest Increasing Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 44:1-44:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Denis Kuperberg, Anirban Majumdar 0002 |
Width of Non-deterministic Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 47:1-47:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Olaf Beyersdorff, Joshua Blinkhorn |
Genuine Lower Bounds for QBF Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 12:1-12:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Max Bannach, Till Tantau |
Computing Hitting Set Kernels By AC^0-Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 9:1-9:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Rémy Belmonte, Michael Lampis, Valia Mitsou |
Parameterized (Approximate) Defective Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 10:1-10:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | George Giakkoupis, Philipp Woelfel |
An Improved Bound for Random Binary Search Trees with Concurrent Insertions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 37:1-37:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen |
String Periods in the Order-Preserving Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 38:1-38:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Parys |
Recursion Schemes and the WMSO+U Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 53:1-53:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bienvenu, Rodney G. Downey |
On Low for Speed Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 15:1-15:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Marek Szykula |
Improving the Upper Bound on the Length of the Shortest Reset Word. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 56:1-56:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Hiroshi Hirai 0001, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný |
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 39:1-39:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka |
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 41:1-41:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Davide Bilò, Pascal Lenzner |
On the Tree Conjecture for the Network Creation Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 14:1-14:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Meena Mahajan |
Lower Bound Techniques for QBF Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 2:1-2:8, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Bernadette Charron-Bost, Shlomo Moran |
The Firing Squad Problem Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 20:1-20:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Benedikt Bollig, Marie Fortin, Paul Gastin |
Communicating Finite-State Machines and Two-Variable Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 17:1-17:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Eduard Eiben, Mithilesh Kumar 0001, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz |
Lossy Kernels for Connected Dominating Set on Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 29:1-29:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý 0001 |
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 26:1-26:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche |
Knapsack Problems for Wreath Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 32:1-32:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Akanksha Agrawal 0001, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi |
Erdös-Pósa Property of Obstructions to Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 7:1-7:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Anna Adamaszek, Antonios Antoniadis 0001, Amit Kumar 0001, Tobias Mömke |
Approximating Airports and Railways. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 5:1-5:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 42:1-42:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Michael Blondin, Javier Esparza, Stefan Jaax |
Large Flocks of Small Birds: on the Minimal Size of Population Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 16:1-16:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Taku Onodera, Tetsuo Shibuya |
Succinct Oblivious RAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 52:1-52:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci 0001, Merav Parter, Guido Proietti |
Efficient Oracles and Routing Schemes for Replacement Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 13:1-13:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras |
Automata Theory on Sliding Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 31:1-31:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 0:i-0:xvi, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Hans Ulrich Simon |
On the Containment Problem for Linear Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 55:1-55:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Lukas Fleischer, Manfred Kufleitner |
The Intersection Problem for Finite Monoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 30:1-30:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|