{"id":"https://openalex.org/W3130683151","doi":"https://doi.org/10.1007/s10458-022-09594-2","title":"A refined complexity analysis of fair districting over graphs","display_name":"A refined complexity analysis of fair districting over graphs","publication_year":2022,"publication_date":"2022-12-28","ids":{"openalex":"https://openalex.org/W3130683151","doi":"https://doi.org/10.1007/s10458-022-09594-2","mag":"3130683151"},"language":"en","primary_location":{"id":"doi:10.1007/s10458-022-09594-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10458-022-09594-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10458-022-09594-2.pdf","source":{"id":"https://openalex.org/S5405189","display_name":"Autonomous Agents and Multi-Agent Systems","issn_l":"1387-2532","issn":["1387-2532","1573-7454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Agents and Multi-Agent Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10458-022-09594-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052325149","display_name":"Niclas Boehmer","orcid":"https://orcid.org/0000-0001-5102-449X"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Niclas Boehmer","raw_affiliation_strings":["Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, 10623, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5102-449X","affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088434500","display_name":"Tomohiro Koana","orcid":"https://orcid.org/0000-0002-8684-0611"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tomohiro Koana","raw_affiliation_strings":["Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, 10623, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, 10623, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052325149"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.1329,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.40245388,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"37","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9295583367347717},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6272580623626709},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6229562759399414},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5966202020645142},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5766292810440063},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5281348824501038},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5074509978294373},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4620693325996399},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46150898933410645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4447760283946991},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4442320466041565},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4260384738445282},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4076090157032013},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21394693851470947},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.17149391770362854},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09879469871520996}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9295583367347717},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6272580623626709},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6229562759399414},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5966202020645142},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5766292810440063},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5281348824501038},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5074509978294373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4620693325996399},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46150898933410645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4447760283946991},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4442320466041565},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4260384738445282},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4076090157032013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21394693851470947},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.17149391770362854},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09879469871520996}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10458-022-09594-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10458-022-09594-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10458-022-09594-2.pdf","source":{"id":"https://openalex.org/S5405189","display_name":"Autonomous Agents and Multi-Agent Systems","issn_l":"1387-2532","issn":["1387-2532","1573-7454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Agents and Multi-Agent Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10458-022-09594-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10458-022-09594-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10458-022-09594-2.pdf","source":{"id":"https://openalex.org/S5405189","display_name":"Autonomous Agents and Multi-Agent Systems","issn_l":"1387-2532","issn":["1387-2532","1573-7454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Agents and Multi-Agent Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G100663255","display_name":null,"funder_award_id":"NI 369/21","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G1814917559","display_name":null,"funder_award_id":"NI 369/22","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G2475015481","display_name":null,"funder_award_id":"NI/369-18","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8056830759","display_name":null,"funder_award_id":"NI 369/19","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320324094","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3130683151.pdf","grobid_xml":"https://content.openalex.org/works/W3130683151.grobid-xml"},"referenced_works_count":59,"referenced_works":["https://openalex.org/W143512583","https://openalex.org/W1000874833","https://openalex.org/W1507293825","https://openalex.org/W1536918079","https://openalex.org/W1579513228","https://openalex.org/W1597666737","https://openalex.org/W1602522099","https://openalex.org/W1970776799","https://openalex.org/W1978729290","https://openalex.org/W2002805364","https://openalex.org/W2008816808","https://openalex.org/W2011105641","https://openalex.org/W2020712831","https://openalex.org/W2023591708","https://openalex.org/W2026129593","https://openalex.org/W2063619312","https://openalex.org/W2065358633","https://openalex.org/W2102389282","https://openalex.org/W2114616381","https://openalex.org/W2124718373","https://openalex.org/W2131577826","https://openalex.org/W2132060956","https://openalex.org/W2146018788","https://openalex.org/W2154843747","https://openalex.org/W2162561603","https://openalex.org/W2166566648","https://openalex.org/W2167815360","https://openalex.org/W2464078358","https://openalex.org/W2621346283","https://openalex.org/W2808231492","https://openalex.org/W2964635954","https://openalex.org/W2972692746","https://openalex.org/W2996780069","https://openalex.org/W2996961193","https://openalex.org/W3035351045","https://openalex.org/W3049503655","https://openalex.org/W3100310057","https://openalex.org/W3102164014","https://openalex.org/W3123020175","https://openalex.org/W3125499885","https://openalex.org/W3125619035","https://openalex.org/W3128536916","https://openalex.org/W3144552872","https://openalex.org/W3163523878","https://openalex.org/W3195908384","https://openalex.org/W3202008368","https://openalex.org/W3203012417","https://openalex.org/W3203672403","https://openalex.org/W4206619443","https://openalex.org/W4213183334","https://openalex.org/W4213368513","https://openalex.org/W4256516313","https://openalex.org/W4306405472","https://openalex.org/W6635898413","https://openalex.org/W6674900166","https://openalex.org/W6719428738","https://openalex.org/W6752340541","https://openalex.org/W6772522895","https://openalex.org/W6838453855"],"related_works":["https://openalex.org/W2075531723","https://openalex.org/W2113684989","https://openalex.org/W4389814085","https://openalex.org/W1531868704","https://openalex.org/W4285659194","https://openalex.org/W2039168577","https://openalex.org/W3048010228","https://openalex.org/W3031065515","https://openalex.org/W2171811389","https://openalex.org/W2041837101"],"abstract_inverted_index":{"Abstract":[0],"We":[1,117,183],"study":[2],"the":[3,35,50,102,123,155,177,194,204],"NP-hard":[4,150],"Fair":[5,55,128],"Connected":[6,56,129],"Districting":[7,57,130],"problem":[8],"recently":[9],"proposed":[10],"by":[11,60,73,154],"Stoica":[12],"et":[13],"al.":[14],"[AAMAS":[15],"2020]:":[16],"Partition":[17],"a":[18,42,76,96,119,161,185,201],"vertex-colored":[19],"graph":[20,169],"into":[21,82],"k":[22],"connected":[23],"components":[24],"(subsequently":[25],"referred":[26],"to":[27,79,106,167,190],"as":[28],"districts)":[29],"so":[30],"that":[31,136],"in":[32,75,95,99],"every":[33],"district":[34],"most":[36,41,52],"frequent":[37,53],"color":[38],"occurs":[39],"at":[40],"given":[43],"number":[44],"of":[45,66,101,113,122,127,179,193],"times":[46],"more":[47],"often":[48],"than":[49],"second":[51],"color.":[54],"is":[58,105,138],"motivated":[59],"various":[61,168],"real-world":[62],"scenarios":[63],"where":[64],"agents":[65],"different":[67],"types,":[68],"which":[69],"are":[70],"one-to-one":[71],"represented":[72],"nodes":[74],"network,":[77],"have":[78],"be":[80],"partitioned":[81],"disjoint":[83],"districts.":[84,103,182],"Herein,":[85],"one":[86],"strives":[87],"for":[88],"\u201cfair":[89],"districts\u201d":[90],"without":[91],"any":[92,100],"type":[93],"being":[94],"dominating":[97],"majority":[98],"This":[104],"e.g.":[107],"prevent":[108],"segregation":[109],"or":[110],"political":[111,115],"domination":[112],"some":[114],"party.":[116],"conduct":[118],"fine-grained":[120],"analysis":[121,164],"(parameterized)":[124],"computational":[125],"complexity":[126,163,197,205],".":[131],"In":[132],"particular,":[133],"we":[134,159],"prove":[135],"it":[137],"polynomial-time":[139],"solvable":[140],"on":[141,151],"paths,":[142],"cycles,":[143],"stars,":[144],"and":[145,173,181,187,210],"caterpillars,":[146],"but":[147],"already":[148],"becomes":[149],"trees.":[152],"Motivated":[153],"latter":[156],"negative":[157],"result,":[158],"perform":[160],"parameterized":[162,196],"with":[165],"respect":[166],"parameters":[170],"including":[171],"treewidth,":[172],"problem-specific":[174],"parameters,":[175],"including,":[176],"numbers":[178],"colors":[180],"obtain":[184],"rich":[186],"diverse,":[188],"close":[189],"complete":[191],"picture":[192],"corresponding":[195],"landscape":[198],"(that":[199],"is,":[200],"classification":[202],"along":[203],"classes":[206],"FPT,":[207],"XP,":[208],"W[1]-hard,":[209],"para-NP-hard).":[211]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}