{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T00:38:46Z","timestamp":1777077526260,"version":"3.51.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030859466","type":"print"},{"value":"9783030859473","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_10","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"140-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Gerrymandering on Graphs: Computational Complexity and\u00a0Parameterized Algorithms"],"prefix":"10.1007","author":[{"given":"Sushmita","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pallavi","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjukta","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Bentert, M., Koana, T., Niedermeier, R.: The complexity of gerrymandering over graphs: paths and trees. arXiv preprint arXiv:2102.08905 (2021)","DOI":"10.1007\/978-3-030-86838-3_15"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.ic.2009.10.001","volume":"208","author":"N Betzler","year":"2010","unstructured":"Betzler, N., Guo, J., Niedermeier, R.: Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. 208(2), 165\u2013177 (2010)","journal-title":"Inf. Comput."},{"issue":"52","key":"10_CR3","doi-asserted-by":"publisher","first-page":"5425","DOI":"10.1016\/j.tcs.2009.05.029","volume":"410","author":"N Betzler","year":"2009","unstructured":"Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52), 5425\u20135442 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/140978880","volume":"29","author":"RV Bevern","year":"2015","unstructured":"Bevern, R.V., Bredereck, R., Chen, J., Froese, V., Niedermeier, R., Woeginger, G.J.: Network-based vertex dissolution. SIDMA 29(2), 888\u2013914 (2015)","journal-title":"SIDMA"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jcss.2017.03.003","volume":"87","author":"A Bj\u00f6rklund","year":"2017","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. 87, 119\u2013139 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Brubach, B., Srinivasan, A., Zhao, S.: Meddling metrics: the effects of measuring and constraining partisan gerrymandering on voter incentives. In: Proceedings of EC 2020, pp. 815\u2013833 (2020)","DOI":"10.1145\/3391403.3399529"},{"issue":"60","key":"10_CR7","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1177\/1065912907305681","volume":"3","author":"E Clough","year":"2007","unstructured":"Clough, E.: Talking locally and voting globally: Duverger\u2019s law and homogeneous discussion networks. Political Res. Q. 3(60), 531\u2013540 (2007)","journal-title":"Political Res. Q."},{"key":"10_CR8","unstructured":"Cohen-Zemach, A., Lewenberg, Y., Rosenschein, J.S.: Gerrymandering over graphs. In: Proceedings of AAMAS 2018, pp. 274\u2013282 (2018)"},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"40\u201342","key":"10_CR10","doi-asserted-by":"publisher","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","volume":"411","author":"M Cygan","year":"2010","unstructured":"Cygan, M., Pilipczuk, M.: Exact and approximate bandwidth. Theor. Comput. Sci. 411(40\u201342), 3701\u20133713 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR11","unstructured":"Dey, P.: Gerrymandering: a briber\u2019s perspective. arXiv:1909.01583 (2019)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2019.03.022","volume":"783","author":"P Dey","year":"2019","unstructured":"Dey, P., Misra, N., Narahari, Y.: Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. Theor. Comput. Sci. 783, 53\u201370 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR13","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"key":"10_CR14","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Eiben, E., Fomin, F.V., Panolan, F., Simonov, K.: Manipulating districts to win elections: fine-grained complexity. In: Proceedings of AAAI 2020 (2020)","DOI":"10.1609\/aaai.v34i02.5559"},{"key":"10_CR16","unstructured":"Ellenberg, J.: How computers turned gerrymandering into a science. New York Times, October 2017"},{"issue":"66","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.2307\/1957176","volume":"4","author":"RS Erikson","year":"1972","unstructured":"Erikson, R.S.: Malapportionment, gerrymandering, and party fortunes in congressional elections. Am. Political Sci. Rev. 4(66), 1234\u20131245 (1972)","journal-title":"Am. Political Sci. Rev."},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-68880-8_17","volume-title":"Algorithmic Aspects in Information and Management","author":"P Faliszewski","year":"2008","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Copeland voting fully resists constructive control. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 165\u2013176. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68880-8_17"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. JAIR 35, 275\u2013341 (2009)","journal-title":"JAIR"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s10100-016-0454-7","volume":"25","author":"B Fleiner","year":"2017","unstructured":"Fleiner, B., Nagy, B., Tasn\u00e1di, A.: Optimal partisan districting on planar geographies. Cent. Eur. J. Oper. Res. 25(4), 879\u2013888 (2017)","journal-title":"Cent. Eur. J. Oper. Res."},{"issue":"4","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2886094","volume":"63","author":"FV Fomin","year":"2016","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 1\u201360 (2016)","journal-title":"J. ACM"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Gupta, S., Jain, P., Panolan, F., Roy, S., Saurabh, S.: Gerrymandering on graphs: computational complexity and parameterized algorithms. arXiv preprint arXiv:2102.09889 (2021)","DOI":"10.1007\/978-3-030-85947-3_10"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"593","DOI":"10.2307\/1342611","volume":"116","author":"S Issacharoff","year":"2002","unstructured":"Issacharoff, S.: Gerrymandering and political cartels. Harvard Law Rev. 116, 593\u2013648 (2002)","journal-title":"Harvard Law Rev."},{"key":"10_CR24","unstructured":"Ito, T., Kamiyama, N., Kobayashi, Y., Okamoto, Y.: Algorithms for gerrymandering over graphs. In: Proceedings of AAMAS 2019 (2019)"},{"key":"10_CR25","unstructured":"Xia, L., Zuckerman, M., Procaccia, A.D., Conitzer, V., Rosenschein, J.S.: Complexity of unweighted coalitional manipulation under some common voting rules. In: Proceedings of IJCAI 2019 (2009)"},{"key":"10_CR26","unstructured":"Lewenberg, Y., Lev, O., Rosenschein, J.S.: Divide and conquer: using geographic manipulation to win district-based elections. In: Proceedings of AAMAS 2017 (2017)"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Moenck, R.T.: Practical fast polynomial multiplication. In: Proceedings of SYMSAC 1976, pp. 136\u2013148 (1976)","DOI":"10.1145\/800205.806332"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Monien, B.: How to find long paths efficiently. In: North-Holland Mathematics Studies, vol. 109, pp. 239\u2013254. Elsevier (1985)","DOI":"10.1016\/S0304-0208(08)73110-4"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Neidermeier, R.: Invitation to Fixed-Parameter Algorithms. Springer (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1","key":"10_CR30","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.econlet.2009.06.008","volume":"105","author":"C Puppe","year":"2009","unstructured":"Puppe, C., Tasn\u00e1di, A.: Optimal redistricting under geographical constraints: why \u201cpack and crack\u2019\u2019 does not work. Econ. Lett. 105(1), 93\u201396 (2009)","journal-title":"Econ. Lett."},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2017.10.028","volume":"708","author":"N Talmon","year":"2018","unstructured":"Talmon, N.: Structured proportional representation. Theor. Comput. Sci. 708, 58\u201374 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"10_CR32","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ipl.2008.11.004","volume":"109","author":"R Williams","year":"2009","unstructured":"Williams, R.: Finding paths of length $$k$$ in $${O}^\\star (2^k)$$ time. Inf. Process. Lett. 109(6), 315\u2013318 (2009)","journal-title":"Inf. Process. Lett."},{"key":"10_CR33","unstructured":"Wines, M.: What is gerrymandering? And how does it work? New York Times, June 2019"},{"issue":"2","key":"10_CR34","first-page":"392","volume":"173","author":"M Zuckerman","year":"2009","unstructured":"Zuckerman, M., Procaccia, A.D., Rosenschein, J.S.: Algorithms for the coalitional manipulation problem. JAIR 173(2), 392\u2013412 (2009)","journal-title":"JAIR"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85947-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T14:10:10Z","timestamp":1641996610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 abstracts of presented papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}