{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:19:26Z","timestamp":1763468366406},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_1","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T08:16:59Z","timestamp":1477815419000},"page":"3-17","source":"Crossref","is-referenced-by-count":4,"title":["On the Capture Time of Cops and Robbers Game on a Planar Graph"],"prefix":"10.1007","author":[{"given":"Photchchara","family":"Pisantechakool","sequence":"first","affiliation":[]},{"given":"Xuehou","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M Aigner","year":"1984","unstructured":"Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8(1), 1\u201312 (1984)","journal-title":"Discrete Appl. Math."},{"key":"1_CR2","first-page":"2","volume":"59","author":"B Alspach","year":"2004","unstructured":"Alspach, B.: Searching and sweeping graphs: a brief survey. Le Mathematiche 59, 2 (2004)","journal-title":"Le Mathematiche"},{"issue":"10","key":"1_CR3","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1177\/0278364912452894","volume":"31","author":"D Bhaduaria","year":"2012","unstructured":"Bhaduaria, D., Klein, K., Isler, V., Suri, S.: Capturing an evader in polygonal environments with obstacles: the full visibility case. Int. J. Robot. Res. 31(10), 1176\u20131189 (2012)","journal-title":"Int. J. Robot. Res."},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D Bienstock","year":"2011","unstructured":"Bienstock, D., Seymour, P.: Monotonicity in graph searching. J. Algorithm 12, 239\u2013245 (2011)","journal-title":"J. Algorithm"},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"5588","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.: The capture time of a graph. Discrete Math. 309, 5588\u20135595 (2009)","journal-title":"Discrete Math."},{"key":"1_CR6","volume-title":"Search Games","author":"I Gal","year":"1982","unstructured":"Gal, I.: Search Games. Addison-Wesley, Reading (1982)"},{"issue":"9\u201310","key":"1_CR7","first-page":"1305","volume":"50","author":"A Kehagias","year":"2008","unstructured":"Kehagias, A., Hollinger, G.A., Singh, S.: A graph search algorithm for indoor pursuit-evasion. Math. Comput. Model. 50(9\u201310), 1305\u20131317 (2008)","journal-title":"Math. Comput. Model."},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"AS LaPaugh","year":"1993","unstructured":"LaPaugh, A.S.: Recontamination does not help to search a graph. J. ACM 40, 224\u2013245 (1993)","journal-title":"J. ACM"},{"key":"1_CR9","unstructured":"Maurer, A., McCauley, J., Valeva, S.: Cops and robbers on planar graphs. In: Summer 2010 Interdisciplinary Research Experience for Undergraduates. University of Minnesota (2010)"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.disc.2010.10.002","volume":"311","author":"A Mehrabian","year":"2011","unstructured":"Mehrabian, A.: The capture time of grids. Discrete Math. 311, 102\u2013105 (2011)","journal-title":"Discrete Math."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R Nowakowski","year":"1983","unstructured":"Nowakowski, R., Winkler, R.P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 235\u2013239 (1983)","journal-title":"Discrete Math."},{"key":"1_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BFb0070400","volume-title":"Theory and Applications of Graphs","author":"TD Parsons","year":"1978","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 426\u2013441. Springer, Heidelberg (1978)"},{"key":"1_CR13","unstructured":"Parsons, T.D.: The search number of a connected graph. In: Proceedings of 9th South-Eastern Conference on Combinatorics Graph Theory and Computing, pp. 549\u2013554 (1978)"},{"issue":"1","key":"1_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0195-6698(86)80017-8","volume":"7","author":"A Quilliot","year":"1986","unstructured":"Quilliot, A.: Some results about pursuit games on metric spaces obtained through graph theory techniques. Eur. J. Comb. 7(1), 55\u201366 (1986)","journal-title":"Eur. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:24:36Z","timestamp":1498357476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}