Geodesic

Sommaire du Fascicule no. 1

Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width)
p. 1-19
On the Circumference of Essentially 4-connected Planar Graphs
p. 21-46
Reconfiguring Minimum Dominating Sets in Trees
p. 47-61

Sommaire du Fascicule no. 2

Guest Editors' Foreword
p. 63-64
Weighted Upper Edge Cover: Complexity and Approximability
p. 65-88
Efficient Algorithm for Box Folding
p. 89-103
Drawing Clustered Planar Graphs on Disk Arrangements
p. 105-131

Sommaire du Fascicule no. 3

Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
p. 133-153
Maximum Cut Parameterized by Crossing Number
p. 155-170
On the Approximability of the Minimum Weight $t$-partite Clique Problem
p. 171-190
Bounds and algorithms for graph trusses
p. 191-214
Parameterized Complexity of Safe Set
p. 215-245
A Note on Universal Point Sets for Planar Graphs
p. 247-267
Graph Stories in Small Area
p. 269-292
Not all planar graphs are in PURE-4-DIR
p. 293-301
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
p. 303-322
Improved Bounds for Track Numbers of Planar Graphs
p. 323-341
On L-shaped point set embeddings of trees: first non-embeddable examples
p. 343-369
Graph Motif Problems Parameterized by Dual
p. 371-396
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm
p. 397-421
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
p. 421-432
Enumerating Grid Layouts of Graphs
p. 433-460
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth
p. 461-482
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
p. 483-522
Problems on One Way Road Networks
p. 523-546

Sommaire du Fascicule no. 4

Guest editors' foreword
p. 547-549
Minimal Representations of Order Types by Geometric Graphs
p. 551-572
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
p. 573-601
Parameterized Algorithms for Book Embedding Problems
p. 603-620
Bundled Crossings Revisited
p. 621-655
Recognizing Stick Graphs with and without Length Constraints
p. 657-681
Node Overlap Removal Algorithms: an Extended Comparative Study
p. 683-706