Geodesic

Volume 13 (2009) no. 2

Sommaire

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