Pages that link to "Item:Q935846"
From MaRDI portal
The following pages link to Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846):
Displaying 12 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)
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation (Q1882474) (← 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)
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (Q2912885) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- (Q4422268) (← links)
- Graph Drawing (Q5896903) (← links)