Geodesic

Sommaire du Fascicule no. 1

Guest Editor's Foreword
p. 3-5
Planar Drawings of Higher-Genus Graphs
p. 7-32
Drawing 3-Polytopes with Good Vertex Resolution
p. 33-52
On the Perspectives Opened by Right Angle Crossing Drawings
p. 53-78
Geometric Simultaneous Embeddings of a Graph and a Matching
p. 79-96
More Canonical Ordering
p. 97-126
Upward Planarization Layout
p. 127-155
More Flexible Radial Layout
p. 157-173

Sommaire du Fascicule no. 2

Minimum-Area Drawings of Plane 3-Trees
p. 177-204
Morphing Planar Graph Drawings with Bent Edges
p. 205-227
A Graph Drawing Application to Web Site Traffic Analysis
p. 229-251
On the threshold-width of graphs
p. 253-268
Recognizing Partial Cubes in Quadratic Time
p. 269-293
Genus Distributions of Cubic Outerplanar Graphs
p. 295-316

Sommaire du Fascicule no. 3

Guest Editor's Foreword
p. 319-321
Recognition of Unigraphs through Superposition of Graphs
p. 323-343
Minmax Tree Cover in the Euclidean Space
p. 345-371
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
p. 373-415
Recursive generation of simple planar 5-regular graphs and pentangulations
p. 417-436
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area
p. 437-456
Generating All Triangulations of Plane Graphs
p. 457-482

Sommaire du Fascicule no. 4

The Voronoi game on graphs and its complexity
p. 485-501
I/O-Efficient Algorithms on Near-Planar Graphs
p. 503-532
On Planar Supports for Hypergraphs
p. 533-549
Optimal Angular Resolution for Face-Symmetric Drawings
p. 551-564

Sommaire du Fascicule no. 5

Guest Editor's Foreword
p. 567-568
Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons
p. 569-586
Switch-Regular Upward Planarity Testing of Directed Trees
p. 587-629
Global k-Level Crossing Reduction
p. 631-659
A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques
p. 661-682
Variants of Spreading Messages
p. 683-699

Sommaire du Fascicule no. 6

Triangle Sparsifiers
p. 703-726
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
p. 727-751
FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs
p. 753-776