Pages that link to "Item:Q2463791"
From MaRDI portal
The following pages link to On complexity of lobbying in multiple referenda (Q2463791):
Displayed 6 items.
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
- On complexity of lobbying in multiple referenda (Q2463791) (← links)
- Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)
- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems (Q5505642) (← links)