Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth

Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
January 2023
PDF bib Project Project DOI

Abstract

Full Citation:

Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov. Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos and Markus Chimani), volume 14466 of Lecture Notes in Computer Science, pages 203-217, 2023, Springer.

Type
Conference Paper
PGD ParAI
Liana Khazaliya
Liana Khazaliya

Liana Khazaliya is a Project Assistant at the Algorithms and Complexity Group.