Geodesic

Tome 19 (2015) no. 1

Sommaire

Two-floor buildings need eight colors
p. 1-9
Optimal Data Structures for Farthest-Point Queries in Cactus Networks
p. 11-41
Triangulations with Circular Arcs
p. 43-65
1-Planarity of Graphs with a Rotation System
p. 67-86
Monotone Simultaneous Embeddings of Upward Planar Digraphs
p. 87-110
Ordering Metro Lines by Block Crossings
p. 111-153
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
p. 155-190
Algorithms for the Hypergraph and the Minor Crossing Number Problems
p. 191-222
A Distributed Algorithm for Minimum Distance-k Domination in Trees
p. 223-242
Point-Set Embedding in Three Dimensions
p. 243-257
The Complexity of Simultaneous Geometric Graph Embedding
p. 259-272
A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality
p. 273-280
Planar Induced Subgraphs of Sparse Graphs
p. 281-297
Every graph admits an unambiguous bold drawing
p. 299-312
Metric Dimension Parameterized by Max Leaf Number
p. 313-323
On Low Treewidth Graphs and Supertrees
p. 325-343
On k-visibility graphs
p. 345-360
Embeddings Between Hypercubes and Hypertrees
p. 361-373
Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
p. 375-391
Drawing Graphs with Few Arcs
p. 393-412
Fitting Planar Graphs on Planar Maps
p. 413-440
Graph Orientations Optimizing the Number of Light or Heavy Vertices
p. 441-465
Straight-Line Triangle Representations via Schnyder Labelings
p. 467-505
The Min-Max Edge q-Coloring Problem
p. 507-528
On Universal Point Sets for Planar Graphs
p. 529-547
Connected (s,t)-Vertex Separator Parameterized by Chordality
p. 549-565