Pages that link to "Item:Q935846"
From MaRDI portal
The following pages link to Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846):
Displayed 10 items.
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- Comparing trees via crossing minimization (Q988574) (← 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)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Parameterized approaches to orthogonal compaction (Q6169516) (← links)
- An FPT algorithm for bipartite vertex splitting (Q6172201) (← links)