Pages that link to "Item:Q2936927"

The following pages link to Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q2936927):

Displaying 11 items.

• Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
• The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph (Q1640218) (← links)
• 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
• Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
• A note on the crossing number of the cone of a graph (Q2053697) (← links)
• The Crossing Number of the Cone of a Graph (Q2961536) (← links)
• Track Layout Is Hard (Q2961541) (← links)
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
• Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
• Upward Book Embeddings of st-Graphs (Q5088940) (← links)
• Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)