Pages that link to "Item:Q5050001"
From MaRDI portal
The following pages link to Parameterized Algorithms for Queue Layouts (Q5050001):
Displaying 7 items.
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (Q1899217) (← links)
- Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)
- A faster parameterized algorithm for bipartite 1-sided vertex explosion (Q6606237) (← 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)
- The parametrized complexity of the segment number (Q6618253) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)