Pages that link to "Item:Q3511416"
From MaRDI portal
The following pages link to Fixed-Parameter Algorithms for Kemeny Scores (Q3511416):
Displayed 8 items.
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Improved Parameterized Algorithms for the Kemeny Aggregation Problem (Q3656872) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)