{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:05Z","timestamp":1759639085969,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319485317"},{"type":"electronic","value":"9783319485324"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48532-4_5","type":"book-chapter","created":{"date-parts":[[2016,11,23]],"date-time":"2016-11-23T09:13:16Z","timestamp":1479892396000},"page":"49-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mario Kart Is Hard"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Bosboom","sequence":"first","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Hesterberg","sequence":"additional","affiliation":[]},{"given":"Jayson","family":"Lynch","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Waingarten","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2015.02.037","volume":"586","author":"G Aloupis","year":"2015","unstructured":"Aloupis, G., Demaine, E.D., Guo, A., Viglietta, G.: Classic Nintendo games are (computationally) hard. Theoret. Comput. Sci. 586, 135\u2013160 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0049394","volume-title":"Algorithms \u2014 ESA 1994","author":"T Biedl","year":"1994","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. In: Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 24\u201335. Springer, Heidelberg (1994). doi:10.1007\/BFb0049394"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-13122-6_22","volume-title":"Fun with Algorithms","author":"M Fori\u0161ek","year":"2010","unstructured":"Fori\u0161ek, M.: Computational complexity of two-dimensional platform games. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 214\u2013227. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13122-6_22"},{"key":"5_CR4","unstructured":"Guinness World Records: Best-selling racing videogame (2014). http:\/\/www.guinnessworldrecords.com\/world-records\/best-selling-racing-video-game\/"},{"key":"5_CR5","unstructured":"Sales figures based on http:\/\/www.polygon.com\/2014\/5\/15\/5718168\/mario-kart-series-sales, http:\/\/www.nintendo.co.jp\/ir\/en\/sales\/software\/3ds.html, and http:\/\/www.nintendo.co.jp\/ir\/en\/sales\/software\/wiiu.html, November 2015"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00224-013-9497-5","volume":"54","author":"G Viglietta","year":"2014","unstructured":"Viglietta, G.: Gaming is a hard job, but someone has to do it!. Theory Comput. Syst. 54(4), 595\u2013621 (2014)","journal-title":"Theory Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry and Graphs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48532-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:07:39Z","timestamp":1710166059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-48532-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319485317","9783319485324"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48532-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCDCGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry and Graphs","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}