Pages that link to "Item:Q958215"

The following pages link to On the parameterized complexity of layered graph drawing (Q958215):

Displaying 21 items.

• A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
• Variable neighborhood search for the vertex separation problem (Q339678) (← links)
• Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs (Q629832) (← links)
• A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
• Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
• Horton-Strahler number, rooted pathwidth and upward drawings of trees (Q2059912) (← links)
• Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
• Parameterized analysis and crossing minimization problems (Q2172859) (← links)
• Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
• Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
• Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
• Ranking and Drawing in Subexponential Time (Q3000521) (← links)
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
• Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
• Cubic Planar Graphs that cannot be Drawn on few Lines (Q5088962) (← links)
• On Layered Fan-Planar Graph Drawings (Q5089175) (← links)
• (Q5111885) (← links)
• Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
• 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)