no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Connecting Polygonizations via Stretches and Twangs
|
Damian, Mirela |
|
2009 |
47 |
3 |
p. 674-695 |
article |
2 |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
|
Datta, Samir |
|
2009 |
47 |
3 |
p. 737-757 |
article |
3 |
Lexicographic Decomposition of k-Valued Transducers
|
Sakarovitch, Jacques |
|
2009 |
47 |
3 |
p. 758-785 |
article |
4 |
Limit Complexities Revisited
|
Bienvenu, Laurent |
|
2009 |
47 |
3 |
p. 720-736 |
article |
5 |
Model Checking Games for the Quantitative μ-Calculus
|
Fischer, Diana |
|
2009 |
47 |
3 |
p. 696-719 |
article |
6 |
Quantum Search with Variable Times
|
Ambainis, Andris |
|
2009 |
47 |
3 |
p. 786-807 |
article |
7 |
STACS 2008 Foreword
|
Albers, Susanne |
|
2009 |
47 |
3 |
p. 611-612 |
article |
8 |
The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace
|
Thierauf, Thomas |
|
2009 |
47 |
3 |
p. 655-673 |
article |
9 |
Trimmed Moebius Inversion and Graphs of Bounded Degree
|
Björklund, Andreas |
|
2009 |
47 |
3 |
p. 637-654 |
article |
10 |
Trimming of Graphs, with Application to Point Labeling
|
Erlebach, Thomas |
|
2009 |
47 |
3 |
p. 613-636 |
article |