Upward and orthogonal planarity are W[1]-hard parameterized by treewidth

DOI10.1007/978-3-031-49275-4_14MaRDI QIDQ6618262

Kirill Simonov, Philipp Kindermann, Unnamed Author, Bart M. P. Jansen, Giuseppe Liotta, Fabrizio Montecchiani

Publication date: 14 October 2024

zbMATH Keywords

treewidthparameterized complexityupward planarityrectilinear planarity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: Upward and orthogonal planarity are W[1]-hard parameterized by treewidth