Geodesic

Tome 21 (2017) no. 4

Sommaire

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