Pages that link to "Item:Q1627160"
From MaRDI portal
The following pages link to Subexponential-time and FPT algorithms for embedded flat clustered planarity (Q1627160):
Displaying 9 items.
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge (Q2151389) (← links)
- Clustered planarity with pipes (Q2414866) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q6586655) (← links)
