| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
|
Peyer, Sven
|
|
2009
|
7 |
4 |
p. 377-390
14 p.
|
artikel
|
| 2 |
Algorithms for generating convex sets in acyclic digraphs
|
Balister, P.
|
|
2009
|
7 |
4 |
p. 509-518
10 p.
|
artikel
|
| 3 |
An exact algorithm for subgraph homeomorphism
|
Lingas, Andrzej
|
|
2009
|
7 |
4 |
p. 464-468
5 p.
|
artikel
|
| 4 |
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
|
Ando, Ei
|
|
2009
|
7 |
4 |
p. 420-438
19 p.
|
artikel
|
| 5 |
Average-optimal string matching
|
Fredriksson, Kimmo
|
|
2009
|
7 |
4 |
p. 579-594
16 p.
|
artikel
|
| 6 |
Bandwidth of bipartite permutation graphs in polynomial time
|
Heggernes, Pinar
|
|
2009
|
7 |
4 |
p. 533-544
12 p.
|
artikel
|
| 7 |
Crossing minimization in weighted bipartite graphs
|
Çakıroḡlu, Olca A.
|
|
2009
|
7 |
4 |
p. 439-452
14 p.
|
artikel
|
| 8 |
DAG reversal is NP-complete
|
Naumann, Uwe
|
|
2009
|
7 |
4 |
p. 402-410
9 p.
|
artikel
|
| 9 |
Editorial Board
|
|
|
2009
|
7 |
4 |
p. iii-iv
nvt p.
|
artikel
|
| 10 |
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
|
Ishii, Toshimasa
|
|
2009
|
7 |
4 |
p. 570-578
9 p.
|
artikel
|
| 11 |
How to draw a clustered tree
|
Di Battista, Giuseppe
|
|
2009
|
7 |
4 |
p. 479-499
21 p.
|
artikel
|
| 12 |
On the Ehrenfeucht–Mycielski sequence
|
Herman, Grzegorz
|
|
2009
|
7 |
4 |
p. 500-508
9 p.
|
artikel
|
| 13 |
Optimal algorithms for page migration in dynamic networks
|
Bienkowski, Marcin
|
|
2009
|
7 |
4 |
p. 545-569
25 p.
|
artikel
|
| 14 |
Ordered interval routing schemes
|
Ahmed, Mustaq
|
|
2009
|
7 |
4 |
p. 363-376
14 p.
|
artikel
|
| 15 |
Planar bichromatic minimum spanning trees
|
Borgelt, Magdalene G.
|
|
2009
|
7 |
4 |
p. 469-478
10 p.
|
artikel
|
| 16 |
Randomized algorithm for the k-server problem on decomposable spaces
|
Nagy-György, Judit
|
|
2009
|
7 |
4 |
p. 411-419
9 p.
|
artikel
|
| 17 |
Reoptimization of minimum and maximum traveling salesman's tours
|
Ausiello, Giorgio
|
|
2009
|
7 |
4 |
p. 453-463
11 p.
|
artikel
|
| 18 |
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
|
Damaschke, Peter
|
|
2009
|
7 |
4 |
p. 391-401
11 p.
|
artikel
|
| 19 |
Threshold dominating cliques in random graphs and interval routing
|
Gao, Yong
|
|
2009
|
7 |
4 |
p. 519-532
14 p.
|
artikel
|
Tijdschrift beschrijving