|
Journals in DBLP
Comput. Geom. 2001, volume: 18, number: 1
- Konstantinos G. Kakoulis, Ioannis G. Tollis
On the complexity of the Edge Label Placement problem. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:18, n:1, pp:1-17 [Journal]
- Binay K. Bhattacharya, Subir Kumar Ghosh
Characterizing LR-visibility polygons and related problems. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:18, n:1, pp:19-36 [Journal]
- Sven Schuierer
Lower bounds in on-line geometric searching. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:18, n:1, pp:37-53 [Journal]
- Ambros Marzetta, Jürg Nievergelt
Enumerating the k best plane spanning trees. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:18, n:1, pp:55-64 [Journal]
|