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

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov

Journal title: Lecture Notes in Computer Science, Graph Drawing and Network Visualization

Journal publisher: Springer

Published year: 2024

Published pages: 203-217

DOI identifier: 10.1007/978-3-031-49275-4_14