Geodesic

Volume 26 (2022) no. 4

Sommaire

Parameterized Complexity of Geodetic Set
p. 401-419
The Complexity of Drawing a Graph in a Polygonal Region
p. 421-446
A Machine Learning Approach for Predicting Human Preference for Graph Layouts
p. 447-471
Drawing Halin-graphs with small height
p. 473-502
Maximal origami flip graphs of flat-foldable vertices: properties and algorithms
p. 503-517
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
p. 519-552
Finding a Maximum Clique in a Grounded 1-Bend String Graph
p. 553-575
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
p. 577-588
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
p. 589-606