{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T03:42:43Z","timestamp":1768794163735,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4859,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s1571-0661(04)00163-x","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"24-38","source":"Crossref","is-referenced-by-count":1,"title":["Seat Reservation Allowing Seat Changes"],"prefix":"10.1016","volume":"50","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"Susan","family":"Krarup","sequence":"additional","affiliation":[]},{"given":"Morten N.","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Azar Y., J. Boyar, L. Epstein, L. M. Favrholdt, K. S. Larsen and M. N. Nielsen, Fair versus Unrestricted Bin Packing, Technical Report PP-2000-20, Department of Mathematics and Computer Science, University of Southern Denmark, Odense (2000), preliminary version at SWAT 2000. URL ftp:\/\/ftp.imada.sdu.dk\/pub\/papers\/pp-2000\/20.ps.gz","DOI":"10.1007\/3-540-44985-X_18"},{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB2","unstructured":"Bach E., J. Boyar, L. Epstein, L. M. Favrholdt, T. Jiang, K. S. Larsen, G.-H. Lin and R. van Stee, Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem, Technical Report PP-2000-16, Department of Mathematics and Computer Science, University of Southern Denmark, Odense (2000), preliminary version at COCOON 2000. URL ftp:\/\/ftp.imada.sdu.dk\/pub\/papers\/pp-2000\/16.ps.gz"},{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Boyar J., L. M. Favrholdt, K. S. Larsen and M. N. Nielsen, Extending the Accommodating function (2001), submitted.","DOI":"10.1007\/3-540-45655-4_11"},{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/PL00009286","article-title":"The Seat Reservation Problem","volume":"25","author":"Boyar","year":"1999","journal-title":"Algorithmica"},{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB5","unstructured":"Boyar J., K. S. Larsen and M. N. Nielsen, The Accommodating Function \u2014 a generalization of the competitive ratio, in: Sixth International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 1663 (1999), pp. 74\u201379, to appear in SICOMP."},{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB6","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for Certain Multiprocessing Anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell Systems Technical Journal"},{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB7","series-title":"\u201cGraph Coloring Problems,\u201d","author":"Jensen","year":"1995"},{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive Snoopy Caching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB9","first-page":"143","article-title":"An Extremal Problem in Recursive Combinatorics","volume":"33","author":"Kierstead","year":"1981","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S1571-0661(04)00163-X_NEWBIB10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized Efficiency of List Update and Paging Rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. of the ACM"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610400163X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610400163X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:29:11Z","timestamp":1585484951000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610400163X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S157106610400163X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00163-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}