{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:32:50Z","timestamp":1648967570559},"reference-count":11,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:00:00Z","timestamp":1575590400000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1016\/j.disc.2015.06.002","type":"journal-article","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T13:51:42Z","timestamp":1434981102000},"page":"2341-2347","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Playing weighted Tron on trees"],"prefix":"10.1016","volume":"338","author":[{"given":"Daniel","family":"Hoske","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Rollin","sequence":"additional","affiliation":[]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Walzer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.disc.2015.06.002_br000005","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0304-3975(93)90357-Y","article-title":"Complexity of path-forming games","volume":"110","author":"Bodlaender","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.disc.2015.06.002_br000010","unstructured":"H.L. Bodlaender, A. Kloks, Fast algorithms for the Tron game on trees, RUU-CS\u00a0(90-11)."},{"key":"10.1016\/j.disc.2015.06.002_br000015","series-title":"Fete of Combinatorics and Computer Science","first-page":"63","article-title":"Solution of Peter Winkler\u2019s pizza problem","volume":"vol.~20","author":"Cibulka","year":"2010"},{"key":"10.1016\/j.disc.2015.06.002_br000020","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.tcs.2012.12.029","article-title":"Graph sharing games: complexity and connectivity","volume":"494","author":"Cibulka","year":"2013","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.disc.2015.06.002_br000025","doi-asserted-by":"crossref","DOI":"10.37236\/22","article-title":"Combinatorial games","author":"Fraenkel","year":"2012","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.disc.2015.06.002_br000030","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0304-3975(93)90356-X","article-title":"Mathematical games\u2013Geography","volume":"110","author":"Fraenkel","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"16","key":"10.1016\/j.disc.2015.06.002_br000035","doi-asserted-by":"crossref","first-page":"1635","DOI":"10.1016\/j.disc.2011.03.015","article-title":"How to eat 4\/9 of a pizza","volume":"311","author":"Knauer","year":"2011","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.disc.2015.06.002_br000040","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1017\/S0963548311000071","article-title":"A graph-grabbing game","volume":"20","author":"Micek","year":"2011","journal-title":"Combin. Probab. Comput."},{"issue":"10","key":"10.1016\/j.disc.2015.06.002_br000045","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1016\/j.disc.2012.01.037","article-title":"Parity in graph sharing games","volume":"312","author":"Micek","year":"2012","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2015.06.002_br000050","series-title":"Fun with Algorithms","first-page":"293","article-title":"Tron, a combinatorial game on abstract graphs","author":"Miltzow","year":"2012"},{"issue":"10","key":"10.1016\/j.disc.2015.06.002_br000055","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.1016\/j.disc.2012.01.010","article-title":"Grabbing the gold","volume":"312","author":"Seacrest","year":"2012","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15002265?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15002265?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T23:58:57Z","timestamp":1599177537000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X15002265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":11,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["S0012365X15002265"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2015.06.002","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2015,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Playing weighted Tron on trees","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2015.06.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}