{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:59Z","timestamp":1759637579842},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334740"},{"type":"electronic","value":"9783642334757"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33475-7_5","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T06:43:09Z","timestamp":1347086589000},"page":"57-71","source":"Crossref","is-referenced-by-count":16,"title":["Cinderella versus the Wicked Stepmother"],"prefix":"10.1007","author":[{"given":"Marijke Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Cor A. J.","family":"Hurkens","sequence":"additional","affiliation":[]},{"given":"Vincent J. J.","family":"Kusters","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Staals","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Bender, M.A., Fekete, S.P., Kr\u00f6ller, A., Mitchell, J.S.B., Liberatore, V., Polishchuk, V., Suomela, J.: The minimum-backlog problem. In: Proceedings of the International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2007), pp. 1\u201318 (2007)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-25870-1_8","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, M.H.L., Hurkens, C.A.J., Woeginger, G.J.: The Cinderella Game on Holes and Anti-holes. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 71\u201382. Springer, Heidelberg (2011)"},{"key":"5_CR3","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":"5_CR4","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":"5_CR5","unstructured":"Dutertre, B., de Moura, L.: Yices \u2013 A high-performance SMT solver. Downloadable from \n                  \n                    http:\/\/yices.csl.sri.com"},{"key":"5_CR6","first-page":"285","volume":"84","author":"A.J.C. Hurkens","year":"2011","unstructured":"Hurkens, A.J.C., Hurkens, C.A.J., Woeginger, G.J.: How Cinderella won the bucket game (and lived happily ever after). Mathematics Magazine\u00a084, 285\u2013290 (2011)","journal-title":"Mathematics Magazine"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-92862-1_12","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"V. Polishchuk","year":"2008","unstructured":"Polishchuk, V., Suomela, J.: Optimal Backlog in the Plane. In: Fekete, S. (ed.) ALGOSENSORS 2008. LNCS, vol.\u00a05389, pp. 141\u2013150. Springer, Heidelberg (2008)"},{"key":"5_CR8","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","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33475-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T08:49:13Z","timestamp":1557218953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33475-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334740","9783642334757"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33475-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}