Pages that link to "Item:Q3000521"
From MaRDI portal
The following pages link to Ranking and Drawing in Subexponential Time (Q3000521):
Displaying 4 items.
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- An FPT algorithm for bipartite vertex splitting (Q6172201) (← links)