Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Amir M. Ben-Amram |
Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 514-525, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane |
Space-Time Trade-offs for Stack-Based Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 281-292, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Mark Braverman, Gal Oshri |
Search using queries on indistinguishable items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 610-621, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann |
Improved Bounds for Online Preemptive Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 389-399, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Yngve Villanger |
Searching for better fill-in. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 8-19, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Natacha Portier, Thomas Wilke |
Frontmatter, Table of Contents, Preface, Workshop Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf |
Optimal quantum query bounds for almost all Boolean functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 446-453, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Björklund, Petteri Kaski, Lukasz Kowalik |
Probably Optimal Graph Motifs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 20-31, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Loïck Magnin, Jérémie Roland |
Explicit relation between all lower bound techniques for quantum query complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 434-445, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 353-364, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Watson 0001 |
Advice Lower Bounds for the Dense Model Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 634-645, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Wieslaw Szwast, Lidia Tendera |
FO^2 with one transitive relation is decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 317-328, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Konstantin Kutzkov |
Deterministic algorithms for skewed matrix products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 466-477, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Colcombet, Laure Daviaud |
Approximate comparison of distance automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 574-585, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan 0001, Saket Saurabh 0001, Stefan Szeider |
Backdoors to q-Horn. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 67-79, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Tengyu Ma 0001, Bo Tang 0003, Yajun Wang 0001 |
The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 478-489, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kousha Etessami |
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 1-2, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Natacha Portier, Thomas Wilke |
Author Index. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 646-647, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Hartmut Klauck, Ronald de Wolf |
Fooling One-Sided Quantum Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 424-433, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 92-103, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | György Dósa, Jirí Sgall |
First Fit bin packing: A tight analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 538-549, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Nathanaël François, Frédéric Magniez |
Streaming Complexity of Checking Priority Queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 454-465, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ines Klimann |
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 502-513, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kurt Mehlhorn |
Physarum Computations (Invited talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 5-6, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz 0001, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow |
Algorithms for Designing Pop-Up Cards. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 269-280, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider |
Model Counting for CNF Formulas of Bounded Modular Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 55-66, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
1 | László Babai, Youming Qiao |
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 453-464, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Frederik Harwath, Nicole Schweikardt |
Regular tree languages, cardinality predicates, and addition-invariant FO. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 489-500, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan |
Preemptive and Non-Preemptive Generalized Min Sum Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 465-476, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Marc Thurley |
An Approximation Algorithm for #k-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 78-87, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Christoph Dürr, Thomas Wilke |
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Frédérique Bassino, Julien David, Andrea Sportiello |
Asymptotic enumeration of Minimal Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 88-99, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Ning Chen |
On Computing Pareto Stable Assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 384-395, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Xiaoming Sun 0001, Chengu Wang |
Randomized Communication Complexity for Linear Algebra Problems over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 477-488, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Martin Dietzfelbinger |
On Randomness in Hash Functions (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 25-28, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Carayol, Cyril Nicaud |
Distribution of the number of accessible states in a random deterministic automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 194-205, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Maurice J. Jansen, Rahul Santhanam |
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 519-530, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Emil Feldmann, Luca Foschini 0002 |
Balanced Partitions of Trees and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 100-111, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari |
Improved Bounds for Bipartite Matching on Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 254-265, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Dieter Mitsche, Guillem Perarnau |
On the treewidth and related parameters of random geometric graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 408-419, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | R. Ravi 0001 |
Iterative Methods in Combinatorial Optimization (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 24-24, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Gerth Stølting Brodal, Casper Kejlberg-Rasmussen |
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 112-123, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Andris Ambainis |
Variable time amplitude amplification and quantum algorithms for linear algebra problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 636-647, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001 |
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 278-289, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Göller, Anthony Widjaja Lin |
Concurrency Makes Simple Theories Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 148-159, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Christopher H. Broadbent |
The Limits of Decidability for First Order Logic on CPDA Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 589-600, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Log-supermodular functions, functional clones and counting CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 302-313, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Marcin Mucha |
13/9-approximation for Graphic TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 30-41, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Marcin Kaminski 0001, Dimitrios M. Thilikos |
Contraction checking in graphs on surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 182-193, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Artur Jez |
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 136-147, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | George Giakkoupis, Thomas Sauerwald, He Sun 0001, Philipp Woelfel |
Low Randomness Rumor Spreading via Hashing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 314-325, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Katarzyna E. Paluch 0001, Khaled M. Elbassioni, Anke van Zuylen |
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 501-506, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Kai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher |
Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 124-135, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Carsten Witt |
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 420-431, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Faried Abu Zaid, Erich Grädel, Lukasz Kaiser |
The Field of Reals is not omega-Automatic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 577-588, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Lower Bounds on the Complexity of MSO_1 Model-Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 326-337, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski |
Tying up the loose ends in fully LZW-compressed pattern matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 624-635, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Hervé Fournier, Guillaume Malod, Stefan Mengel |
Monomials in arithmetic circuits: Complete problems in the counting hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 362-373, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Wolfgang Merkle, Jason Teutsch |
Constant compression and random weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 172-181, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Olivier Finkel |
The Determinacy of Context-Free Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 555-566, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Parys |
A Pumping Lemma for Pushdown Graphs of Any Level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 54-65, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Shafi Goldwasser |
Pseudo-deterministic Algorithms (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 29-29, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Yuval Filmus, Justin Ward |
The Power of Local Search: Maximum Coverage over a Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 601-612, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Hung Q. Ngo 0001, Ely Porat, Atri Rudra |
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 230-241, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | N. S. Narayanaswamy, Venkatesh Raman 0001, M. S. Ramanujan 0001, Saket Saurabh 0001 |
LP can be a cure for Parameterized Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 338-349, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Christian Eggermont, Gerhard J. Woeginger |
Motion planning with pulley, rope, and baskets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 374-383, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Colcombet |
Forms of Determinism for Automata (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 1-23, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Mathieu Hoyrup |
The dimension of ergodic random sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 567-576, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Ioannis Koutis, Alex Levin, Richard Peng |
Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 266-277, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Volker Diekert, Jürn Laun, Alexander Ushakov |
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 218-229, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson |
Linear-Space Data Structures for Range Mode Query in Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 290-301, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | André Arnold, Henryk Michalewski, Damian Niwinski |
On the separation question for tree languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 396-407, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Mikolaj Bojanczyk, Szymon Torunczyk |
Weak MSO+U over infinite trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 648-660, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Doerr, Carola Winzen |
Playing Mastermind With Constant-Size Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 441-452, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Christoph Dürr, Thomas Wilke (eds.) |
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4 The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
1 | Tomás Brázdil, Stefan Kiefer |
Stabilization of Branching Queueing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 507-518, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001 |
Edge-disjoint Odd Cycles in 4-edge-connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 206-217, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 66-77, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Sanjay Jain 0001, Efim B. Kinber |
Mind Change Speed-up for Learning Languages from Positive Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 350-361, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Justin Ward |
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 42-53, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Bienvenu, Rupert Hölzl 0001, Joseph S. Miller, André Nies |
The Denjoy alternative for computable functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 543-554, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Antoine Durand-Gasselin, Peter Habermehl |
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 242-253, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach |
Parameterized Complexity of Connected Even/Odd Subgraph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 432-440, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Kei Kimura, Kazuhisa Makino |
Trichotomy for Integer Linear Systems Based on Their Sign Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 613-623, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Paul S. Bonsma |
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 531-542, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Bärtschi, Subhash Suri |
Conflict-free Chromatic Art Gallery Coverage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pp. 160-171, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-35-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani |
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 332-343, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Jonathan A. Kelner, Alex Levin |
Spectral Sparsification in the Semi-Streaming Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 440-451, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Schwentick, Christoph Dürr (eds.) |
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5 The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh 0001 |
Hitting forbidden minors: Approximation and Kernelization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 189-200, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Jiun-Jie Wang, Xin He |
Compact Visibility Representation of Plane Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 141-152, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons 0001, Evgenij Thorstensen |
Structural Decomposition Methods and What They are Good For. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 12-28, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Parys |
Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 603-614, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Francine Blanchet-Sadri, John Lensmire |
On Minimal Sturmian Partial Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 225-236, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Jakub Kallas, Manfred Kufleitner, Alexander Lauser |
First-order Fragments with Successor over Infinite Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 356-367, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Timon Hertli, Robin A. Moser, Dominik Scheder |
Improving PPSZ for 3-SAT using Critical Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 237-248, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Maxim A. Babenko, Alexey Gusakov |
New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 519-530, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Martin Mundhenk, Felix Weiß |
The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 368-379, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Haim Kaplan, Yahav Nussbaum |
Minimum s-t cut in undirected planar graphs when the source and the sink are close. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 117-128, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger |
Analysis of multi-stage open shop processing systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 484-494, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|