Pages that link to "Item:Q2706134"
From MaRDI portal
The following pages link to On Bipartite Drawings and the Linear Arrangement Problem (Q2706134):
Displayed 14 items.
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- Molecular solution to the optimal linear arrangement problem based on DNA computation (Q937692) (← links)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications (Q944739) (← links)
- Optimal one-page tree embeddings in linear time (Q1014395) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
- The optimal tenement allocation for reducing traffic burden (Q2630839) (← links)
- k-Level Crossing Minimization Is NP-Hard for Trees (Q3078383) (← links)
- Minimum Linear Arrangement of Series-Parallel Graphs (Q3453293) (← links)
- Bounds of the sum of edge lengths in linear arrangements of trees (Q5857519) (← links)
- Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)