{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:28Z","timestamp":1725798688191},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_6","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:33:02Z","timestamp":1407825182000},"page":"57-68","source":"Crossref","is-referenced-by-count":2,"title":["Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set"],"prefix":"10.1007","author":[{"given":"R\u00e9my","family":"Belmonte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Kami\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Belmonte, R., van \u2019t Hof, P., Kami\u0144ski, M., Paulusma, D.: The price of connectivity for feedback vertex set. In: Eurocomb 2013. CRM Series, vol.\u00a016, pp. 123\u2013128 (2013)","DOI":"10.1007\/978-88-7642-475-5_20"},{"issue":"1","key":"6_CR2","first-page":"207","volume":"16","author":"E. Camby","year":"2014","unstructured":"Camby, E., Cardinal, J., Fiorini, S., Schaudt, O.: The price of connectivity for vertex cover. Discrete Mathematics & Theoretical Computer Science\u00a016(1), 207\u2013224 (2014)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"6_CR3","unstructured":"Camby, E., Schaudt, O.: A note on connected dominating set in graphs without long paths and cycles. Manuscript, arXiv:1303.2868 (2013)"},{"issue":"26-28","key":"6_CR4","doi-asserted-by":"publisher","first-page":"2581","DOI":"10.1016\/j.tcs.2010.03.021","volume":"411","author":"J. Cardinal","year":"2010","unstructured":"Cardinal, J., Levy, E.: Connected vertex covers in dense graphs. Theor. Comput. Sci.\u00a0411(26-28), 2581\u20132590 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR5","first-page":"71","volume":"13","author":"P. Duchet","year":"1982","unstructured":"Duchet, P., Meyniel, H.: On Hadwiger\u2019s number and the stability number. Ann. Discrete Math.\u00a013, 71\u201374 (1982)","journal-title":"Ann. Discrete Math."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-11409-0_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Grigoriev","year":"2010","unstructured":"Grigoriev, A., Sitters, R.: Connected feedback vertex set in planar graphs. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol.\u00a05911, pp. 143\u2013153. Springer, Heidelberg (2010)"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ipl.2010.10.008","volume":"111","author":"P. Schweitzer","year":"2010","unstructured":"Schweitzer, P., Schweitzer, P.: Connecting face hitting sets in planar graphs. Inf. Process. Lett.\u00a0111(1), 11\u201315 (2010)","journal-title":"Inf. Process. Lett."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.7151\/dmgt.1192","volume":"23","author":"I.E. Zverovich","year":"2003","unstructured":"Zverovich, I.E.: Perfect connected-dominant graphs. Discuss. Math. Graph Theory\u00a023, 159\u2013162 (2003)","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T11:18:01Z","timestamp":1558955881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}