| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An efficient algorithm for Horn description
|
Hébrard, Jean-Jacques
|
|
2003
|
88 |
4 |
p. 177-182
6 p.
|
artikel
|
| 2 |
A notion of cross-perfect bipartite graphs
|
Dawande, Milind
|
|
2003
|
88 |
4 |
p. 143-147
5 p.
|
artikel
|
| 3 |
3 2 -approximation for two-machine no-wait flowshop scheduling with availability constraints
|
Cheng, T.C.Edwin
|
|
2003
|
88 |
4 |
p. 161-165
5 p.
|
artikel
|
| 4 |
Board of Editors
|
|
|
2003
|
88 |
4 |
p. IFC-
1 p.
|
artikel
|
| 5 |
Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs
|
Zhou, Jianjun
|
|
2003
|
88 |
4 |
p. 195-200
6 p.
|
artikel
|
| 6 |
Distributed algorithms for finding and maintaining a k-tree core in a dynamic network
|
Srivastava, Saurabh
|
|
2003
|
88 |
4 |
p. 187-194
8 p.
|
artikel
|
| 7 |
Erratum to: “Digital signature algorithm for securing digital identities”
|
Kwon, Taekyoung
|
|
2003
|
88 |
4 |
p. 201-202
2 p.
|
artikel
|
| 8 |
Fault-tolerant cycle-embedding of crossed cubes
|
Yang, Ming-Chien
|
|
2003
|
88 |
4 |
p. 149-154
6 p.
|
artikel
|
| 9 |
Improvement of the Miyazaki–Takaragi threshold digital signature scheme
|
Wu, Tzong-Sun
|
|
2003
|
88 |
4 |
p. 183-186
4 p.
|
artikel
|
| 10 |
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
|
Galbiati, Giulia
|
|
2003
|
88 |
4 |
p. 155-159
5 p.
|
artikel
|
| 11 |
Some results on graphs without long induced paths
|
Lozin, Vadim
|
|
2003
|
88 |
4 |
p. 167-171
5 p.
|
artikel
|
| 12 |
The constrained longest common subsequence problem
|
Tsai, Yin-Te
|
|
2003
|
88 |
4 |
p. 173-176
4 p.
|
artikel
|
Tijdschrift beschrijving