Pages that link to "Item:Q2266990"
From MaRDI portal
The following pages link to Parameterized computational complexity of Dodgson and Young elections (Q2266990):
Displaying 15 items.
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- On stable rules for selecting committees (Q2358564) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- Dealing with several parameterized problems by random methods (Q2636503) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Socially desirable approximations for dodgson’s voting rule (Q5501960) (← links)
