nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A better list heuristic for vertex cover
|
Delbot, François |
|
2008 |
107 |
3-4 |
p. 125-127 3 p. |
artikel |
2 |
An efficient method to generate feasible paths for basis path testing
|
Yan, Jun |
|
2008 |
107 |
3-4 |
p. 87-92 6 p. |
artikel |
3 |
Approximating k-hop minimum spanning trees in Euclidean metrics
|
Laue, Sören |
|
2008 |
107 |
3-4 |
p. 96-101 6 p. |
artikel |
4 |
A relaxation of Havel's 3-color problem
|
Montassier, Mickaël |
|
2008 |
107 |
3-4 |
p. 107-109 3 p. |
artikel |
5 |
Conditional fault Hamiltonicity of the complete graph
|
Fu, Jung-Sheng |
|
2008 |
107 |
3-4 |
p. 110-113 4 p. |
artikel |
6 |
Confusion of memory
|
Moss, Lawrence S. |
|
2008 |
107 |
3-4 |
p. 114-119 6 p. |
artikel |
7 |
1 , 2 Conjecture—the multiplicative version
|
Skowronek-Kaziów, Joanna |
|
2008 |
107 |
3-4 |
p. 93-95 3 p. |
artikel |
8 |
Editorial Board
|
|
|
2008 |
107 |
3-4 |
p. IFC- 1 p. |
artikel |
9 |
Minimum-perimeter enclosures
|
Mitchell, Joseph S.B. |
|
2008 |
107 |
3-4 |
p. 120-124 5 p. |
artikel |
10 |
On 3-choosability of planar graphs without certain cycles
|
Zhang, Haihui |
|
2008 |
107 |
3-4 |
p. 102-106 5 p. |
artikel |
11 |
The connection between two ways of reasoning about partial functions
|
Fitzgerald, John S. |
|
2008 |
107 |
3-4 |
p. 128-132 5 p. |
artikel |