{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:57:27Z","timestamp":1649008647045},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,1]]},"abstract":"<jats:p> Inspired by a real-life application, we investigate the computationally hard problem of extending a precoloring of an interval graph to a proper coloring under some bound on the number of available colors. We are interested in quickly determining whether or not such an extension exists on instances occurring in practice in connection with campsite bookings on a campground. A naive exhaustive search does not terminate in reasonable time. We have formulated a new approach which moves the computation time within the usable range on all the data samples available to us. <\/jats:p>","DOI":"10.1142\/s0129054113500020","type":"journal-article","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T06:54:44Z","timestamp":1368514484000},"page":"109-122","source":"Crossref","is-referenced-by-count":0,"title":["A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS"],"prefix":"10.1142","volume":"24","author":[{"given":"MARTIN R.","family":"EHMSEN","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KIM S.","family":"LARSEN","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,5,13]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90646-W"},{"issue":"2","key":"p_7","first-page":"139","volume":"62","author":"Kratochv\u00edl J.","year":"1993","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.008"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1684(03)00089-6"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113500020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:45:25Z","timestamp":1565189125000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113500020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":4,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2013,5,13]]},"published-print":{"date-parts":[[2013,1]]}},"alternative-id":["10.1142\/S0129054113500020"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113500020","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}