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. Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. In Michael A. Bekos, Markus Chimani, editors, Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II. Volume 14466 of Lecture Notes in Computer Science, pages 203-217, Springer, 2023. [doi]

Authors

Bart M. P. Jansen

This author has not been identified. Look up 'Bart M. P. Jansen' in Google

Liana Khazaliya

This author has not been identified. Look up 'Liana Khazaliya' in Google

Philipp Kindermann

This author has not been identified. Look up 'Philipp Kindermann' in Google

Giuseppe Liotta

This author has not been identified. Look up 'Giuseppe Liotta' in Google

Fabrizio Montecchiani

This author has not been identified. Look up 'Fabrizio Montecchiani' in Google

Kirill Simonov

This author has not been identified. Look up 'Kirill Simonov' in Google