Geodesic

Sommaire du Fascicule no. 1

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

Sommaire du Fascicule no. 2

Guest Editor's Foreword
p. 133-134
Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
p. 135-160
Drawing Graphs on Two and Three Lines
p. 161-177
Simple and Efficient Bilayer Cross Counting
p. 179-194
Graph Drawing by High-Dimensional Embedding
p. 195-214
Computing and Drawing Isomorphic Subgraphs
p. 215-238

Sommaire du Fascicule no. 3

On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
p. 241-273
Algorithms for Single Link Failure Recovery and Related Problems
p. 275-294
NP-Completeness of Minimal Width Unordered Tree Layout
p. 295-312
Algorithm and Experiments in Testing Planar Graphs for Isomorphism
p. 313-356
Three-Dimensional 1-Bend Graph Drawings
p. 357-366