{"id":"https://openalex.org/W3175128778","doi":"https://doi.org/10.24963/ijcai.2021/20","title":"The Parameterized Complexity of Connected Fair Division","display_name":"The Parameterized Complexity of Connected Fair Division","publication_year":2021,"publication_date":"2021-08-01","ids":{"openalex":"https://openalex.org/W3175128778","doi":"https://doi.org/10.24963/ijcai.2021/20","mag":"3175128778"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2021/20","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/20","pdf_url":"https://www.ijcai.org/proceedings/2021/0020.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2021/0020.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048361071","display_name":"Argyrios Deligkas","orcid":"https://orcid.org/0000-0002-6513-6748"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Argyrios Deligkas","raw_affiliation_strings":["Royal Holloway, University of London, UK"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066848088","display_name":"Eduard Eiben","orcid":"https://orcid.org/0000-0003-2628-3435"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Eduard Eiben","raw_affiliation_strings":["Royal Holloway, University of London, UK"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Robert Ganian","raw_affiliation_strings":["TU Wien, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034753800","display_name":"Thekla Hamm","orcid":"https://orcid.org/0000-0002-4595-9982"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Thekla Hamm","raw_affiliation_strings":["TU Wien, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017076947","display_name":"Sebastian Ordyniak","orcid":"https://orcid.org/0000-0003-1935-651X"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sebastian Ordyniak","raw_affiliation_strings":["University of Leeds, UK"],"affiliations":[{"raw_affiliation_string":"University of Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5048361071"],"corresponding_institution_ids":["https://openalex.org/I184558857"],"apc_list":null,"apc_paid":null,"fwci":1.8176,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.8715111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"139","last_page":"145"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9958000183105469,"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.9958000183105469,"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.9950000047683716,"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.9947999715805054,"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.8767099976539612},{"id":"https://openalex.org/keywords/fair-division","display_name":"Fair division","score":0.7090730667114258},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.67139732837677},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5795377492904663},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5768753290176392},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.537172257900238},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.5111096501350403},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5079875588417053},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.48597702383995056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46743953227996826},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4537196755409241},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42939409613609314},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4225486218929291},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4073020815849304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4049207866191864},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26902449131011963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2520946264266968},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.11626353859901428},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07784342765808105}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8767099976539612},{"id":"https://openalex.org/C184659173","wikidata":"https://www.wikidata.org/wiki/Q1511081","display_name":"Fair division","level":2,"score":0.7090730667114258},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.67139732837677},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5795377492904663},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5768753290176392},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.537172257900238},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.5111096501350403},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5079875588417053},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.48597702383995056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46743953227996826},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4537196755409241},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42939409613609314},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4225486218929291},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4073020815849304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4049207866191864},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26902449131011963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2520946264266968},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.11626353859901428},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07784342765808105},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2021/20","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/20","pdf_url":"https://www.ijcai.org/proceedings/2021/0020.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2021/20","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/20","pdf_url":"https://www.ijcai.org/proceedings/2021/0020.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1382289185","display_name":null,"funder_award_id":"Y1329","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G1762991518","display_name":null,"funder_award_id":"EP/V00252X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G1975729292","display_name":null,"funder_award_id":"W1255-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G2533745686","display_name":"Next Generation of Algorithms for Mixed Integer Linear Programming (MILP)","funder_award_id":"EP/V00252X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7508292435","display_name":null,"funder_award_id":"Y1329","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8159133586","display_name":null,"funder_award_id":"P31336","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8184292771","display_name":null,"funder_award_id":"Project","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8680849391","display_name":null,"funder_award_id":"W1255","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3175128778.pdf","grobid_xml":"https://content.openalex.org/works/W3175128778.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W299335109","https://openalex.org/W1511472641","https://openalex.org/W1556562107","https://openalex.org/W2022749618","https://openalex.org/W2053991811","https://openalex.org/W2063525042","https://openalex.org/W2063951771","https://openalex.org/W2114616381","https://openalex.org/W2150409561","https://openalex.org/W2164749099","https://openalex.org/W2346164124","https://openalex.org/W2469470624","https://openalex.org/W2499626972","https://openalex.org/W2572666084","https://openalex.org/W2776064821","https://openalex.org/W2807881654","https://openalex.org/W2808072441","https://openalex.org/W2808696501","https://openalex.org/W2889292676","https://openalex.org/W2900278988","https://openalex.org/W2914414140","https://openalex.org/W2950414403","https://openalex.org/W2963558504","https://openalex.org/W2964097389","https://openalex.org/W2964250178","https://openalex.org/W2965669729","https://openalex.org/W2996979553","https://openalex.org/W2996991938","https://openalex.org/W3035515553","https://openalex.org/W3124038879","https://openalex.org/W3216166910","https://openalex.org/W4230883182"],"related_works":["https://openalex.org/W2962747312","https://openalex.org/W3135652805","https://openalex.org/W2800485060","https://openalex.org/W3022168212","https://openalex.org/W4220735480","https://openalex.org/W1584965761","https://openalex.org/W4302399289","https://openalex.org/W4288284529","https://openalex.org/W2950413521","https://openalex.org/W3175128778"],"abstract_inverted_index":{"We":[0,38,96],"study":[1],"the":[2,10,22,86,89,100,109,119,152],"Connected":[3],"Fair":[4],"Division":[5],"problem":[6,12,101],"(CFD),":[7],"which":[8],"generalizes":[9],"fundamental":[11],"of":[13,49,66,106,111,116,121,147],"fairly":[14],"allocating":[15],"resources":[16],"to":[17,25,78,83,133,139],"agents":[18,87,112],"by":[19,43,103],"requiring":[20],"that":[21,77,132],"items":[23],"allocated":[24],"each":[26],"agent":[27,122],"form":[28],"a":[29,33,45,93,143],"connected":[30],"subgraph":[31],"in":[32,92],"provided":[34],"item":[35,90,154],"graph":[36,91],"G.":[37],"expand":[39],"on":[40,52],"previous":[41],"results":[42],"providing":[44],"comprehensive":[46],"complexity-theoretic":[47],"understanding":[48],"CFD":[50],"based":[51],"several":[53,63],"new":[54],"algorithms":[55],"and":[56,71,88,113],"lower":[57,127],"bounds":[58],"while":[59],"taking":[60],"into":[61],"account":[62],"well-established":[64],"notions":[65],"fairness:":[67],"proportionality,":[68],"envy-freeness,":[69],"EF1":[70],"EFX.":[72],"In":[73],"particular,":[74],"we":[75,130],"show":[76,131],"achieve":[79,134],"tractability,":[80,136],"one":[81,137],"needs":[82,138],"restrict":[84],"both":[85],"meaningful":[94],"way.":[95],"design":[97],"(XP)-algorithms":[98],"for":[99],"parameterized":[102],"(1)":[104],"clique-width":[105],"G":[107,117],"plus":[108,118],"number":[110,120],"(2)":[114],"treewidth":[115],"types,":[123],"along":[124],"with":[125],"corresponding":[126],"bounds.":[128],"Finally,":[129],"fixed-parameter":[135],"not":[140],"only":[141],"use":[142],"more":[144],"restrictive":[145],"parameterization":[146],"G,":[148],"but":[149],"also":[150],"include":[151],"maximum":[153],"valuation":[155],"as":[156],"an":[157],"additional":[158],"parameter.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}