Pages that link to "Item:Q2484013"
From MaRDI portal
The following pages link to An improved bound on the one-sided minimum crossing number in two-layered drawings (Q2484013):
Displaying 12 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)
- Crossing minimization in extended level drawings of graphs (Q968125) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- The slotted online one-sided crossing minimization problem on 2-regular graphs (Q2169959) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Bipartite Graph Representation of Multiple Decision Table Classifiers (Q3646117) (← links)
- Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)
