The following pages link to (Q4422268):
Displaying 8 items.
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation (Q1882474) (← links)
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees (Q2867670) (← links)
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (Q2912885) (← links)
- (Q5075824) (← links)
- Graph Drawing (Q5896903) (← links)
