{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:23Z","timestamp":1725664043016},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562795"},{"type":"electronic","value":"9783540475019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56279-6_72","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:57:10Z","timestamp":1330253830000},"page":"188-197","source":"Crossref","is-referenced-by-count":1,"title":["Searching a solid pseudo 3-sided orthoconvex grid"],"prefix":"10.1007","author":[{"given":"Antonios","family":"Symvonis","sequence":"first","affiliation":[]},{"given":"Spyros","family":"Tragoudas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"21_CR1","unstructured":"J.A. Ellis, I.H. Sudbourough and J.S. Turner, \u201cGraph Separation and Search Number\u201d."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L.M. Kirousis","year":"1986","unstructured":"L.M. Kirousis and C.H. Papadimitriou, \u201cSearching and Pebbling\u201d, Theoretical Computer Science, 47, 1986, pp. 205\u2013218.","journal-title":"Theoretical Computer Science"},{"issue":"No.3","key":"21_CR3","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"M.R. Fellow","year":"1988","unstructured":"M.R. Fellow and M.A. Langston, \u201cNonconstructive Tools for Proving Polynomial-Time Decidability\u201d, Journal of the Association for Computing Machinery, Vol. 35, No. 3, July 1988, pp. 727\u2013739.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"21_CR4","unstructured":"A.S. LaPaugh, \u201cRecontamination Does Not Help to Search a Graph\u201d, Technical Report, Electrical engineering and Computer Science Department, Princeton University, 1983."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(89)90016-4","volume":"23","author":"F. Makedon","year":"1989","unstructured":"F. Makedon and I.H. Sudborough, \u201cOn Minimizing Width in Linear Layouts\u201d, Discrete Applied Mathematics, 23, 1989, pp. 243\u2013265.","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"N. Megiddo,S.L. Hakimi, M.R. Garey, D.S. Johnson and C.H. Papadimitriou, \u201cThe complexity of Searching a Graph\u201d, Proceedings of the 22nd IEEE Foundations of Computer Science Symposium, 1981, pp. 376\u2013385.","DOI":"10.1109\/SFCS.1981.46"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"T.D. Parsons, \u201cPursuit Evasion in a Graph\u201d, in Theory and Applications of Graphs, Y. Alavi and D.R. Lick, eds., Springer Verlag, 1976, pp.426\u2013441.","DOI":"10.1007\/BFb0070400"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"A. Symvonis and S. Tragoudas,\u201cSearching a Solid Pseudo 3-Sided Orthoconvex Grid\u201d, Technical Report 438, Basser Department of Computer Science, University of Sydney, May 1992.","DOI":"10.1007\/3-540-56279-6_72"},{"issue":"No.1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1137\/0402013","volume":"2","author":"K. Sugihara","year":"1989","unstructured":"K. Sugihara and I. Suzuki, \u201cOptimal Algorithms for a Pursuit-Evasion Problem in Grids\u201d, SIAM Journal of Discrete Mathematics, Vol. 2, No. 1, February 1989, pp. 126\u2013143.","journal-title":"SIAM Journal of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:00Z","timestamp":1605646980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}