nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An improved exact algorithm for the domatic number problem
|
Riege, Tobias |
|
2007 |
101 |
3 |
p. 101-106 6 p. |
artikel |
2 |
A power-set construction for reducing Büchi automata to non-determinism degree two
|
Ultes-Nitsche, Ulrich |
|
2007 |
101 |
3 |
p. 107-111 5 p. |
artikel |
3 |
Editorial Board
|
|
|
2007 |
101 |
3 |
p. CO2- 1 p. |
artikel |
4 |
Nonnegative integral subset representations of integer sets
|
Collins, Michael J. |
|
2007 |
101 |
3 |
p. 129-133 5 p. |
artikel |
5 |
On the longest path algorithm for reconstructing trees from distance matrices
|
Reyzin, Lev |
|
2007 |
101 |
3 |
p. 98-100 3 p. |
artikel |
6 |
On transitive orientations with restricted covering graphs
|
Dobson, Maria Patricia |
|
2007 |
101 |
3 |
p. 119-125 7 p. |
artikel |
7 |
Path bipancyclicity of hypercubes
|
Tsai, Chang-Hsiung |
|
2007 |
101 |
3 |
p. 93-97 5 p. |
artikel |
8 |
The Ford–Johnson algorithm still unbeaten for less than 47 elements
|
Peczarski, Marcin |
|
2007 |
101 |
3 |
p. 126-128 3 p. |
artikel |
9 |
The hardness of the Expected Decision Depth problem
|
Ron, Dana |
|
2007 |
101 |
3 |
p. 112-118 7 p. |
artikel |
10 |
Three-coloring planar graphs without short cycles
|
Chen, Min |
|
2007 |
101 |
3 |
p. 134-138 5 p. |
artikel |