Geodesic

Tome 16 (2012) no. 2

Sommaire

Vertex Intersection Graphs of Paths on a Grid
p. 129-150
Drawing Recurrent Hierarchies
p. 151-198
Centdian Computation in Cactus Graphs
p. 199-224
Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph
p. 225-241
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
p. 243-259
The Black-and-White Coloring Problem on Chordal Graphs
p. 261-281
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
p. 283-315
Visibility Representation of Plane Graphs with Simultaneous Bound for Both Width and Height
p. 317-334
Finding Hamilton cycles in robustly expanding digraphs
p. 335-358
DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations
p. 359-380
Subgraph Homeomorphism via the Edge Addition Planarity Algorithm
p. 381-410
Dynamic Graph Clustering Using Minimum-Cut Trees
p. 411-446
The Shortcut Problem - Complexity and Algorithms
p. 447-481
The Parking Problem for Finite-State Robots
p. 483-506
Generating Geometric Graphs Using Automorphisms
p. 507-541
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
p. 543-567
The Straight-Line RAC Drawing Problem is NP-Hard
p. 569-597
Augmenting the Connectivity of Planar and Geometric Graphs
p. 599-628