no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Computing a minimum-dilation spanning tree is NP-hard
|
Cheong, Otfried |
|
2008 |
41 |
3 |
p. 188-205 18 p. |
article |
2 |
Editorial Board
|
|
|
2008 |
41 |
3 |
p. IFC- 1 p. |
article |
3 |
Improving the topology computation of an arrangement of cubics
|
Caravantes, Jorge |
|
2008 |
41 |
3 |
p. 206-218 13 p. |
article |
4 |
Localized homology
|
Zomorodian, Afra |
|
2008 |
41 |
3 |
p. 126-148 23 p. |
article |
5 |
Maximum upward planar subgraphs of embedded planar digraphs
|
Binucci, Carla |
|
2008 |
41 |
3 |
p. 230-246 17 p. |
article |
6 |
Optimal location of transportation devices
|
Cardinal, Jean |
|
2008 |
41 |
3 |
p. 219-229 11 p. |
article |
7 |
Reporting flock patterns
|
Benkert, Marc |
|
2008 |
41 |
3 |
p. 111-125 15 p. |
article |
8 |
The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing
|
Goldschmidt, Nir |
|
2008 |
41 |
3 |
p. 167-187 21 p. |
article |
9 |
Time-varying Reeb graphs for continuous space–time data
|
Edelsbrunner, Herbert |
|
2008 |
41 |
3 |
p. 149-166 18 p. |
article |