Pages that link to "Item:Q2206863"
From MaRDI portal
The following pages link to Exact crossing number parameterized by vertex cover (Q2206863):
Displaying 11 items.
- 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 complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover (Q6610085) (← links)
- Fixed-parameter algorithms for computing RAC drawings of graphs (Q6618251) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)
