Vol. 13 No. 2 (2009)

Published: 2009-02-01

Algorithm Engineering for Optimal Graph Bipartization

Falk Hüffner

77-98
- article (PDF)
Degree-constrained edge partitioning in graphs arising from discrete tomography

Cedric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra

99-118
- article (PDF)
Vertex Bisection is Hard, too

Ulrik Brandes, Daniel Fleischer

119-131
- article (PDF)
The Black-and-White Coloring Problem on Trees

Daniel Berend, Shira Zucker

133-152
- article (PDF)
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area

Md. Rezaul Karim, Md. Saidur Rahman

153-177
- article (PDF)
New Approximation to the One-sided Radial Crossing Minimization

Seok-Hee Hong, Hiroshi Nagamochi

179-196
- article (PDF)
Finding Large Clique Minors is Hard

David Eppstein

197-204
- article (PDF)
Intersection Graphs in Simultaneous Embedding with Fixed Edges

Michael Jünger, Michael Schulz

205-218
- article (PDF)
Towards an optimal algorithm for recognizing Laman graphs

Ovidiu Daescu, Anastasia Kurdia

219-232
- article (PDF)
The Knapsack Problem with Conflict Graphs

Ulrich Pferschy, Joachim Schauer

233-249
- article (PDF)
Generating connected and 2-edge connected graphs

Angela Mestre

251-281
- article (PDF)