{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:41:37Z","timestamp":1725522097061},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922476"},{"type":"electronic","value":"9783540922483"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92248-3_30","type":"book-chapter","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T08:36:17Z","timestamp":1228379777000},"page":"336-347","source":"Crossref","is-referenced-by-count":9,"title":["Digraph Decompositions and Monotonicity in Digraph Searching"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Kreutzer","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Ordyniak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"30_CR1","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.jctb.2006.12.006","volume":"97","author":"I. Adler","year":"2007","unstructured":"Adler, I.: Directed tree-width examples. Journal Combinarial Theory Series B\u00a097(5), 718\u2013725 (2007)","journal-title":"Journal Combinarial Theory Series B"},{"key":"30_CR2","unstructured":"Alspach, B.: Searching and sweeping graphs: A brief survey. In: COMBINATORICS 2004 (2004)"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00373-005-0627-y","volume":"22","author":"J. Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J.: Directed path-width and monotonicity in digraph searching. Graphs and Combinatorics\u00a022(2), 161\u2013172 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/11672142_43","volume-title":"STACS 2006","author":"D. Berwanger","year":"2006","unstructured":"Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S.: DAG-width and parity games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 524\u2013536. Springer, Heidelberg (2006)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-32275-7_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Berwanger","year":"2005","unstructured":"Berwanger, D., Gr\u00e4del, E.: Entanglement \u2013 A measure for the complexity of directed graphs with applications to logic and games. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol.\u00a03452, pp. 209\u2013223. Springer, Heidelberg (2005)"},{"key":"30_CR6","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.: Monotonicity in graph searching. Journal of Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"Journal of Algorithms"},{"key":"30_CR7","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":"30_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209, 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"30_CR9","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. Theorectical Computer Science\u00a0172(1-2), 233\u2013254 (1997)","journal-title":"Theorectical Computer Science"},{"key":"30_CR10","series-title":"Graduate Texts in Mathematics","volume-title":"Graph theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Berlin (2005)","edition":"3"},{"key":"30_CR11","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, 22\u201333 (1993)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"30_CR12","unstructured":"Dyer, D.: Sweeping Graphs and Digraphs. Ph.D thesis, Simon Fraser University (2004)"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45477-2_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F.V. Fomin","year":"2001","unstructured":"Fomin, F.V., Thilikos, D.M.: On the monotonicity of games generated by symmetric submodular functions. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, p. 177. Springer, Heidelberg (2001)"},{"key":"30_CR14","volume-title":"Computers and Intractibility","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractibility. W. H. Freeman and Company, New York (1979)"},{"key":"30_CR15","unstructured":"Hunter, P., Kreutzer, S.: Digraph measures: Kelly decompositions, games, and orderings. In: Proceedings of the 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 637\u2013644 (2007)"},{"issue":"1","key":"30_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T. Johnson","year":"2001","unstructured":"Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Combin. Theory Ser. B\u00a082(1), 138\u2013154 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"30_CR17","volume-title":"Complexity of Computer Science","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Complexity of Computer Science. Plenum Press, New York (1972)"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A.S. LaPaugh","year":"1993","unstructured":"LaPaugh, A.S.: Recontamination does not help to search a graph. Journal of the ACM\u00a040, 224\u2013254 (1993)","journal-title":"Journal of the ACM"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-74839-7_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Mazoit","year":"2007","unstructured":"Mazoit, F., Nisse, N.: Monotonicity property of non-deterministic graph searching. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 33\u201344. Springer, Heidelberg (2007)"},{"issue":"3","key":"30_CR20","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.tcs.2008.02.036","volume":"399","author":"F. Mazoit","year":"2008","unstructured":"Mazoit, F., Nisse, N.: Monotonicity of non-deterministic graph searching. Theor. Comput. Sci.\u00a0399(3), 169\u2013178 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"30_CR21","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/321526.321534","volume":"16","author":"D.M. Moyles","year":"1969","unstructured":"Moyles, D.M., Thompson, G.L.: An algorithm for finding a minimum equivalent graph of a digraph. Journal of the ACM\u00a016(3), 455\u2013460 (1969)","journal-title":"Journal of the ACM"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Obdr\u017e\u00e1lek, J.: DAG-width: connectivity measure for directed graphs. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 814\u2013821 (2006)","DOI":"10.1145\/1109557.1109647"},{"key":"30_CR23","series-title":"Electronic Notes in Discrete Mathematics","first-page":"8","volume-title":"6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999)","author":"B. Reed","year":"1999","unstructured":"Reed, B.: Introducing directed tree width. In: 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999). Electronic Notes in Discrete Mathematics, vol.\u00a03, 8 p. Elsevier, Amsterdam (1999) (electronic)"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Richerby, D., Thilikos, D.: Searching for a Visible, Lazy Fugitive. In: 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008) (2008)","DOI":"10.1007\/978-3-540-92248-3_31"},{"key":"30_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/11549345_64","volume-title":"Mathematical Foundations of Computer Science 2005","author":"M.A. Safari","year":"2005","unstructured":"Safari, M.A.: D-width: a more natural measure for directed tree width. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 745\u2013756. Springer, Heidelberg (2005)"},{"key":"30_CR26","unstructured":"van Leeuwen, J.: Having a grundy-numbering is NP-complete. Technical report, Pennsylvania State University (1976)"},{"key":"30_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-72870-2_4","volume-title":"Algorithmic Aspects in Information and Management","author":"B. Yang","year":"2007","unstructured":"Yang, B., Cao, Y.: Digraph strong searching: Monotonicity and complexity. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 37\u201346. Springer, Heidelberg (2007)"}],"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-540-92248-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T20:17:16Z","timestamp":1557951436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92248-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922476","9783540922483"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92248-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}