Pages that link to "Item:Q1882474"
From MaRDI portal
The following pages link to A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation (Q1882474):
Displaying 14 items.
- 2-layer right angle crossing drawings (Q476445) (← links)
- 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)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- The slotted online one-sided crossing minimization problem on 2-regular graphs (Q2169959) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)
- An FPT algorithm for bipartite vertex splitting (Q6172201) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)