Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Patrice Ossona de Mendez |
First-Order Transductions of Graphs (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 2:1-2:7, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Guilhem Gamard, Pierre Guillon 0001, Kévin Perrot, Guillaume Theyssier |
Rice-Like Theorems for Automata Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 32:1-32:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
Digraph Coloring and Distance to Acyclicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 41:1-41:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi |
Exploiting Dense Structures in Parameterized Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 50:1-50:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Jugal Garg, Edin Husic, László A. Végh |
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 33:1-33:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin |
Distance Computations in the Hybrid Network Model via Oracle Simulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 21:1-21:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ce Jin 0001, Jelani Nelson, Kewen Wu 0001 |
An Improved Sketching Algorithm for Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 45:1-45:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Simon Apers, András Gilyén, Stacey Jeffery |
A Unified Framework of Quantum Walk Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 6:1-6:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith |
Online Simple Knapsack with Reservation Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 16:1-16:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ulrich A. Brodowsky, Stefan Hougardy |
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 18:1-18:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Markus Lohrey |
Subgroup Membership in GL(2, Z). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 51:1-51:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, Saladi Rahul |
Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 22:1-22:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida |
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 23:1-23:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Sujoy Bhore, Csaba D. Tóth |
On Euclidean Steiner (1+ε)-Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 13:1-13:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Robert Ferens, Artur Jez |
Solving One Variable Word Equations in the Free Group in Cubic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 30:1-30:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Göller, Mathieu Hilaire |
Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 36:1-36:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Shaohua Li 0005, Marcin Pilipczuk, Manuel Sorge |
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 49:1-49:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Édouard Bonnet |
Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 17:1-17:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Harry Buhrman, Subhasree Patro, Florian Speelman |
A Framework of Quantum Strong Exponential-Time Hypotheses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 19:1-19:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Olga Martynova 0001, Alexander Okhotin |
Lower Bounds for Graph-Walking Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 52:1-52:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Corentin Barloy, Lorenzo Clemente |
Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 8:1-8:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Peter Bürgisser |
Optimization, Complexity and Invariant Theory (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 1:1-1:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Ramgopal Venkateswaran, Ryan O'Donnell |
Quantum Approximate Counting with Nonadaptive Grover Iterations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 59:1-59:12, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula |
Synchronizing Strongly Connected Partial DFAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 12:1-12:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Gibney, Sharma V. Thankachan |
Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 35:1-35:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer |
The Edit Distance to k-Subsequence Universality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 25:1-25:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Markus Bläser, Benjamin Monmege (eds.) |
38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1 The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
1 | Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche |
A Characterization of Wreath Products Where Knapsack Is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 11:1-11:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le |
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 37:1-37:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Florent Koechlin, Pablo Rotondo |
Absorbing Patterns in BST-Like Expression-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 48:1-48:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |
b-Coloring Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 43:1-43:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Md Lutfar Rahman, Thomas Watson 0001 |
6-Uniform Maker-Breaker Game Is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 57:1-57:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Lidia Tendera |
On the Fluted Fragment (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 3:1-3:1, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | John Fearnley, Rahul Savani |
A Faster Algorithm for Finding Tarski Fixed Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 29:1-29:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Anselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao |
Parameterised Counting in Logspace. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 40:1-40:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Joshua A. Grochow, Youming Qiao, Gang Tang |
Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 38:1-38:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001 |
Diverse Collections in Matroids and Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 31:1-31:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
Binary Matrix Completion Under Diameter Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 47:1-47:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Pedro Paredes 0002 |
Spectrum Preserving Short Cycle Removal on Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 55:1-55:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Karolina Okrasa, Pawel Rzazewski |
Complexity of the List Homomorphism Problem in Hereditary Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 54:1-54:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Pavel Dvorák, Michal Koucký 0001 |
Barrington Plays Cards: The Complexity of Card-Based Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 26:1-26:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj |
On Covering Segments with Unit Intervals. ![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. 13:1-13:17, 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 | Sevag Gharibian, Stephen Piddock, Justin Yirka |
Oracle Complexity Classes and Local Measurements on Physical Hamiltonians. ![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. 20:1-20:37, 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 | Dietmar Berwanger, Laurent Doyen 0001 |
Observation and Distinction. Representing Information in Infinite Games. ![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. 48:1-48:17, 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 | Susanne Albers, Maximilian Janke |
New Bounds for Randomized List Update in the Paid Exchange Model. ![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. 12:1-12:17, 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 | Yusuke Kobayashi 0001 |
An FPT Algorithm for Minimum Additive Spanner Problem. ![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. 11:1-11:16, 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 | Olivier Bournez |
Computability, Complexity and Programming with Ordinary Differential Equations (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. 3:1-3: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 | Andrés Cristi, Andreas Wiese |
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. ![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. 44:1-44:14, 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 | Martin Grohe |
Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (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. 2:1-2:1, 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 | Xiang Huang 0001, Jack H. Lutz, Elvira Mayordomo, Donald M. Stull |
Asymptotic Divergences and Strong Dichotomy. ![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. 51:1-51:15, 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 | Stefan Kratsch, Florian Nelles |
Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths. ![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. 38:1-38:15, 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 | Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai |
Streaming Complexity of Spanning Tree Computation. ![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. 34:1-34:19, 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 | Manuel Lafond, Binhai Zhu, Peng Zou |
The Tandem Duplication Distance Is NP-Hard. ![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. 15:1-15:15, 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 | Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell 0001 |
How Fast Can You Escape a Compact Polytope? ![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. 49:1-49:11, 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 | Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax |
Succinct Population Protocols for Presburger Arithmetic. ![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. 40:1-40:15, 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 | S. Akshay 0001, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas 0001 |
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. ![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. 37:1-37:18, 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 Bläsius, Philipp Fischbeck, Tobias Friedrich 0001, Maximilian Katzmann |
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. ![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. 25:1-25:14, 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 | Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa |
Shortest Reconfiguration of Colorings Under Kempe Changes. ![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. 35:1-35:14, 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 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![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. 0:1-0:12, 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 | Marcelo Arenas, Juan L. Reutter, Etienne Toussaint, Martín Ugarte, Francisco José Vial Prado, Domagoj Vrgoc |
Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards. ![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. 54:1-54:16, 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 | Mitsuru Funakoshi, Julian Pape-Lange |
Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements. ![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. 30:1-30:16, 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 | Titus Dose, Christian Glaßer |
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. ![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. 9:1-9:18, 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 | Mirmahdi Rahgoshay, Mohammad R. Salavatipour |
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. ![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. 33:1-33:14, 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 | Bruno Bauwens |
Information Distance Revisited. ![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. 46:1-46:14, 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 | Marten Maack, Klaus Jansen |
Inapproximability Results for Scheduling with Interval and Resource Restrictions. ![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. 5:1-5:18, 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 | Jan Philipp Wächter, Armin Weiß |
An Automaton Group with PSPACE-Complete Word Problem. ![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. 6:1-6:17, 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 | Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle |
Typical Sequences Revisited - Computing Width Parameters of Graphs. ![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. 57:1-57:16, 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 | George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche |
Computing Maximum Matchings in Temporal Graphs. ![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. 27:1-27:14, 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 | Marius Zimand |
Secret Key Agreement from Correlated Data, with No Prior Information. ![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. 21:1-21:12, 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 | Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. ![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. 36:1-36:14, 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 | Srinivasan Arunachalam, Sourav Chakraborty 0001, Michal Koucký 0001, Nitin Saurabh, Ronald de Wolf |
Improved Bounds on Fourier Entropy and Min-Entropy. ![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. 45:1-45:19, 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 | Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre |
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. ![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. 24:1-24:17, 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 | Lech Duraj |
A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. ![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. 41:1-41:18, 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 | Christophe Paul, Markus Bläser (eds.) |
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
1 | Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes 0002 |
The SDP Value for Random Two-Eigenvalue CSPs. ![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. 50:1-50:45, 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 | Taisuke Izumi, François Le Gall, Frédéric Magniez |
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. ![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. 23:1-23: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 | Suryajith Chillara |
On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. ![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. 47:1-47:16, 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 | André Nies, Frank Stephan 0001 |
Randomness and Initial Segment Complexity for Probability Measures. ![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. 55:1-55:14, 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 | Nikhil Vyas 0001, R. Ryan Williams |
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. ![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. 59:1-59:17, 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 | Jacobo Torán, Florian Wörz |
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. ![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. 60:1-60:18, 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 | Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer |
Maximum Matchings in Geometric Intersection Graphs. ![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. 31:1-31:17, 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 | Jakub Gajarský, Stephan Kreutzer |
Computing Shrub-Depth Decompositions. ![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. 56:1-56:17, 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 | Monika Henzinger, Pan Peng 0001 |
Constant-Time Dynamic (Δ+1)-Coloring. ![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. 53:1-53:18, 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 | Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula |
Existential Length Universality. ![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. 16:1-16:14, 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 | Michal Ganczorz |
Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before. ![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. 22:1-22:29, 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 | Wim Martens, Matthias Niewerth, Tina Trautner |
A Trichotomy for Regular Trail Queries. ![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. 7:1-7:16, 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 | Falko Hegerfeld, Stefan Kratsch |
Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space. ![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. 29:1-29:16, 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 | Philip Bille, Inge Li Gørtz, Teresa Anna Steiner |
String Indexing with Compressed Patterns. ![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. 10:1-10: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 | Andrés Cristi, Mathieu Mari, Andreas Wiese |
Fixed-Parameter Algorithms for Unsplittable Flow Cover. ![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. 42:1-42:17, 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 | Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky 0001 |
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. ![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. 43:1-43:18, 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 | S. M. Dhannya, N. S. Narayanaswamy |
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs. ![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. 52:1-52:16, 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 | Nathalie Aubrun, Julien Esnay, Mathieu Sablik |
Domino Problem Under Horizontal Constraints. ![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. 26:1-26:15, 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 | Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström |
Parameterized Pre-Coloring Extension and List Coloring Problems. ![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. 19:1-19:18, 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 | Brieuc Guinard, Amos Korman |
Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. ![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. 28:1-28:14, 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 | Antonin Callard, Mathieu Hoyrup |
Descriptive Complexity on Non-Polish Spaces. ![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. 8:1-8:16, 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 | Jarkko Kari, Etienne Moutot |
Decidability and Periodicity of Low Complexity Tilings. ![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. 14:1-14:12, 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 | Martin C. Cooper, Simon de Givry, Thomas Schiex |
Graphical Models: Queries, Complexity, Algorithms (Tutorial). ![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. 4:1-4:22, 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 | Bartlomiej Dudek 0001, Pawel Gawrychowski, Tatiana Starikovskaya |
Generalised Pattern Matching Revisited. ![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. 18:1-18:18, 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 | Michal Wrona |
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. ![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. 39:1-39:16, 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 | Pierre Aboulker, Édouard Bonnet, Eun Jung Kim 0002, Florian Sikora |
Grundy Coloring & Friends, Half-Graphs, Bicliques. ![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. 58:1-58:18, 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 |
|