Geodesic

Sommaire du Fascicule no. 1

Guest Editors' Foreword
p. 1-3
OnGraX: A Web-Based System for the Collaborative Visual Analysis of Graphs
p. 5-27
Shape-Based Quality Metrics for Large Graph Visualization
p. 29-53
An Incremental Layout Method for Visualizing Online Dynamic Graphs
p. 55-80
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
p. 81-102
Rook-drawings of Plane Graphs
p. 103-120
The Utility of Untangling
p. 121-134
Hanani-Tutte for Radial Planarity
p. 135-154

Sommaire du Fascicule no. 2

Star-Shaped and L-Shaped Orthogonal Drawings
p. 155-175
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
p. 177-181
On the Complexity of the Planar Slope Number Problem
p. 183-193
Symmetry Breaking Constraints for the Minimum Deficiency Problem
p. 195-218
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT
p. 219-243

Sommaire du Fascicule no. 3

Guest Editors' Foreword
p. 245-246
Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
p. 247-263
Generalized Bounded Tree Cover of a Graph
p. 265-280
On Aligned Bar 1-Visibility Graphs
p. 281-312
Vertex-Coloring with Defects
p. 313-340
A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
p. 341-352
Hamiltonian chromatic number of block graphs
p. 353-369
Lower Bounds for Graph Exploration Using Local Policies
p. 371-387

Sommaire du Fascicule no. 4

Essential Constraints of Edge-Constrained Proximity Graphs
p. 389-415
Incremental Network Design with Minimum Spanning Trees
p. 417-432
Drawing Planar Graphs with Reduced Height
p. 433-453
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory
p. 455-489
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms
p. 491-525
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem
p. 527-546
A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints
p. 547-554
A Note on the Existence of All (g,f)-Factors
p. 555-560
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms Experiments
p. 561-588
Topological Decomposition of Directed Graphs
p. 589-630
Ideal Drawings of Rooted Trees With Approximately Optimal Width
p. 631-648
D-resolvability of vertices in planar graphs
p. 649-661
Rooted Cycle Bases
p. 663-686
Egalitarian Graph Orientations
p. 687-708
On the Total Number of Bends for Planar Octilinear Drawings
p. 709-730
Intersection-Link Representations of Graphs
p. 731-755
Progress on Partial Edge Drawings
p. 757-786

Sommaire du Fascicule no. 5

Guest editors' foreword
p. 787-789
A Sparse Stress Model
p. 791-821
Generalized Layerings for Arbitrary and Fixed Drawing Areas
p. 823-856
Node Overlap Removal by Growing a Tree
p. 857-872
Block Crossings in Storyline Visualizations
p. 873-913
Non-aligned Drawings of Planar Graphs
p. 915-937
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane
p. 939-981

Sommaire du Fascicule no. 6

Column planarity and partially-simultaneous geometric embedding
p. 983-1002
Computing phylogenetic trees using topologically related minimum spanning trees
p. 1003-1025
Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing
p. 1027-1038
Parameterized and approximation complexity of the detection pair problem in graphs
p. 1039-1056
Planarity of Overlapping Clusterings Including Unions of Two Partitions
p. 1057-1089
Equitable colorings of $K_4$-minor-free graphs
p. 1091-1105
Graphs with Obstacle Number Greater than One
p. 1107-1119