nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Adjacency queries in dynamic sparse graphs
|
Kowalik, Łukasz |
|
2007 |
102 |
5 |
p. 191-195 5 p. |
artikel |
2 |
A linear-time algorithm for Euclidean feature transform sets
|
Hesselink, Wim H. |
|
2007 |
102 |
5 |
p. 181-186 6 p. |
artikel |
3 |
A study of fault tolerance in star graph
|
Latifi, Shahram |
|
2007 |
102 |
5 |
p. 196-200 5 p. |
artikel |
4 |
A variant of the Ford–Johnson algorithm that is more space efficient
|
Ayala-Rincón, Mauricio |
|
2007 |
102 |
5 |
p. 201-207 7 p. |
artikel |
5 |
Editorial Board
|
|
|
2007 |
102 |
5 |
p. IFC- 1 p. |
artikel |
6 |
k-Restricted rotation distance between binary trees
|
Luccio, Fabrizio |
|
2007 |
102 |
5 |
p. 175-180 6 p. |
artikel |
7 |
Minimum cycle bases of direct products of complete graphs
|
Hammack, Richard |
|
2007 |
102 |
5 |
p. 214-218 5 p. |
artikel |
8 |
Nonstationary Poisson modeling of web browsing session arrivals
|
Chlebus, Edward |
|
2007 |
102 |
5 |
p. 187-190 4 p. |
artikel |
9 |
Robust parametric reachability for timed automata
|
Doyen, Laurent |
|
2007 |
102 |
5 |
p. 208-213 6 p. |
artikel |