Vol. 26 No. 4 (2022)

Published: 2022-07-01

Parameterized Complexity of Geodetic Set

Leon Kellerhals, Tomohiro Koana

401-419
- article (PDF)
The Complexity of Drawing a Graph in a Polygonal Region

Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal

421-446
- article (PDF)
A Machine Learning Approach for Predicting Human Preference for Graph Layouts

Shijun Cai, Seok-Hee Hong, Jialiang Shen, Tongliang Liu

447-471
- article (PDF)
Drawing Halin-graphs with small height

Therese Biedl, Milap Sheth

473-502
- article (PDF)
Maximal origami flip graphs of flat-foldable vertices: properties and algorithms

Thomas Hull, Manuel Morales, Sarah Nash, Natalya Ter-Saakov

503-517
- article (PDF)
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid

Eranda Çela, Elisabeth Gaar

519-552
- article (PDF)
Finding a Maximum Clique in a Grounded 1-Bend String Graph

J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich

553-575
- article (PDF)
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges

David Bader, Paul Burkhardt

577-588
- article (PDF)
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time

Lorenzo Balzotti, Paolo Franciosa

589-606
- article (PDF)