Volume 47, Issue 3

October 2010

Special Title: Symposium on Theoretical Aspects of Computer Science; Guest Editors: Susanne Albers, Pascal Weil

10 articles in this issue

STACS 2008 Foreword
Susanne Albers
Pascal Weil
EditorialNotes 03 June 2009 Pages: 611 - 612
Trimming of Graphs, with Application to Point Labeling
Thomas Erlebach
Torben Hagerup
Alexander Wolff
OriginalPaper Open access 05 February 2009 Pages: 613 - 636
Trimmed Moebius Inversion and Graphs of Bounded Degree
Andreas Björklund
Thore Husfeldt
Mikko Koivisto
OriginalPaper 29 January 2009 Pages: 637 - 654
The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace
Thomas Thierauf
Fabian Wagner
OriginalPaper 05 February 2009 Pages: 655 - 673
Connecting Polygonizations via Stretches and Twangs
Mirela Damian
Robin Flatland
Suneeta Ramaswami
OriginalPaper 12 February 2009 Pages: 674 - 695
Model Checking Games for the Quantitative μ-Calculus
Diana Fischer
Erich Grädel
Łukasz Kaiser
OriginalPaper 04 March 2009 Pages: 696 - 719
Limit Complexities Revisited
Laurent Bienvenu
Andrej Muchnik
Nikolay Vereshchagin
OriginalPaper 17 March 2009 Pages: 720 - 736
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
Samir Datta
Raghav Kulkarni
Sambuddha Roy
OriginalPaper 17 March 2009 Pages: 737 - 757
Lexicographic Decomposition of k-Valued Transducers
Jacques Sakarovitch
Rodrigo de Souza
OriginalPaper 07 April 2009 Pages: 758 - 785
Quantum Search with Variable Times
Andris Ambainis
OriginalPaper 03 June 2009 Pages: 786 - 807

Search