Pages that link to "Item:Q2071827"
From MaRDI portal
The following pages link to Orthogonal planarity testing of bounded treewidth graphs (Q2071827):
Displaying 13 items.
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- (Q4635977) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time (Q6053468) (← links)
- Rectilinear planarity of partial 2-trees (Q6117043) (← links)
- Testing upward planarity of partial 2-trees (Q6117044) (← links)
- Rectilinear Planarity of Partial 2-Trees (Q6141789) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- Recognizing map graphs of bounded treewidth (Q6182682) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6618248) (← links)
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth (Q6618262) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6623586) (← links)
