Pages that link to "Item:Q1990291"
From MaRDI portal
The following pages link to On the complexity of Chamberlin-Courant on almost structured profiles (Q1990291):
Displaying 5 items.
- A characterization of the single-peaked single-crossing domain (Q2179455) (← links)
- On the parameterized complexity of party nominations (Q2290374) (← links)
- The complexity of fully proportional representation for single-crossing electorates (Q2513672) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)