Geodesic

Sommaire du Fascicule no. 1

The Complexity of Poset Games
p. 1-14
Visibility Graphs of Anchor Polygons
p. 15-34
The Degenerate Crossing Number and Higher-Genus Embeddings
p. 35-58
Drawing outer-1-planar graphs revisited
p. 59-73
A short proof of the non-biplanarity of $K_9$
p. 75-80
Non-binary universal tree-based networks
p. 81-90
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
p. 91-110
Properties of Large 2-Crossing-Critical Graphs
p. 111-147
Crossing Numbers of Beyond-Planar Graphs Revisited
p. 149-170
Upward planar drawings with two slopes
p. 171-198
A faster algorithm for maximum independent set on interval filament graphs
p. 199-205

Sommaire du Fascicule no. 2

Guest Editors’ Foreword
p. 207-208
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
p. 209-224
On Compatible Matchings
p. 225-240
Computing L(p,1)-Labeling with Combined Parameters
p. 241-255
An Improvement of Reed’s Treewidth Approximation
p. 257-282

Sommaire du Fascicule no. 3

Editor in Chief's Foreword
p. 283-284
On Turn-Regular Orthogonal Representations
p. 285-306
Planar L-Drawings of Bimodal Graphs
p. 307-334
Parameterized Algorithms for Queue Layouts
p. 335-352
Drawing Shortest Paths in Geodetic Graphs
p. 353-361
Polygons with Prescribed Angles in 2D and 3D
p. 363-380
On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens
p. 381-399

Sommaire du Fascicule no. 4

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