{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:20:21Z","timestamp":1720052421015},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1016\/j.dam.2023.01.031","type":"journal-article","created":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T19:09:17Z","timestamp":1675451357000},"page":"23-40","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The speed and threshold of the biased perfect matching and Hamilton cycle games"],"prefix":"10.1016","volume":"332","author":[{"given":"Noah","family":"Br\u00fcstle","sequence":"first","affiliation":[]},{"given":"Sarah","family":"Clusiau","sequence":"additional","affiliation":[]},{"given":"Vishnu V.","family":"Narayan","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4920-6566","authenticated-orcid":false,"given":"Ndiam\u00e9","family":"Ndiaye","sequence":"additional","affiliation":[]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Seamone","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2023.01.031_b1","series-title":"Algorithmic Aspects of Combinatorics","first-page":"221","article-title":"Biased positional games","volume":"vol. 2","author":"Chv\u00e1tal","year":"1978"},{"issue":"4","key":"10.1016\/j.dam.2023.01.031_b2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1002\/rsa.20279","article-title":"Asymptotic random graph intuition for the biased connectivity game","volume":"35","author":"Gebauer","year":"2009","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"10.1016\/j.dam.2023.01.031_b3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.jctb.2008.04.001","article-title":"Fast winning strategies in Maker\u2013Breaker games","volume":"99","author":"Hefetz","year":"2009","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2023.01.031_b4","series-title":"Positional Games","author":"Hefetz","year":"2014"},{"issue":"R28","key":"10.1016\/j.dam.2023.01.031_b5","article-title":"On two problems regarding the Hamiltonian cycle game","volume":"16","author":"Hefetz","year":"2009","journal-title":"Electron. J. Combin."},{"issue":"1","key":"10.1016\/j.dam.2023.01.031_b6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1090\/S0894-0347-2010-00678-9","article-title":"The critical bias for the Hamiltonicity game is (1+o(1))n\/ln n","volume":"24","author":"Krivelevich","year":"2011","journal-title":"J. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/j.dam.2023.01.031_b7","article-title":"Fast strategies in biased Maker-Breaker games","volume":"20","author":"Mikala\u010dki","year":"2018","journal-title":"Discrete Math. Theoretical Comput. Sci."},{"issue":"4","key":"10.1016\/j.dam.2023.01.031_b8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian circuits in random graphs","volume":"14","author":"P\u00f3sa","year":"1976","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X23000392?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X23000392?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T18:54:47Z","timestamp":1711565687000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X23000392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":8,"alternative-id":["S0166218X23000392"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2023.01.031","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2023,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The speed and threshold of the biased perfect matching and Hamilton cycle games","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2023.01.031","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}