{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:25Z","timestamp":1725544045063},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_27","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"293-304","source":"Crossref","is-referenced-by-count":1,"title":["Pathwidth and Searching in Parameterized Threshold Graphs"],"prefix":"10.1007","author":[{"given":"D. Sai","family":"Krishna","sequence":"first","affiliation":[]},{"given":"T. V. Thirumala","family":"Reddy","sequence":"additional","affiliation":[]},{"given":"B. Sai","family":"Shashank","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods\u00a08(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"27_CR2","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011, 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11917496_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.L. Bodlaender","year":"2006","unstructured":"Bodlaender, H.L.: Treewidth: Characterizations, applications, and computations. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 1\u201314. Springer, Heidelberg (2006)"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0166-218X(02)00242-1","volume":"127","author":"L. Cai","year":"2003","unstructured":"Cai, L.: Parameterized complexity of vertex colouring. Discrete Appl. Math.\u00a0127(3), 415\u2013429 (2003)","journal-title":"Discrete Appl. Math."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Sai Krishna, D., Thirumala Reddy, T.V., Sai Shashank, B., Pandu Rangan, C.: Pathwidth and searching in parameterized threshold graphs (to appear in LNCS) (2010), http:\/\/www.cse.iitm.ac.in\/~dsaikris\/Site\/Research_files\/psptg_full.pdf","DOI":"10.1007\/978-3-642-11440-3_27"},{"key":"27_CR6","first-page":"62","volume":"01","author":"P. Flocchini","year":"2005","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Contiguous search in the hypercube for capturing an intruder. IPDPA\u00a001, 62 (2005)","journal-title":"IPDPA"},{"key":"27_CR7","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory, 1st edn. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006)","edition":"1"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-540-74839-7_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F.V. Fomin","year":"2007","unstructured":"Fomin, F.V., Heggernes, P., Mihai, R.: Mixed search number and linear-width of interval and split graphs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 304\u2013315. Springer, Heidelberg (2007)"},{"issue":"3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci.\u00a0399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR10","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol.\u00a057. North-Holland Publishing Co., Amsterdam (2004)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-69311-6_22","volume-title":"Frontiers in Algorithmics","author":"P. Heggernes","year":"2008","unstructured":"Heggernes, P., Mihai, R.: Mixed search number of permutation graphs. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol.\u00a05059, pp. 196\u2013207. Springer, Heidelberg (2008)"},{"issue":"2","key":"27_CR12","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. J. ACM\u00a040(2), 224\u2013245 (1993)","journal-title":"J. ACM"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Lozin, V.V., Milanic, M.: Tree-width and optimization in bounded degree graphs. In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG, Bergen, Norway, June 22-24, Revised Papers, pp. 45\u201354 (2007)","DOI":"10.1007\/978-3-540-74839-7_5"},{"key":"27_CR14","series-title":"Annals of Discrete Mathematics","volume-title":"Threshold graphs and related topics","author":"N.V.R. Mahadev","year":"1995","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold graphs and related topics. Annals of Discrete Mathematics, vol.\u00a056. Elsevier Science Publishers B.V., North Holland, Amsterdam (1995)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-3-540-77120-3_76","volume-title":"Algorithms and Computation","author":"F. Mancini","year":"2007","unstructured":"Mancini, F.: Minimum fill-in and treewidth of split+ke and split+kv graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 881\u2013892. Springer, Heidelberg (2007)"},{"issue":"3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.tcs.2005.10.008","volume":"351","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized coloring problems on chordal graphs. Theor. Comput. Sci.\u00a0351(3), 407\u2013424 (2006)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:36Z","timestamp":1606185636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}