Vol. 11 No. 1 (2007)

Published: 2007-01-01

Building Blocks of Upward Planar Digraphs

Patrick Healy, Karol Lynch

3-44
- article (PDF)
Bar k-Visibility Graphs

Alice Dean, William Evans, Ellen Gethner, Joshua Laison, Mohammad Ali Safari, William Trotter

45-59
- article (PDF)
The Traveling Salesman Problem for Cubic Graphs

David Eppstein

61-81
- article (PDF)
Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs

Athula Gunawardena, Robert Meyer

83-98
- article (PDF)
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs

Donatello Conte, Pasquale Foggia, Mario Vento

99-143
- article (PDF)
Fixed-Location Circular Arc Drawing of Planar Graphs

Alon Efrat, Cesim Erten, Stephen Kobourov

145-164
- article (PDF)
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems

Kerri Morgan, Graham Farr

165-193
- article (PDF)
Estimating the Number of s-t Paths in a Graph

Ben Roberts, Dirk Kroese

195-214
- article (PDF)
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images

Xiaodong Wu, Michael Merickel

215-237
- article (PDF)
Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

Mauro Mezzini

239-257
- article (PDF)
Planar Embeddings of Graphs with Specified Edge Lengths

Sergio Cabello, Erik Demaine, Günter Rote

259-276
- article (PDF)
Specific Selection of FFT Amplitudes from Audio Sports and News Broadcasting for Classification Purposes

Marios Poulos, George Bokos, Nikolaos Kanellopoulos, Sozon Papavlasopoulos, Markos Avlonitis

277-307
- article (PDF)
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games

Louigi Addario-Berry, Neil Olver, Adrian Vetta

309-319
- article (PDF)