Pages that link to "Item:Q5141644"
From MaRDI portal
The following pages link to Parameterized Algorithms for Book Embedding Problems (Q5141644):
Displaying 17 items.
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering (Q2034395) (← 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 complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Degree constrained book embeddings (Q4806603) (← links)
- Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← 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)
- Parameterized complexity of simultaneous planarity (Q6618252) (← links)
- The parametrized complexity of the segment number (Q6618253) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)
