The following pages link to Graph Drawing (Q5896903):
Displaying 14 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 parameterized complexity of layered graph drawing (Q958215) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- One-sided weak dominance drawing (Q1711831) (← 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)
- An improved bound on the one-sided minimum crossing number in two-layered drawings (Q2484013) (← links)
- One-dimensional layout optimization, with applications to graph drawing by axis separation (Q2573337) (← links)
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (Q2912885) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- New Approximation to the One-sided Radial Crossing Minimization (Q3184609) (← links)
- (Q4422268) (← links)
- Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)
