Geodesic

Sommaire du Fascicule no. 1

Guest Editor's Foreword
p. 3-4
Cubic graphs have bounded slope parameter
p. 5-17
An Algorithm to Construct Greedy Drawings of Triangulations
p. 19-51
Efficient, Proximity-Preserving Node Overlap Removal
p. 53-74
On Metro-Line Crossing Minimization
p. 75-96
Visual Analysis of One-To-Many Matched Graphs
p. 97-119

Sommaire du Fascicule no. 2

New complexity results for time-constrained dynamical optimal path problems
p. 123-147
Resource relocation on asymmetric networks
p. 149-163
Computational Aspects of Lucidity-Driven Graph Clustering
p. 165-197
Intersection Graphs of Pseudosegments: Chordal Graphs
p. 199-220
A Graph Pebbling Algorithm on Weighted Graphs
p. 221-244
Minimum-Layer Upward Drawings of Trees
p. 245-267
On the Maximum Independent Set Problem in Subclasses of Planar Graphs
p. 269-286
Computing All Best Swaps for Minimum-Stretch Tree Spanners
p. 287-306
Finding the Most Relevant Fragments in Networks
p. 307-336
Applications of Parameterized st-Orientations
p. 337-365
Acyclic Orientation of Drawings
p. 367-384
A Linear-Time Approximation Algorithm for Rotation Distance
p. 385-390
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
p. 391-407