{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:00Z","timestamp":1759637880974,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"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-86838-3_15","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"195-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Complexity of Gerrymandering over Graphs: Paths and Trees"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Bentert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomohiro","family":"Koana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"issue":"17","key":"15_CR1","doi-asserted-by":"publisher","first-page":"3601","DOI":"10.1016\/j.dam.2009.06.016","volume":"157","author":"N Apollonio","year":"2009","unstructured":"Apollonio, N., Becker, R.I., Lari, I., Ricca, F., Simeone, B.: Bicolored graph partitioning, or: gerrymandering at its worst. Discret. Appl. Math. 157(17), 3601\u20133614 (2009)","journal-title":"Discret. Appl. Math."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bentert, M., Koana, T., Niedermeier, R.: The complexity of gerrymandering over graphs: paths and trees. CoRR abs\/2102.08905 (2021)","DOI":"10.1007\/978-3-030-86838-3_15"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Borodin, A., Lev, O., Shah, N., Strangway, T.: Big city vs. the great outdoors: voter distribution and how it affects gerrymandering. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018), pp. 98\u2013104. ijcai.org (2018)","DOI":"10.24963\/ijcai.2018\/14"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s10878-020-00589-x","volume":"40","author":"T Chatterjee","year":"2020","unstructured":"Chatterjee, T., DasGupta, B., Palmieri, L., Al-Qurashi, Z., Sidiropoulos, A.: On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering. J. Comb. Optim. 40(2), 512\u2013546 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00589-x","journal-title":"J. Comb. Optim."},{"key":"15_CR5","unstructured":"Cohen-Zemach, A., Lewenberg, Y., Rosenschein, J.S.: Gerrymandering over graphs. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2018), pp. 274\u2013282. International Foundation for Autonomous Agents and Multiagent Systems (2018)"},{"key":"15_CR6","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 the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pp. 1902\u20131909. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5559"},{"key":"15_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s42001-019-00053-9","volume":"2","author":"O Guest","year":"2019","unstructured":"Guest, O., Kanayet, F.J., Love, B.C.: Gerrymandering and computational redistricting. J. Comput. Soc. Sci. 2(2), 119\u2013131 (2019). https:\/\/doi.org\/10.1007\/s42001-019-00053-9","journal-title":"J. Comput. Soc. Sci."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, S., Jain, P., Panolan, F., Roy, S., Saurabh, S.: Gerrymandering on graphs: computational complexity and parameterized algorithms. CoRR abs\/2102.09889 (2021). 14th International Symposium on Algorithmic Game Theory, SAGT (accepted)","DOI":"10.1007\/978-3-030-85947-3_10"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2021.03.037","volume":"868","author":"T Ito","year":"2021","unstructured":"Ito, T., Kamiyama, N., Kobayashi, Y., Okamoto, Y.: Algorithms for gerrymandering over graphs. Theoret. Comput. Sci. 868, 30\u201345 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR11","unstructured":"Lewenberg, Y., Lev, O., Rosenschein, J.S.: Divide and conquer: using geographic manipulation to win district-based elections. In: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017), pp. 624\u2013632. ACM (2017)"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.jcss.2011.02.001","volume":"78","author":"L Mathieson","year":"2012","unstructured":"Mathieson, L., Szeider, S.: Editing graphs to satisfy degree constraints: a parameterized approach. J. Comput. Syst. Sci. 78(1), 179\u2013191 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.2307\/1122527","volume":"87","author":"PH Schuck","year":"1987","unstructured":"Schuck, P.H.: The thickest thicket: partisan gerrymandering and judical regulation of politics. Columbia Law Rev. 87(7), 1325\u20131384 (1987)","journal-title":"Columbia Law Rev."},{"issue":"3","key":"15_CR14","first-page":"543","volume":"33","author":"A Tasn\u00e1di","year":"2011","unstructured":"Tasn\u00e1di, A.: The political districting problem: a survey. Soc. Econ. 33(3), 543\u2013554 (2011)","journal-title":"Soc. Econ."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:02:32Z","timestamp":1702065752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","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 and OCS","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":"30","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":"41% - 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":"11","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":"The conference was held online due to the COVID-19 pandemic.","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)"}}]}}