{"id":"https://openalex.org/W7131248098","doi":"https://doi.org/10.1016/j.jcss.2026.103779","title":"Optimal seat arrangement: What are the hard and easy cases?","display_name":"Optimal seat arrangement: What are the hard and easy cases?","publication_year":2026,"publication_date":"2026-02-25","ids":{"openalex":"https://openalex.org/W7131248098","doi":"https://doi.org/10.1016/j.jcss.2026.103779"},"language":"en","primary_location":{"id":"doi:10.1016/j.jcss.2026.103779","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jcss.2026.103779","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.jcss.2026.103779","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Esra Ceylan","orcid":null},"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"]},{"id":"https://openalex.org/I4210088715","display_name":"Hochschule Campus Wien","ror":"https://ror.org/003f4pg83","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210088715"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Esra Ceylan","raw_affiliation_strings":["TU Wien, Favoritenstra\u00dfe 9/11, 1040, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Favoritenstra\u00dfe 9/11, 1040, Vienna, Austria","institution_ids":["https://openalex.org/I145847075","https://openalex.org/I4210088715"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jiehua Chen","orcid":null},"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"]},{"id":"https://openalex.org/I4210088715","display_name":"Hochschule Campus Wien","ror":"https://ror.org/003f4pg83","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210088715"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Jiehua Chen","raw_affiliation_strings":["TU Wien, Favoritenstra\u00dfe 9/11, 1040, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Favoritenstra\u00dfe 9/11, 1040, Vienna, Austria","institution_ids":["https://openalex.org/I145847075","https://openalex.org/I4210088715"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sanjukta Roy","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjukta Roy","raw_affiliation_strings":["Pennsylvania State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145847075","https://openalex.org/I4210088715"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":{"value":2520,"currency":"USD","value_usd":2520},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23437208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"160","issue":null,"first_page":"103779","last_page":"103779"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12459","display_name":"Nerve Injury and Rehabilitation","score":0.052799999713897705,"subfield":{"id":"https://openalex.org/subfields/2746","display_name":"Surgery"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T12459","display_name":"Nerve Injury and Rehabilitation","score":0.052799999713897705,"subfield":{"id":"https://openalex.org/subfields/2746","display_name":"Surgery"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12053","display_name":"Minimally Invasive Surgical Techniques","score":0.029999999329447746,"subfield":{"id":"https://openalex.org/subfields/2746","display_name":"Surgery"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T10916","display_name":"Surgical Simulation and Training","score":0.02979999966919422,"subfield":{"id":"https://openalex.org/subfields/2746","display_name":"Surgery"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/gadget","display_name":"Gadget","score":0.6535000205039978},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6276999711990356},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5752999782562256},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5077999830245972},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.37720000743865967},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.375900000333786},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.3569999933242798},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.3547999858856201}],"concepts":[{"id":"https://openalex.org/C119770614","wikidata":"https://www.wikidata.org/wiki/Q5516347","display_name":"Gadget","level":2,"score":0.6535000205039978},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6276999711990356},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6144000291824341},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5752999782562256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5123999714851379},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5077999830245972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4104999899864197},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.37720000743865967},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.375900000333786},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.3569999933242798},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3547999858856201},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34299999475479126},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.34060001373291016},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.3305000066757202},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.31859999895095825},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3124000132083893},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.30160000920295715},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2872999906539917},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26649999618530273},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2574999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.jcss.2026.103779","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jcss.2026.103779","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.jcss.2026.103779","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jcss.2026.103779","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5026062368","display_name":null,"funder_award_id":"10.47379/ VRG18012","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W323055482","https://openalex.org/W1517036688","https://openalex.org/W1970776799","https://openalex.org/W1971441460","https://openalex.org/W1980809300","https://openalex.org/W1993454521","https://openalex.org/W1994262057","https://openalex.org/W2036836182","https://openalex.org/W2043920180","https://openalex.org/W2059451253","https://openalex.org/W2068115726","https://openalex.org/W2074798472","https://openalex.org/W2096426146","https://openalex.org/W2102617746","https://openalex.org/W2116087731","https://openalex.org/W2134660637","https://openalex.org/W2156671446","https://openalex.org/W2296148711","https://openalex.org/W2345094087","https://openalex.org/W2398203258","https://openalex.org/W2439127873","https://openalex.org/W2758665439","https://openalex.org/W2914414140","https://openalex.org/W2963573253","https://openalex.org/W2964635954","https://openalex.org/W2966713763","https://openalex.org/W2982557180","https://openalex.org/W3114655639","https://openalex.org/W3194107725","https://openalex.org/W3201161529","https://openalex.org/W3203360977","https://openalex.org/W4283803417","https://openalex.org/W4385768044","https://openalex.org/W4390443696","https://openalex.org/W7124292941","https://openalex.org/W7124294849"],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"four":[2,88],"NP":[3,174],"-hard":[4,175],"optimal":[5],"seat":[6,35,51,98,116,124,151],"arrangement":[7,172],"problems,":[8],"which":[9],"each":[10,20,43],"have":[11],"as":[12],"input":[13],"a":[14,46],"set":[15],"of":[16,58,86,111,122,130],"n":[17,30],"agents,":[18,27],"where":[19],"agent":[21,44,135],"has":[22,136],"cardinal":[23],"preferences":[24,149],"over":[25],"other":[26],"and":[28,77,139,150,156,166],"an":[29,134,161,170],"-vertex":[31],"undirected":[32],"graph":[33,36,52,94,99],"(called":[34],").":[37],"The":[38],"task":[39],"is":[40,64,68],"to":[41,45],"assign":[42],"distinct":[47],"vertex":[48,119],"in":[49,114,163,176],"the":[50,56,61,83,87,97,109,115,118,123,127,164],"such":[53],"that":[54,168],"either":[55],"sum":[57],"utilities":[59],"or":[60,66,70,104,126,144],"minimum":[62],"utility":[63],"maximized,":[65],"it":[67],"envy-free":[69,171],"exchange-stable":[71],".":[72],"Aiming":[73],"at":[74],"identifying":[75],"hard":[76],"easy":[78],"cases,":[79],"we":[80,159],"systematically":[81],"chart":[82],"algorithmic":[84],"complexity":[85],"problems":[89],"by":[90],"looking":[91],"into":[92],"natural":[93],"classes":[95],"for":[96],"(e.g.,":[100,108,142],"paths,":[101],"cycles,":[102],"stars,":[103],"matchings),":[105],"problem-specific":[106],"parameters":[107],"number":[110,121,129],"non-isolated":[112],"vertices":[113],"graph,":[117,125],"cover":[120],"maximum":[128],"agents":[131],"towards":[132],"whom":[133],"non-zero":[137],"preferences),":[138],"preference":[140],"structures":[141],"non-negative":[143],"symmetric":[145],"preferences).":[146],"For":[147],"strict":[148],"graphs":[152],"with":[153],"disjoint":[154],"edges":[155],"isolated":[157],"vertices,":[158],"correct":[160],"error":[162],"literature":[165],"show":[167],"finding":[169],"remains":[173],"this":[177],"case.":[178]},"counts_by_year":[],"updated_date":"2026-06-14T06:11:07.267592","created_date":"2025-10-10T00:00:00"}