{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:30:21Z","timestamp":1794349821535,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540755371","type":"print"},{"value":"9783540755388","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75538-8_17","type":"book-chapter","created":{"date-parts":[[2007,9,27]],"date-time":"2007-09-27T09:13:48Z","timestamp":1190884428000},"page":"190-199","source":"Crossref","is-referenced-by-count":1,"title":["LUMINES Strategies"],"prefix":"10.1007","author":[{"given":"Greg","family":"Aloupis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean","family":"Cardinal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9bastien","family":"Collette","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1006\/jagm.1997.0876","volume":"25","author":"Y. Azar","year":"1997","unstructured":"Azar, Y., Epstein, L.: On Two-Dimensional Packing. Journal of Algorithms\u00a025(2), 290\u2013310 (1997)","journal-title":"Journal of Algorithms"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1142\/S0218195904001354","volume":"14","author":"R. Breukelaar","year":"2004","unstructured":"Breukelaar, R., Demaine, E.D., Hohenberger, S., Hoogeboom, H.J., Kosters, W.A., Liben-Nowell, D.: T\n                  \n                    \n                  \n                  $\\textsc{etris}$\n                 is Hard, Even to Approximate. International Journal of Computational Geometry and Applications\u00a014, 41\u201368 (2004)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"17_CR3","unstructured":"Brzutowski, J.: Can You Win at T\n                  \n                    \n                  \n                  $\\textsc{etris}$\n                ? Master\u2019s thesis, The University of British Columbia (1992)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.2307\/3619195","volume":"81","author":"H. Burgiel","year":"1997","unstructured":"Burgiel, H.: How to Lose at T\n                  \n                    \n                  \n                  $\\textsc{etris}$\n                . Mathematical Gazette\u00a081, 194\u2013200 (1997)","journal-title":"Mathematical Gazette"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-44683-4_3","volume-title":"Mathematical Foundations of Computer Science 2001","author":"E.D. Demaine","year":"2001","unstructured":"Demaine, E.D.: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 18\u201332. Springer, Heidelberg (2001)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-45071-8_36","volume-title":"Computing and Combinatorics","author":"E.D. Demaine","year":"2003","unstructured":"Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: T\n                  \n                    \n                  \n                  $\\textsc{etris}$\n                 is Hard, Even to Approximate. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 351\u2013363. Springer, Heidelberg (2003)"},{"key":"17_CR7","first-page":"14","volume":"9","author":"H.J. Hoogeboom","year":"2005","unstructured":"Hoogeboom, H.J., Kosters, W.A.: The Theory of T\n                  \n                    \n                  \n                  $\\textsc{etris}$\n                . Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica\u00a09, 14\u201321 (2005)","journal-title":"Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica"},{"key":"17_CR8","first-page":"34","volume":"51","author":"R. Tucker","year":"1992","unstructured":"Tucker, R.: T\n                  \n                    \n                  \n                  $\\textsc{etris}$\n                . Eureka Magazine\u00a051, 34\u201335 (1992)","journal-title":"Eureka Magazine"},{"key":"17_CR9","unstructured":"Whitelaw, C.: LUMINES: Killing the Fun (2005), \n                  \n                    http:\/\/caseyporn.com\/blog\/archives\/000818.html"},{"key":"17_CR10","unstructured":"Whitelaw, C.: LUMINES: Killing the Fun, Part Two (2005), \n                  \n                    http:\/\/caseyporn.com\/blog\/archives\/000819.html"},{"key":"17_CR11","unstructured":"Wikipedia contributors: LUMINES. Wikipedia, The Free Encyclopedia (2006)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75538-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T16:50:45Z","timestamp":1550940645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75538-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755371","9783540755388"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75538-8_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-75538-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}