Publisher
Springer Nature Switzerland
Reference16 articles.
1. Bentert, M., Koana, T., Niedermeier, R.: The complexity of gerrymandering over graphs: paths and trees. Discret. Appl. Math. 324, 103–112 (2023). https://doi.org/10.1016/j.dam.2022.09.009
2. Chen, J., Cottrell, D.: Evaluating partisan gains from congressional gerrymandering: using computer simulations to estimate the effect of gerrymandering in the U.S. house. Elect. Stud. 44, 329–340 (2016). https://doi.org/10.1016/j.electstud.2016.06.014
3. Chen, J., Rodden, J.: Unintentional gerrymandering: political geography and electoral bias in legislatures. Q. J. Polit. Sci. 8, 239–269 (2013). https://doi.org/10.1561/100.00012033
4. Cho, W.K.T.: Technology-enabled coin flips for judging partisan gerrymandering. South. Calif. Law Rev. 93, 11 (2019). https://southerncalifornialawreview.com/wp-content/uploads/2019/06/93_Cho_Final.pdf
5. Cohen-Zemach, A., Lewenberg, Y., Rosenschein, J.S.: Gerrymandering over graphs. In: Proceedings of the 17th Conference on Autonomous Agents and MultiAgent Systems, pp. 274–282. International Foundation for Autonomous Agents and Multiagent Systems (2018). https://doi.org/10.5555/3237383.3237429. https://dl.acm.org/doi/10.5555/3237383.3237429