Pages that link to "Item:Q284334"
From MaRDI portal
The following pages link to A faster fixed parameter algorithm for two-layer crossing minimization (Q284334):
Displaying 14 items.
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Counting edge crossings in a 2-layered drawing (Q2390316) (← links)
- An improved bound on the one-sided minimum crossing number in two-layered drawings (Q2484013) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (Q2912885) (← links)
- Simple and Efficient Bilayer Cross Counting (Q3378492) (← links)
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (Q4381060) (← links)
- (Q4422268) (← links)
- An SDP approach to multi-level crossing minimization (Q5406272) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711526) (← links)
- Quantum graph drawing (best student paper) (Q6575378) (← links)
