Geodesic

Sommaire du Fascicule no. 1

Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry
p. 3-31
Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
p. 33-77
Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
p. 79-98

Sommaire du Fascicule no. 2

Guest Editors' Foreword
p. 101-103
On External-Memory Planar Depth First Search
p. 105-129
Small Maximal Independent Sets and Faster Exact Graph Coloring
p. 131-140
Deciding Clique-Width for Graphs of Bounded Tree-Width
p. 141-180
Visual Ranking of Link Structures
p. 181-201
An Approach for Mixed Upward Planarization
p. 203-220
Upward Embeddings and Orientations of Undirected Planar Graphs
p. 221-241

Sommaire du Fascicule no. 3

Crossing Numbers and Cutwidths
p. 245-251
A Multilevel Algorithm for Force-Directed Graph-Drawing
p. 253-285
Finding Shortest Paths With Computational Geometry
p. 287-303

Sommaire du Fascicule no. 4

Guest Editors' Foreword
p. 307-309
Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
p. 311-333
Orthogonal Drawings of Plane Graphs Without Bends
p. 335-362
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
p. 363-398
Low-Distortion Embeddings of Trees
p. 399-409
On Cotree-Critical and DFS Cotree-Critical Graphs
p. 411-427