nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Dense trees: a new look at degenerate graphs
|
Franceschini, Gianni |
|
2006 |
4 |
3 |
p. 455-474 20 p. |
artikel |
2 |
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
|
Demetrescu, Camil |
|
2006 |
4 |
3 |
p. 353-383 31 p. |
artikel |
3 |
Editorial Board
|
|
|
2006 |
4 |
3 |
p. iii-iv nvt p. |
artikel |
4 |
Efficient offline algorithms for the bicriteria k-server problem and online applications
|
Flammini, Michele |
|
2006 |
4 |
3 |
p. 414-432 19 p. |
artikel |
5 |
Online weighted flow time and deadline scheduling
|
Becchetti, Luca |
|
2006 |
4 |
3 |
p. 339-352 14 p. |
artikel |
6 |
On Multi-threaded Metrical Task Systems
|
Feuerstein, Esteban |
|
2006 |
4 |
3 |
p. 401-413 13 p. |
artikel |
7 |
Preface
|
Italiano, Giuseppe F. |
|
2006 |
4 |
3 |
p. 337-338 2 p. |
artikel |
8 |
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
|
Fotakis, Dimitris A. |
|
2006 |
4 |
3 |
p. 433-454 22 p. |
artikel |
9 |
The strength of weak proximity
|
Di Battista, Giuseppe |
|
2006 |
4 |
3 |
p. 384-400 17 p. |
artikel |
10 |
Upper bounds on the bisection width of 3- and 4-regular graphs
|
Monien, Burkhard |
|
2006 |
4 |
3 |
p. 475-498 24 p. |
artikel |