Geodesic

Volume 10 (2006) no. 2

Sommaire

Collective Tree Spanners and Routing in AT-free Related Graphs
p. 97-122
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
p. 123-139
Orthogonal Hypergraph Drawing for Improved Visibility
p. 141-157
A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
p. 159-190
Computing Communities in Large Networks Using Random Walks
p. 191-218
Algorithms and Experiments for the Webgraph
p. 219-236
A Multilevel Algorithm for the Minimum 2-sum Problem
p. 237-258
Upward Planar Drawings and Switch-regularity Heuristics
p. 259-285
Drawing Kn in Three Dimensions with One Bend per Edge
p. 287-295
On the approximation of Min Split-coloring and Min Cocoloring
p. 297-315
NP-completeness of the Planar Separator Problems
p. 317-328
Efficient drawing of RNA secondary structure
p. 329-351
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
p. 353-363
Small Stretch Spanners on Dynamic Graphs
p. 365-385
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
p. 387-420