nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Acyclic and k-distance coloring of the grid
|
Fertin, Guillaume |
|
2003 |
87 |
1 |
p. 51-58 8 p. |
artikel |
2 |
A note on an expressiveness hierarchy for multi-exit iteration
|
Aceto, Luca |
|
2003 |
87 |
1 |
p. 17-23 7 p. |
artikel |
3 |
Board of Editors
|
|
|
2003 |
87 |
1 |
p. IFC- 1 p. |
artikel |
4 |
Detecting directed 4-cycles still faster
|
Eisenbrand, Friedrich |
|
2003 |
87 |
1 |
p. 13-15 3 p. |
artikel |
5 |
Exact complexity of Exact-Four-Colorability
|
Rothe, Jörg |
|
2003 |
87 |
1 |
p. 7-12 6 p. |
artikel |
6 |
Functions that have read-once branching programs of quadratic size are not necessarily testable
|
Bollig, Beate |
|
2003 |
87 |
1 |
p. 25-29 5 p. |
artikel |
7 |
k-tuple domination in graphs
|
Liao, Chung-Shou |
|
2003 |
87 |
1 |
p. 45-50 6 p. |
artikel |
8 |
Non-clairvoyant scheduling for weighted flow time
|
Kim, Jae-Hoon |
|
2003 |
87 |
1 |
p. 31-37 7 p. |
artikel |
9 |
On the complexity of finding balanced oneway cuts
|
Feige, Uriel |
|
2003 |
87 |
1 |
p. 1-5 5 p. |
artikel |
10 |
Tighter constant-factor time hierarchies
|
Ben-Amram, Amir M. |
|
2003 |
87 |
1 |
p. 39-44 6 p. |
artikel |