nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
|
Woelfel, Philipp |
|
2006 |
363 |
1 |
p. 76-84 9 p. |
artikel |
2 |
An efficient algorithm for online square detection
|
Leung, H.F. |
|
2006 |
363 |
1 |
p. 69-75 7 p. |
artikel |
3 |
An improved algorithm for online coloring of intervals with bandwidth
|
Azar, Yossi |
|
2006 |
363 |
1 |
p. 18-27 10 p. |
artikel |
4 |
Approximating the minimum weight weak vertex cover
|
Zhang, Yong |
|
2006 |
363 |
1 |
p. 99-105 7 p. |
artikel |
5 |
Coloring octrees
|
Adamy, Udo |
|
2006 |
363 |
1 |
p. 11-17 7 p. |
artikel |
6 |
Complexity of hyperconcepts
|
Ratsaby, Joel |
|
2006 |
363 |
1 |
p. 2-10 9 p. |
artikel |
7 |
Computing phylogenetic roots with bounded degrees and errors is NP-complete
|
Tsukiji, Tatsuie |
|
2006 |
363 |
1 |
p. 43-59 17 p. |
artikel |
8 |
Editorial board v-ix
|
|
|
2006 |
363 |
1 |
p. v-ix nvt p. |
artikel |
9 |
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
|
Jansson, Jesper |
|
2006 |
363 |
1 |
p. 60-68 9 p. |
artikel |
10 |
Large triangles in the d-dimensional unit cube
|
Lefmann, Hanno |
|
2006 |
363 |
1 |
p. 85-98 14 p. |
artikel |
11 |
Preface
|
Chwa, Kyung-Yong |
|
2006 |
363 |
1 |
p. 1- 1 p. |
artikel |
12 |
The worst-case time complexity for generating all maximal cliques and computational experiments
|
Tomita, Etsuji |
|
2006 |
363 |
1 |
p. 28-42 15 p. |
artikel |