nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithms for maximum weight induced paths
|
Gavril, Fanica |
|
2002 |
81 |
4 |
p. 203-208 6 p. |
artikel |
2 |
A proof method for the correctness of modularized 0CFA
|
Lee, Oukseh |
|
2002 |
81 |
4 |
p. 179-185 7 p. |
artikel |
3 |
Complexity of homomorphisms to direct products of graphs
|
Büki, Judit |
|
2002 |
81 |
4 |
p. 175-178 4 p. |
artikel |
4 |
4-edge-coloring graphs of maximum degree 3 in linear time
|
Skulrattanakulchai, San |
|
2002 |
81 |
4 |
p. 191-195 5 p. |
artikel |
5 |
On enumeration of catastrophic fault patterns
|
Maity, Soumen |
|
2002 |
81 |
4 |
p. 209-212 4 p. |
artikel |
6 |
On the minimum size of visibility graphs
|
Garcı́a Olaverri, Alfredo |
|
2002 |
81 |
4 |
p. 223-230 8 p. |
artikel |
7 |
Pancyclicity of recursive circulant graphs
|
Araki, Toru |
|
2002 |
81 |
4 |
p. 187-190 4 p. |
artikel |
8 |
Randomized splay trees: Theoretical and experimental results
|
Albers, Susanne |
|
2002 |
81 |
4 |
p. 213-221 9 p. |
artikel |
9 |
The expected complexity of Prim's minimum spanning tree algorithm
|
Martel, Chip |
|
2002 |
81 |
4 |
p. 197-201 5 p. |
artikel |