{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:04Z","timestamp":1725497164406},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_3","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T09:55:58Z","timestamp":1196934958000},"page":"21-32","source":"Crossref","is-referenced-by-count":1,"title":["Graph Searching in a Crime Wave"],"prefix":"10.1007","author":[{"given":"David","family":"Richerby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.D.: Monotonicity in graph searching. J. Algorithms\u00a012(2), 239\u2013245 (1991)","journal-title":"J. Algorithms"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/jctb.1998.1834","volume":"74","author":"Y. Colin de Verdi\u00e8re","year":"1998","unstructured":"Colin de Verdi\u00e8re, Y.: Multiplicities of eigenvalues and tree-width of graphs. J. Combin. Theory Ser. B\u00a074(2), 121\u2013146 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20132","key":"3_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(96)00177-6","volume":"172","author":"N.D. Dendris","year":"1997","unstructured":"Dendris, N.D., Kirousis, L.M., Thilikos, D.M.: Fugitive-search games on graphs and related parameters. Theoret. Comput. Sci.\u00a0172(1\u20132), 233\u2013254 (1997)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J.A. Ellis","year":"1994","unstructured":"Ellis, J.A., Sudborough, I.H., Turner, J.S.: The vertex separation and search number of a graph. Information and Computation\u00a0113(1), 50\u201379 (1994)","journal-title":"Information and Computation"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11549345_32","volume-title":"Mathematical Foundations of Computer Science 2005","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Fraigniaud, P., Nisse, N.: Nondeterministic graph searching: from pathwidth to treewidth. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 364\u2013375. Springer, Heidelberg (2005)"},{"key":"3_CR6","unstructured":"Fomin, F.V., Thilikos, D.M.: Multiple edges matter when searching a graph. Unpublished manuscript"},{"key":"3_CR7","unstructured":"Hunter, P., Kreutzer, S.: Digraph measures: Kelly decompositions, games, and orderings. In: SODA. 18th ACM-SIAM Symp. on Disc. Algorithms, pp. 637\u2013644 (2007)"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P.D. Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B\u00a058(1), 22\u201333 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Stamatiou, Y.C., Thilikos, D.M.: Monotonicity and inert fugitive search games. Electronic Notes in Discrete Mathematics\u00a03 (1999)","DOI":"10.1016\/S1571-0653(05)80052-6"},{"issue":"1\u20133","key":"3_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0012-365X(94)90092-2","volume":"127","author":"A. Takahashi","year":"1994","unstructured":"Takahashi, A., Ueno, S., Kajitani, Y.: Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Disc. Math.\u00a0127(1\u20133), 293\u2013304 (1994)","journal-title":"Disc. Math."},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(94)00160-K","volume":"137","author":"A. Takahashi","year":"1995","unstructured":"Takahashi, A., Ueno, S., Kajitani, Y.: Mixed searching and proper-path-width. Theoret. Comput. Sci.\u00a0137(2), 253\u2013268 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(00)00175-X","volume":"105","author":"D.M. Thilikos","year":"2000","unstructured":"Thilikos, D.M.: Algorithms and obstructions for linear-width and related search parameters. Discrete Applied Math.\u00a0105, 239\u2013271 (2000)","journal-title":"Discrete Applied Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:35Z","timestamp":1619505755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_3","relation":{},"subject":[]}}