Geodesic

Sommaire du Fascicule no. 1

Building Blocks of Upward Planar Digraphs
p. 3-44
Bar k-Visibility Graphs
p. 45-59
The Traveling Salesman Problem for Cubic Graphs
p. 61-81
Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs
p. 83-98
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
p. 99-143
Fixed-Location Circular Arc Drawing of Planar Graphs
p. 145-164
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
p. 165-193
Estimating the Number of s-t Paths in a Graph
p. 195-214
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
p. 215-237
Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time
p. 239-257
Planar Embeddings of Graphs with Specified Edge Lengths
p. 259-276
Specific Selection of FFT Amplitudes from Audio Sports and News Broadcasting for Classification Purposes
p. 277-307
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
p. 309-319

Sommaire du Fascicule no. 2

Guest Editor's Foreword
p. 323-324
Dynamic Spectral Layout with an Application to Small Worlds
p. 325-343
Large-Graph Layout Algorithms at Work: An Experimental Study
p. 345-369
A 2.5D Hierarchical Drawing of Directed Graphs
p. 371-396
Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization
p. 397-429
On Balloon Drawings of Rooted Trees
p. 431-452
Energy Models for Graph Clustering
p. 453-480
Drawing graphs using modular decomposition
p. 481-511