Pages that link to "Item:Q2842148"
From MaRDI portal
The following pages link to Parameterized Complexity of 1-Planarity (Q2842148):
Displaying 15 items.
- Outer 1-planar graphs (Q289919) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- A note on 1-planar graphs (Q401145) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- Remarks on the joins of 1-planar graphs (Q2286052) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Track Layout Is Hard (Q2961541) (← links)
