nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Simple and Fast Min-Cut Algorithm
|
Brinkmeier, Michael |
|
2007 |
41 |
2 |
p. 369-380 |
artikel |
2 |
Average-Case Non-Approximability of Optimisation Problems
|
Schelm, Birgit |
|
2007 |
41 |
2 |
p. 351-368 |
artikel |
3 |
Exact Algorithms for Graph Homomorphisms
|
Fomin, Fedor V. |
|
2007 |
41 |
2 |
p. 381-393 |
artikel |
4 |
Leftist Grammars and the Chomsky Hierarchy
|
Jurdzinski, Tomasz |
|
2007 |
41 |
2 |
p. 233-256 |
artikel |
5 |
Logspace Optimization Problems and Their Approximability Properties
|
Tantau, Till |
|
2007 |
41 |
2 |
p. 327-350 |
artikel |
6 |
On the Incompressibility of Monotone DNFs
|
Krieger, Matthias P. |
|
2007 |
41 |
2 |
p. 211-231 |
artikel |
7 |
On the Power of Unambiguity in Alternating Machines
|
Spakowski, Holger |
|
2007 |
41 |
2 |
p. 291-326 |
artikel |
8 |
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers
|
Meister, Daniel |
|
2007 |
41 |
2 |
p. 257-289 |
artikel |
9 |
Preface
|
|
|
2007 |
41 |
2 |
p. 209-210 |
artikel |