| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Boolean measure of similarity
|
Anthony, Martin
|
|
2006
|
154 |
16 |
p. 2242-2246
5 p.
|
artikel
|
| 2 |
A competitive and cooperative approach to propositional satisfiability
|
Inoue, Katsumi
|
|
2006
|
154 |
16 |
p. 2291-2306
16 p.
|
artikel
|
| 3 |
An approximation algorithm for the pickup and delivery vehicle routing problem on trees
|
Katoh, Naoki
|
|
2006
|
154 |
16 |
p. 2335-2349
15 p.
|
artikel
|
| 4 |
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
|
Khachiyan, Leonid
|
|
2006
|
154 |
16 |
p. 2350-2372
23 p.
|
artikel
|
| 5 |
An O ( n log 2 n ) algorithm for the optimal sink location problem in dynamic tree networks
|
Mamada, Satoko
|
|
2006
|
154 |
16 |
p. 2387-2401
15 p.
|
artikel
|
| 6 |
Contents
|
|
|
2006
|
154 |
16 |
p. vii-viii
nvt p.
|
artikel
|
| 7 |
Density condensation of Boolean formulas
|
Hanatani, Youichi
|
|
2006
|
154 |
16 |
p. 2263-2270
8 p.
|
artikel
|
| 8 |
Editorial Board
|
|
|
2006
|
154 |
16 |
p. v-vi
nvt p.
|
artikel
|
| 9 |
Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit
|
Edward Yan, Mingjun
|
|
2006
|
154 |
16 |
p. 2418-2429
12 p.
|
artikel
|
| 10 |
Generalized metarationalities in the graph model for conflict resolution
|
Zeng, Dao-Zhi
|
|
2006
|
154 |
16 |
p. 2430-2443
14 p.
|
artikel
|
| 11 |
Guest Editors
|
|
|
2006
|
154 |
16 |
p. 2241-
1 p.
|
artikel
|
| 12 |
Guide for authors
|
|
|
2006
|
154 |
16 |
p. I-IV
nvt p.
|
artikel
|
| 13 |
How to collect balls moving in the Euclidean plane
|
Asahiro, Yuichi
|
|
2006
|
154 |
16 |
p. 2247-2262
16 p.
|
artikel
|
| 14 |
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
|
Ishii, Toshimasa
|
|
2006
|
154 |
16 |
p. 2307-2329
23 p.
|
artikel
|
| 15 |
Minimum edge ranking spanning trees of split graphs
|
Makino, Kazuhisa
|
|
2006
|
154 |
16 |
p. 2373-2386
14 p.
|
artikel
|
| 16 |
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
|
Miyata, Keizo
|
|
2006
|
154 |
16 |
p. 2402-2410
9 p.
|
artikel
|
| 17 |
Preface
|
Katoh, Naoki
|
|
2006
|
154 |
16 |
p. 2239-2240
2 p.
|
artikel
|
| 18 |
Sparse connectivity certificates via MA orderings in graphs
|
Nagamochi, Hiroshi
|
|
2006
|
154 |
16 |
p. 2411-2417
7 p.
|
artikel
|
| 19 |
The vehicle routing problem with flexible time windows and traveling times
|
Hashimoto, Hideki
|
|
2006
|
154 |
16 |
p. 2271-2290
20 p.
|
artikel
|
| 20 |
Two equivalent measures on weighted hypergraphs
|
Ito, Hiro
|
|
2006
|
154 |
16 |
p. 2330-2334
5 p.
|
artikel
|
Tijdschrift beschrijving