Volume 11,
no. 1,
2007
- Building Blocks of Upward Planar Digraphs
Patrick Healy and Karol Lynch
Vol. 11,
no. 1,
pp.
3-44,
2007.
Regular paper.
Submitted: May 2005.
Revised: August 2006. Communicated by Giuseppe Di Battista.
- Bar k-Visibility Graphs
Alice M. Dean, William Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari and William T. Trotter
Vol. 11,
no. 1,
pp.
45-59,
2007.
Regular paper.
Submitted: August 2005.
Revised: November 2006. Communicated by Sue H. Whitesides.
- The Traveling Salesman Problem for Cubic Graphs
David Eppstein
Vol. 11,
no. 1,
pp.
61-81,
2007.
Regular paper.
Submitted: April 2004.
Revised: January 2007. Communicated by Joseph S. B. Mitchell.
- Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs
Athula Gunawardena and Robert R. Meyer
Vol. 11,
no. 1,
pp.
83-98,
2007.
Regular paper.
Submitted: April 2005.
Revised: January 2007. Communicated by Xin He.
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide
Database of Graphs
Donatello Conte, Pasquale Foggia and Mario Vento
Vol. 11,
no. 1,
pp.
99-143,
2007.
Regular paper.
Submitted: September 2005.
Revised: January 2007. Communicated by Ulrik Brandes.
- Fixed-Location Circular Arc Drawing of Planar Graphs
Alon Efrat, Cesim Erten and Stephen Kobourov
Vol. 11,
no. 1,
pp.
145-164,
2007.
Regular paper.
Submitted: November 2004.
Revised: February 2006. Communicated by Michael Kaufmann.
- Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
Kerri Morgan and Graham Farr
Vol. 11,
no. 1,
pp.
165-193,
2007.
Regular paper.
Submitted: August 2006.
Revised: April 2007. Communicated by Peter Eades.
|