Pages that link to "Item:Q4600735"
From MaRDI portal
The following pages link to Parameterized Complexity of 1-Planarity (Q4600735):
Displayed 21 items.
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- Testing gap \(k\)-planarity is NP-complete (Q2032139) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number (Q2150579) (← links)
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge (Q2151389) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Beyond Planar Graphs: Introduction (Q5001653) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- Algorithms for 1-Planar Graphs (Q5001657) (← links)
- Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) (← links)
- $$\textit{\textbf{k}}$$-Planar Graphs (Q5001659) (← links)
- A Tipping Point for the Planarity of Small and Medium Sized Graphs (Q5014116) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- Weak-dynamic coloring of graphs beyond-planarity (Q6144496) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- Parameterized approaches to orthogonal compaction (Q6169516) (← links)