Vol. 26 No. 1 (2022)

Published: 2022-01-01

The Complexity of Poset Games

Stephen Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf

1-14
- article (PDF)
Visibility Graphs of Anchor Polygons

Hossein Boomari, Alireza Zarei

15-34
- article (PDF)
The Degenerate Crossing Number and Higher-Genus Embeddings

Marcus Schaefer, Daniel Štefankovič

35-58
- article (PDF)
Drawing outer-1-planar graphs revisited

Therese Biedl

59-73
- article (PDF)
A short proof of the non-biplanarity of $K_9$

Ahmad Biniaz

75-80
- article (PDF)
Non-binary universal tree-based networks

Mareike Fischer, Michelle Galla, Kristina Wicke

81-90
- article (PDF)
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs

Vahan Mkrtchyan, Garik Petrosyan

91-110
- article (PDF)
Properties of Large 2-Crossing-Critical Graphs

Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko Wagner, Tilo Wiedera

111-147
- article (PDF)
Crossing Numbers of Beyond-Planar Graphs Revisited

Nathan van Beusekom, Irene Parada, Bettina Speckmann

149-170
- article (PDF)
Upward planar drawings with two slopes

Jonathan Klawitter, Tamara Mchedlidze

171-198
- article (PDF)
A faster algorithm for maximum independent set on interval filament graphs

Darcy Best, Max Ward

199-205
- article (PDF)