{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:49Z","timestamp":1759637569175,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181721"},{"type":"electronic","value":"9783319181738"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_14","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"194-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Contraction Blockers for Graphs with Forbidden Induced Paths"],"prefix":"10.1007","author":[{"given":"\u00d6znur Ya\u015far","family":"Diner","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Picouleau","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(03)00387-1","volume":"132","author":"VE Alekseev","year":"2004","unstructured":"Alekseev, V.E.: On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Applied Math. 132, 17\u201326 (2004)","journal-title":"Discrete Applied Math."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00373-013-1380-2","volume":"31","author":"C Bazgan","year":"2015","unstructured":"Bazgan, C., Bentz, C., Picouleau, C., Ries, B.: Blockers for the stability number and the chromatic number. Graphs and Combinatorics 31, 73\u201390 (2015)","journal-title":"Graphs and Combinatorics"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-19222-7_17","volume-title":"Combinatorial Algorithms","author":"C Bazgan","year":"2011","unstructured":"Bazgan, C., Toubaline, S., Tuza, Z.: Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 154\u2013166. Springer, Heidelberg (2011)"},{"issue":"17","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1016\/j.dam.2011.06.023","volume":"159","author":"C Bazgan","year":"2011","unstructured":"Bazgan, C., Toubaline, S., Tuza, Z.: The most vital nodes with respect to independent set and vertex cover. Discrete Applied Mathematics 159(17), 1933\u20131946 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00236-014-0204-z","volume":"51","author":"R Belmonte","year":"2014","unstructured":"Belmonte, R., Golovach, P.A., van\u2019 t Hof, P.: Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica 51, 473\u2013497 (2014)","journal-title":"Acta Informatica"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/0406014","volume":"6","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L., M\u00f6hring, R.H.: The pathwidth and treewidth of cographs. SIAM J. Discrete Math. 6, 181\u2013188 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/jgt.3190110405","volume":"11","author":"V Chv\u00e1tal","year":"1987","unstructured":"Chv\u00e1tal, V., Ho\u00e0ng, C.T., Mahadev, N.V.R., de Werra, D.: Four classes of perfectly orderable graphs. J. Graph Theory 11, 481\u2013495 (1987)","journal-title":"J. Graph Theory"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3, 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s10878-010-9334-6","volume":"22","author":"M-C Costa","year":"2011","unstructured":"Costa, M.-C., de Werra, D., Picouleau, C.: Minimum d-blockers and d-transversals in graphs. Journal of Combinatorial Optimization 22, 857\u2013872 (2011)","journal-title":"Journal of Combinatorial Optimization"},{"key":"14_CR12","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. In: 8th South-Eastern Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium. vol. 19, pp. 311\u2013315 (1977)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D Fulkerson","year":"1965","unstructured":"Fulkerson, D., Gross, O.: Incidence matrices and interval graphs. Pacific Journal of Mathematics 15, 835\u2013855 (1965)","journal-title":"Pacific Journal of Mathematics"},{"key":"14_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-12340-0_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Heggernes, P., van \u2019t Hof, P., Paul, C.: Hadwiger number of graphs with small chordality. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 201\u2013213. Springer, Heidelberg (2014)"},{"key":"14_CR16","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"5744","DOI":"10.1016\/j.tcs.2011.06.018","volume":"412","author":"G Gutin","year":"2011","unstructured":"Gutin, G., Jones, M., Yeo, A.: Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems. Theor. Comput. Sci. 412, 5744\u20135751 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"2143","DOI":"10.1137\/130907392","volume":"27","author":"P Heggernes","year":"2013","unstructured":"Heggernes, P., van t Hof, P., Lokshtanov, D., Paul, C.: Obtaining a Bipartite Graph by Contracting Few Edges. SIAM Journal on Discrete Mathematics 27, 2143\u20132156 (2013)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45477-2_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Kr\u00e1l\u2019","year":"2001","unstructured":"Kr\u00e1l\u2019, D., Kratochv\u00edl, J., Tuza, Z., Woeginger, G.J.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, p. 254. Springer, Heidelberg (2001)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Vatshelle, M., Villanger, Y.: Independent Set in P5-Free Graphs in Polynomial Time. In: Proc. SODA, pp. 570\u2013581 (2014)","DOI":"10.1137\/1.9781611973402.43"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1002\/net.21556","volume":"64","author":"FM Pajouh","year":"2014","unstructured":"Pajouh, F.M., Boginski, V., Pasiliao, E.L.: Minimum vertex blocker clique problem. Networks 64, 48\u201364 (2014)","journal-title":"Networks"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.disc.2009.08.009","volume":"310","author":"B Ries","year":"2010","unstructured":"Ries, B., Bentz, C., Picouleau, C., de Werra, D., Costa, M.-C., Zenklusen, R.: Blockers and Transversals in some subclasses of bipartite graphs : when caterpillars are dancing on a grid. Discrete Mathematics 310, 132\u2013146 (2010)","journal-title":"Discrete Mathematics"},{"key":"14_CR23","unstructured":"Toubaline, S.: D\u00e9termination des \u00e9l\u00e9ments les plus vitaux pour des probl\u00e8mes de graphes, Ph. D. thesis, Universit\u00e9 Paris-Dauphine (2010)"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0166-218X(81)90039-1","volume":"3","author":"T Watanabe","year":"1981","unstructured":"Watanabe, T., Tadashi, A.E., Nakamura, A.: On the removal of forbidden graphs by edge-deletion or by edge-contraction. Discrete Applied Mathematics 3, 151\u2013153 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0166-218X(83)90101-4","volume":"6","author":"T Watanabe","year":"1983","unstructured":"Watanabe, T., Tadashi, A.E., Nakamura, A.: On the NP-hardness of edge-deletion and -contraction problems. Discrete Applied Mathematics 6, 63\u201378 (1983)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:03:44Z","timestamp":1675137824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}