{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:02:03Z","timestamp":1780495323115,"version":"3.54.1"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.jcss.2026.103779","type":"journal-article","created":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:08:16Z","timestamp":1771978096000},"page":"103779","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Optimal seat arrangement: What are the hard and easy cases?"],"prefix":"10.1016","volume":"160","author":[{"given":"Esra","family":"Ceylan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiehua","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjukta","family":"Roy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2026.103779_br0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2021.103576","article-title":"Schelling games on graphs","volume":"301","author":"Agarwal","year":"2021","journal-title":"Artif. Intell."},{"issue":"1","key":"10.1016\/j.jcss.2026.103779_br0020","first-page":"275","article-title":"Exchange-proofness or divorce-proofness? Stability in one-sided matching markets","volume":"1","author":"Alcalde","year":"1994","journal-title":"Econ. Des."},{"issue":"4","key":"10.1016\/j.jcss.2026.103779_br0030","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-coding","volume":"42","author":"Alon","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/j.jcss.2026.103779_br0040","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.artint.2012.09.006","article-title":"Computing desirable partitions in additively separable hedonic games","volume":"195","author":"Aziz","year":"2013","journal-title":"Artif. Intell."},{"key":"10.1016\/j.jcss.2026.103779_br0050","series-title":"Proceedings of the 27th AAAI Conference on Artificial Intelligence","first-page":"81","article-title":"Optimal coalition structure generation in cooperative graph games","author":"Bachrach","year":"2013"},{"key":"10.1016\/j.jcss.2026.103779_br0060","author":"Berriaud"},{"key":"10.1016\/j.jcss.2026.103779_br0070","series-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence","first-page":"9287","article-title":"Hedonic games with fixed-size coalitions","author":"Bil\u00f2","year":"2022"},{"key":"10.1016\/j.jcss.2026.103779_br0080","series-title":"Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.65109\/AQES2643","article-title":"Hedonic seat arrangement problems","author":"Bodlaender","year":"2020"},{"key":"10.1016\/j.jcss.2026.103779_br0090","author":"Bodlaender"},{"issue":"2","key":"10.1016\/j.jcss.2026.103779_br0100","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1006\/game.2001.0877","article-title":"The stability of hedonic coalition structures","volume":"38","author":"Bogomolnaia","year":"2002","journal-title":"Games Econ. Behav."},{"key":"10.1016\/j.jcss.2026.103779_br0110","series-title":"Handbook of Computational Social Choice","author":"Brandt","year":"2016"},{"key":"10.1016\/j.jcss.2026.103779_br0120","series-title":"Proceedings of the 16th International Conference on Web and Internet Economics","first-page":"59","article-title":"Multidimensional stable roommates with master list","volume":"vol. 12495","author":"Bredereck","year":"2020"},{"issue":"1","key":"10.1016\/j.jcss.2026.103779_br0130","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1093\/comjnl\/bxm086","article-title":"Parameterized complexity of cardinality constrained optimization problems","volume":"51","author":"Cai","year":"2008","journal-title":"Comput. J."},{"issue":"4","key":"10.1016\/j.jcss.2026.103779_br0140","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","article-title":"The efficiency of fair division","volume":"50","author":"Caragiannis","year":"2012","journal-title":"Theory Comput. Syst."},{"issue":"1\u20133","key":"10.1016\/j.jcss.2026.103779_br0150","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2005.06.003","article-title":"The exchange-stable marriage problem","volume":"152","author":"Cechl\u00e1rov\u00e1","year":"2005","journal-title":"Discrete Appl. Math."},{"issue":"40\u201342","key":"10.1016\/j.jcss.2026.103779_br0160","doi-asserted-by":"crossref","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","article-title":"Improved upper bounds for vertex cover","volume":"411","author":"Chen","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103779_br0170","series-title":"Algorithmic Game Theory: 14th International Symposium","first-page":"205","article-title":"On (coalitional) exchange-stable matching","volume":"vol. 12885","author":"Chen","year":"2021"},{"key":"10.1016\/j.jcss.2026.103779_br0180","author":"Chen"},{"key":"10.1016\/j.jcss.2026.103779_br0190","series-title":"Proceedings of the 30th Annual European Symposium on Algorithms","first-page":"36:1","article-title":"Multi-dimensional stable roommates in 2-dimensional Euclidean space","volume":"vol. 244","author":"Chen","year":"2022"},{"issue":"1","key":"10.1016\/j.jcss.2026.103779_br0200","first-page":"87","article-title":"Pareto optimal coalitions of fixed size","volume":"4","author":"Cseh","year":"2019","journal-title":"J. Mech. Inst. Des."},{"issue":"1","key":"10.1016\/j.jcss.2026.103779_br0210","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/s00224-017-9810-9","article-title":"The stable roommates problem with short lists","volume":"63","author":"Cseh","year":"2019","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.jcss.2026.103779_br0220","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"issue":"3","key":"10.1016\/j.jcss.2026.103779_br0230","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","article-title":"Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete","volume":"30","author":"Dailey","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcss.2026.103779_br0240","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","article-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"issue":"2","key":"10.1016\/j.jcss.2026.103779_br0250","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","article-title":"On the complexity of partitioning graphs into connected subgraphs","volume":"10","author":"Dyer","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jcss.2026.103779_br0260","article-title":"On the densest k-subgraph problem","volume":"29","author":"Feige","year":"1997","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.jcss.2026.103779_br0270","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.jcss.2026.103779_br0280","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.jcss.2026.103779_br0290","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.cor.2016.05.012","article-title":"The multiple team formation problem using sociometry","volume":"75","author":"Guti\u00e9rrez","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.jcss.2026.103779_br0300","series-title":"Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems","doi-asserted-by":"crossref","first-page":"761","DOI":"10.65109\/MDNF7852","article-title":"Equilibria in Schelling games: computational hardness and robustness","author":"Kreisel","year":"2022"},{"issue":"11","key":"10.1016\/j.jcss.2026.103779_br0310","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1057\/jors.2016.34","article-title":"Creating seating plans: a practical application","volume":"67","author":"Lewis","year":"2016","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.jcss.2026.103779_br0320","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","article-title":"Parameterized complexity and approximation algorithms","volume":"51","author":"Marx","year":"2008","journal-title":"Comput. J."},{"key":"10.1016\/j.jcss.2026.103779_br0330","series-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence","first-page":"492","article-title":"Graphical one-sided markets","author":"Sagar","year":"2019"},{"key":"10.1016\/j.jcss.2026.103779_br0340","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"key":"10.1016\/j.jcss.2026.103779_br0350","first-page":"1","article-title":"Stable matching: theory, evidence, and practical design","author":"Shapley","year":"2012","journal-title":"Nobel Found."},{"issue":"1\u20132","key":"10.1016\/j.jcss.2026.103779_br0360","first-page":"165","volume":"101","year":"1998","journal-title":"Artif. Intell."},{"key":"10.1016\/j.jcss.2026.103779_br0370","series-title":"Proceedings of the International Conference on Mathematical Optimization Theory and Operations Research","first-page":"271","article-title":"A heuristic approach in solving the optimal seating chart problem","author":"Tomi\u0107","year":"2021"},{"issue":"2","key":"10.1016\/j.jcss.2026.103779_br0380","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/jgt.22062","article-title":"Partitioning perfect graphs into stars","volume":"85","author":"van Bevern","year":"2017","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.jcss.2026.103779_br0390","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1016\/j.ejor.2021.08.002","article-title":"Parliament seating assignment problems","volume":"296","author":"Vangerven","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.jcss.2026.103779_br0400","series-title":"Proceedings of the 32nd International Joint Conference on Artificial Intelligence","first-page":"2906","article-title":"Ordinal hedonic seat arrangement under restricted preference domains: swap stability and popularity","author":"Wilczynski","year":"2023"},{"key":"10.1016\/j.jcss.2026.103779_br0410","series-title":"Proceedings of the 39th Conference on Current Trends in Theory and Practice of Computer Science","first-page":"33","article-title":"Core stability in hedonic coalition formation","volume":"vol. 7741","author":"Woeginger","year":"2013"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T13:01:48Z","timestamp":1780491708000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":41,"alternative-id":["S0022000026000255"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103779","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal seat arrangement: What are the hard and easy cases?","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103779","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"103779"}}