{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:52Z","timestamp":1740122392015,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,9,9]],"date-time":"2017-09-09T00:00:00Z","timestamp":1504915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10878-017-0173-6","type":"journal-article","created":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T15:54:14Z","timestamp":1505145254000},"page":"1103-1117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The capture time of a planar graph"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1634-4505","authenticated-orcid":false,"given":"Photchchara","family":"Pisantechakool","sequence":"first","affiliation":[]},{"given":"Xuehou","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,9]]},"reference":[{"key":"173_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M Aigner","year":"1984","unstructured":"Aigner M, Fromme M (1984) A game of cops and robbers. Discrete Appl Math 8:1\u201312. doi:\n                        10.1016\/0166-218X(84)90073-8","journal-title":"Discrete Appl Math"},{"key":"173_CR2","first-page":"5","volume":"59","author":"B Alspach","year":"2004","unstructured":"Alspach B (2004) Searching and sweeping graphs: a brief survey. Le Mathematiche 59:5\u201337","journal-title":"Le Mathematiche"},{"key":"173_CR3","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1177\/0278364912452894","volume":"31","author":"D Bhaduaria","year":"2012","unstructured":"Bhaduaria D, Klein K, Isler V, Suri S (2012) Capturing an evader in polygonal environments with obstacles: the full visibility case. Int J Robot Res 31:1176\u20131189. doi:\n                        10.1177\/0278364912452894","journal-title":"Int J Robot Res"},{"key":"173_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D Bienstock","year":"2011","unstructured":"Bienstock D, Seymour P (2011) Monotonicity in graph searching. J Algorithm 12:239\u2013245. doi:\n                        10.1016\/0196-6774(91)90003-H","journal-title":"J Algorithm"},{"key":"173_CR5","doi-asserted-by":"publisher","first-page":"5583","DOI":"10.1016\/j.disc.2008.04.004","volume":"309","author":"A Bonato","year":"2009","unstructured":"Bonato A, Golovach P, Hahn G, Kratochv\u00edl J (2009) The capture time of a graph. Discrete Math 309:5583\u20135595. doi:\n                        10.1016\/j.disc.2008.04.004","journal-title":"Discrete Math"},{"key":"173_CR6","volume-title":"Search games","author":"I Gal","year":"1982","unstructured":"Gal I (1982) Search games. Addison-Wesley, Reading"},{"key":"173_CR7","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1016\/j.mcm.2009.06.011","volume":"50","author":"A Kehagias","year":"2008","unstructured":"Kehagias A, Hollinger GA, Singh S (2008) A graph search algorithm for indoor pursuit-evasion. Math Comput Model 50:1305\u20131317. doi:\n                        10.1016\/j.mcm.2009.06.011","journal-title":"Math Comput Model"},{"key":"173_CR8","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"AS LaPaugh","year":"1993","unstructured":"LaPaugh AS (1993) Recontamination does not help to search a graph. J ACM 40:224\u2013245. doi:\n                        10.1145\/151261.151263","journal-title":"J ACM"},{"key":"173_CR9","unstructured":"Maurer A, McCauley J, Valeva S (2010) Cops and robbers on planar graphs. In: Summer 2010 interdisciplinary research experience for undergraduates. University of Minnesota"},{"key":"173_CR10","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.disc.2010.10.002","volume":"311","author":"A Mehrabian","year":"2011","unstructured":"Mehrabian A (2011) The capture time of grids. Discrete Math 311:102\u2013105. doi:\n                        10.1016\/j.disc.2010.10.002","journal-title":"Discrete Math"},{"key":"173_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R Nowakowski","year":"1983","unstructured":"Nowakowski R, Winkler RP (1983) Vertex-to-vertex pursuit in a graph. Discrete Math 43:235\u2013239. doi:\n                        10.1016\/0012-365X(83)90160-7","journal-title":"Discrete Math"},{"key":"173_CR12","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0070400","volume-title":"Theory and applications of graphs. Lecture notes in mathematics","author":"TD Parsons","year":"1978","unstructured":"Parsons TD (1978a) Pursuit-evasion in a graph. In: Alavi Y, Lick DR (eds) Theory and applications of graphs. Lecture notes in mathematics, vol 642. Springer, Berlin, pp 426\u2013441. doi:\n                        10.1007\/BFb0070400"},{"key":"173_CR13","unstructured":"Parsons TD (1978b) The search number of a connected graph. In: Proc of SEICCGTC, vol 9, pp 549\u2013554"},{"key":"173_CR14","doi-asserted-by":"publisher","unstructured":"Pisantechakool P, Tan X (2016) On the capture time of cops and robbers game on a planar graph. In: Proc of COCOA 2016. Lecture notes in computer science, vol 10043, pp 3\u201317. doi:\n                        10.1007\/978-3-319-48749-6_1","DOI":"10.1007\/978-3-319-48749-6_1"},{"key":"173_CR15","unstructured":"Quilliot A (1978) Jeux et pointes fixes sur les graphes. Dissertation, Universit\u00e9 de Paris"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0173-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0173-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0173-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T11:52:34Z","timestamp":1538394754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0173-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,9]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["173"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0173-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,9,9]]}}}