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]
@inproceedings{JansenKKLMS23,
title = {Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth},
author = {Bart M. P. Jansen and Liana Khazaliya and Philipp Kindermann and Giuseppe Liotta and Fabrizio Montecchiani and Kirill Simonov},
year = {2023},
doi = {10.1007/978-3-031-49275-4_14},
url = {https://doi.org/10.1007/978-3-031-49275-4_14},
researchr = {https://researchr.org/publication/JansenKKLMS23},
cites = {0},
citedby = {0},
pages = {203-217},
booktitle = {Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II},
editor = {Michael A. Bekos and Markus Chimani},
volume = {14466},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-031-49275-4},
}