Geodesic

Sommaire du Fascicule no. 1

Guest Editor's Foreword
p. 3-4
Listing All Plane Graphs
p. 5-18
On the Approximability of Comparing Genomes with Duplicates
p. 19-53
The Multi-Commodity Source Location Problems and the Price of Greed
p. 55-73

Sommaire du Fascicule no. 2

Algorithm Engineering for Optimal Graph Bipartization
p. 77-98
Degree-constrained edge partitioning in graphs arising from discrete tomography
p. 99-118
Vertex Bisection is Hard, too
p. 119-131
The Black-and-White Coloring Problem on Trees
p. 133-152
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
p. 153-177
New Approximation to the One-sided Radial Crossing Minimization
p. 179-196
Finding Large Clique Minors is Hard
p. 197-204
Intersection Graphs in Simultaneous Embedding with Fixed Edges
p. 205-218
Towards an optimal algorithm for recognizing Laman graphs
p. 219-232
The Knapsack Problem with Conflict Graphs
p. 233-249
Generating connected and 2-edge connected graphs
p. 251-281

Sommaire du Fascicule no. 3

Guest Editors' Foreword
p. 285-287
Algorithms for Multi-Criteria Boundary Labeling
p. 289-317
DAGmaps: Space Filling Visualization of Directed Acyclic Graphs
p. 319-347
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
p. 349-378
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
p. 379-422
Matched Drawings of Planar Graphs
p. 423-445
Constrained Simultaneous and Near-Simultaneous Embeddings
p. 447-465