Pages that link to "Item:Q1046263"
From MaRDI portal
The following pages link to Optimal redistricting under geographical constraints: why ``pack and crack'' does not work (Q1046263):
Displaying 19 items.
- On avoiding vote swapping (Q284364) (← links)
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- Optimal partisan districting on planar geographies (Q1642801) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Fair redistricting is hard (Q2272397) (← links)
- A discrete districting plan (Q2303654) (← links)
- A computational approach to unbiased districting (Q2389779) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- The Self-Limiting Partisan Gerrymander: An Optimization Approach (Q3195423) (← links)
- Redistricting without gerrymandering, utilizing the convexity ratio, and other applications to business and industry (Q4627103) (← links)
- Redistricting algorithms (Q5050043) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- A fast sorting algorithm to redistricting election model (Q5320504) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Optimality and fairness of partisan gerrymandering (Q6120899) (← links)
- Padding and pruning: gerrymandering under turnout heterogeneity (Q6624516) (← links)
