{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T11:00:25Z","timestamp":1694170825560},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2005,4]]},"abstract":"<jats:p> When reservations are made to for instance a train, it is an on-line problem to accept or reject, i.e., decide if a person can be fitted in given all earlier reservations. However, determining a seating arrangement, implying that it is safe to accept, is an off-line problem with the earlier reservations and the current one as input. We develop algorithms with optimal running time to handle problems of this nature. <\/jats:p>","DOI":"10.1142\/s0129054105003042","type":"journal-article","created":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T11:12:19Z","timestamp":1114600339000},"page":"381-397","source":"Crossref","is-referenced-by-count":3,"title":["ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS"],"prefix":"10.1142","volume":"16","author":[{"given":"JENS S.","family":"KOHRT","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark"}]},{"given":"KIM S.","family":"LARSEN","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01459088"},{"key":"rf2","first-page":"263","volume":"146","author":"Adel'son-Vel'ski\u012d G. M.","journal-title":"Doklady Akadamii Nauk SSSR"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022985808959"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8"},{"key":"rf7","doi-asserted-by":"crossref","unstructured":"Peter\u00a0van Emde Boas, Handbook of Theoretical Computer Science\u00a0A, ed. Jan\u00a0van Leeuwen (Elsevier Science Publishers, 1990)\u00a0pp. 1\u201366.","DOI":"10.1016\/B978-0-444-88071-0.50006-0"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-003-0124-9"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009286"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799361786"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90054-0"},{"key":"rf13","first-page":"807","volume":"28","author":"Gupta Udaiprakash I.","journal-title":"IEEE Transactions on Computers"},{"key":"rf14","volume-title":"Graph Coloring Problems","author":"Jensen Tommy R.","year":"1995"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174140"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105003042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:27:19Z","timestamp":1565191639000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105003042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":12,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,4]]}},"alternative-id":["10.1142\/S0129054105003042"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105003042","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}