The following pages link to (Q3043710):
Displaying 14 items.
- Ranking chain sum orders (Q290525) (← links)
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- 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 complexity of crossings in permutations (Q1011761) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- One-sided weak dominance drawing (Q1711831) (← 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)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- k-Level Crossing Minimization Is NP-Hard for Trees (Q3078383) (← links)
- Link crossing number is NP-hard (Q5118878) (← links)
