Geodesic

Sommaire du Fascicule no. 1

The Minimum Moving Spanning Tree Problem
p. 1-18
Restricted rotation distance between k-ary trees
p. 19-33
Efficient Point-to-Point Resistance Distance Queries in Large Graphs
p. 35-44

Sommaire du Fascicule no. 2

Guest Editors’ Foreword
p. 45-47
Arrangements of orthogonal circles with many intersections
p. 49-70
Upward Planar Drawings with Three and More Slopes
p. 49-70
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
p. 71-94
Planar and Toroidal Morphs Made Easier
p. 95-118
Simplifying Non-Simple Fan-Planar Drawings
p. 147-172

Sommaire du Fascicule no. 3

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
p. 173-194
Computing Betweenness Centrality in Link Streams
p. 195-217
Improved (In-)Approximability Bounds for d-Scattered Set
p. 219-238

Sommaire du Fascicule no. 4

Guest Editors' forewords
p. 239-240
Morphing tree drawings in a small 3D grid
p. 241-279
1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
p. 281-327

Sommaire du Fascicule no. 5

Quasipolynomiality of the Smallest Missing Induced Subgraph
p. 329-339
Connected-closeness: A Visual Quantification of Distances in Network Layouts
p. 341-404

Sommaire du Fascicule no. 6

Guest Editors' Foreword
p. 405-408
Order Reconfiguration under Width Constraints
p. 409-431
Approximating the Bundled Crossing Number
p. 433-457
The Complexity of Drawing Graphs on Few Lines and Few Planes
p. 459-488
Inserting Multiple Edges into a Planar Graph
p. 489-522

Sommaire du Fascicule no. 7

Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
p. 523-540
Computing consensus networks for collections of 1-nested phylogenetic networks
p. 541-563
The Complexity of Angular Resolution
p. 565-580
A Heuristic for Direct Product Graph Decomposition
p. 581-601
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs
p. 603-619

Sommaire du Fascicule no. 8

Guest Editors' Foreword
p. 621-623
$st$-Orientations with Few Transitive Edges
p. 625-650
Small Point-Sets Supporting Graph Stories
p. 651-677
Rectilinear Planarity of Partial 2-Trees
p. 679-719
Empty Triangles in Generalized Twisted Drawings of $K_n$
p. 721-735
Effective Computation of a Feedback Arc Set Using PageRank
p. 737-757

Sommaire du Fascicule no. 9

The Computational Complexity of the ChordLink Model
p. 759-767
Minimum Linear Arrangement of Generalized Sierpinski Graphs
p. 767-782
Drawing Order Diagrams Through Two-Dimension Extension
p. 783-802
RAC-Drawability is ∃ℝ-complete and Related Results
p. 803-841
2-Layer Graph Drawings with Bounded Pathwidth
p. 843-851
B0-VPG Representation of AT-free Outerplanar Graphs
p. 853-869