The following pages link to (Q3745305):
Displaying 12 items.
- Planar acyclic computation (Q751805) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number (Q2150579) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- Book embeddability of series-parallel digraphs (Q2505497) (← links)
- Characterization of nonsingular book graphs (Q2911961) (← links)
- (Q4576348) (← links)
- Experimental Evaluation of Book Drawing Algorithms (Q4625114) (← links)
- Degree constrained book embeddings (Q4806603) (← links)
- Book embeddings and crossing numbers (Q6184374) (← links)
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover (Q6610085) (← links)