{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:40Z","timestamp":1725541840518},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_27","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"308-319","source":"Crossref","is-referenced-by-count":2,"title":["Distance d-Domination Games"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Kreutzer","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Ordyniak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/jgt.20025","volume":"47","author":"I. Adler","year":"2004","unstructured":"Adler, I.: Marshals, monotone marshals, and hypertree-width. JGT\u00a047(4), 275\u2013296 (2004)","journal-title":"JGT"},{"issue":"8","key":"27_CR2","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1016\/j.ejc.2007.04.013","volume":"28","author":"I. Adler","year":"2007","unstructured":"Adler, I., Gottlob, G., Grohe, M.: Hypertree width and related hypergraph invariants. Journal of Combinatorics\u00a028(8), 2167\u20132181 (2007)","journal-title":"Journal of Combinatorics"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. Bodlaender","year":"1998","unstructured":"Bodlaender, H.: A partial k-aboretum of graphs with bounded tree-width. TCS\u00a0209, 1\u201345 (1998)","journal-title":"TCS"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"key":"27_CR5","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F. Fedor","year":"2008","unstructured":"Fedor, F., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. TCS\u00a0399(3), 236\u2013245 (2008)","journal-title":"TCS"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0166-218X(02)00389-X","volume":"127","author":"F. Fomin","year":"2003","unstructured":"Fomin, F., Kratsch, D., M\u00fcller, H.: On the domination search number. Discrete Applied Mathematics\u00a0127(3), 565\u2013580 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/333979.333980","volume":"47","author":"M.K. Franklin","year":"2000","unstructured":"Franklin, M.K., Galil, Z., Yung, M.: Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. Journal of the ACM\u00a047(2), 225\u2013243 (2000)","journal-title":"Journal of the ACM"},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/S0022-0000(03)00030-8","volume":"66","author":"G. Gottlob","year":"2003","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. Journal of Computer and Systems Science\u00a066(4), 775\u2013808 (2003)","journal-title":"Journal of Computer and Systems Science"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L.M. Kirousis","year":"1986","unstructured":"Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. TCS\u00a047(3), 205\u2013218 (1986)","journal-title":"TCS"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s003730170043","volume":"17","author":"T. Kloks","year":"2001","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: On the structure of graphs with bounded asteroidal number. Graphs and Combinatorics\u00a017(2), 295\u2013306 (2001)","journal-title":"Graphs and Combinatorics"},{"issue":"1","key":"27_CR12","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. Journal of Combinatorial Theory, Series B\u00a058(1), 22\u201333 (1993)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:52:04Z","timestamp":1619783524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}