{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:51:14Z","timestamp":1744217474169},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25870-1_8","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T13:32:45Z","timestamp":1322659965000},"page":"71-82","source":"Crossref","is-referenced-by-count":3,"title":["The Cinderella Game on Holes and Anti-holes"],"prefix":"10.1007","author":[{"given":"Marijke H. L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Cor A. J.","family":"Hurkens","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Bodlaender, M., Hurkens, C.A.J., Kusters, V.J.J., Staals, F., Woeginger, G.J., Zantema, H.: Cinderella versus the wicked Stepmother. Working paper, TU Eindhoven (February 2011)","DOI":"10.1007\/978-3-642-33475-7_28"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1007\/3-540-48224-5_70","volume-title":"Automata, Languages and Programming","author":"M. Chrobak","year":"2001","unstructured":"Chrobak, M., Csirik, J.A., Imreh, C., Noga, J., Sgall, J., Woeginger, G.J.: The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 862\u2013874. Springer, Heidelberg (2001)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 365\u2013372 (1987)","DOI":"10.1145\/28395.28434"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J. Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphs. Colloquium Mathematicum\u00a03, 161\u2013162 (1955)","journal-title":"Colloquium Mathematicum"},{"key":"8_CR5","unstructured":"Woeginger, G.J.: Combinatorics problem C5. In: Problem Shortlist of the 50th International Mathematical Olympiad, Bremen, Germany, pp. 33\u201335 (2009)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25870-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T04:04:39Z","timestamp":1561003479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}