Geodesic

Volume 8 (2004) no. 1

Sommaire

Drawing Planar Graphs with Large Vertices and Thick Edges
p. 3-20
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
p. 21-26
Extreme Distances in Multicolored Point Sets
p. 27-38
Fast Approximation of Centrality
p. 39-45
I/O-Optimal Algorithms for Outerplanar Graphs
p. 47-87
A Note on Rectilinearity and Angular Resolution
p. 89-94
The Star Clustering Algorithm for Static and Dynamic Information Organization
p. 95-129