{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:18Z","timestamp":1725541938402},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_38","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T09:04:58Z","timestamp":1260176698000},"page":"452-464","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Grigoriev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bert","family":"Marchal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalya","family":"Usotskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5-6","key":"38_CR1","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1017\/S0963548305007017","volume":"14","author":"N. Alon","year":"2005","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Maxcut in H-Free Graphs. Comb. Probab. Comput.\u00a014(5-6), 629\u2013647 (2005)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"38_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. J. ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"6","key":"38_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput.\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"38_CR4","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. Theor. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering Treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 1\u201316. Springer, Heidelberg (2005)"},{"issue":"5","key":"38_CR6","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.aim.2009.02.018","volume":"221","author":"T. Bohman","year":"2009","unstructured":"Bohman, T.: The Triangle-Free Process. Advances in Math.\u00a0221(5), 1653\u20131677 (2009)","journal-title":"Advances in Math."},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.endm.2009.02.008","volume":"32","author":"D. Br\u00fcgmann","year":"2009","unstructured":"Br\u00fcgmann, D., Komusiewicz, C., Moser, H.: On Generating Triangle-Free Graphs. Electronic Notes in Discrete Mathematics\u00a032, 51\u201358 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"11-12","key":"38_CR8","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1016\/j.disc.2005.11.065","volume":"307","author":"J.E. Dunbar","year":"2007","unstructured":"Dunbar, J.E., Frick, M.: The Path Partition Conjecture is True for Claw-Free Graphs. Discrete Math.\u00a0307(11-12), 1285\u20131290 (2007)","journal-title":"Discrete Math."},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-75520-3_33","volume-title":"Algorithms \u2013 ESA 2007","author":"F. Kammer","year":"2007","unstructured":"Kammer, F.: Determining the Smallest k Such That G Is k-Outerplanar. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 359\u2013370. Springer, Heidelberg (2007)"},{"issue":"1","key":"38_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/1098-2418(200101)18:1<61::AID-RSA5>3.0.CO;2-T","volume":"18","author":"D. Osthus","year":"2001","unstructured":"Osthus, D., Taraz, A.: Random Maximal H-Free Graphs. Random Struct. Algorithms\u00a018(1), 61\u201382 (2001)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"38_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01202354","volume":"13","author":"N. Robertson","year":"1993","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Hadwiger\u2019s Conjecture for K\n                  6-Free Graphs. Combinatorica\u00a013(3), 279\u2013361 (1993)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T18:46:29Z","timestamp":1552243589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}