Geodesic

Volume 26 (2022) no. 1

Sommaire

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