{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:09Z","timestamp":1725701649921},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_54","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"624-635","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized Complexity of Induced H-Matching on Claw-Free Graphs"],"prefix":"10.1007","author":[{"given":"Danny","family":"Hermelin","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Mnich","sequence":"additional","affiliation":[]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"54_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"2-3","key":"54_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10107-005-0649-5","volume":"105","author":"K. Cameron","year":"2006","unstructured":"Cameron, K., Hell, P.: Independent packings in structured graphs. Math. Programming\u00a0105(2-3), 201\u2013213 (2006)","journal-title":"Math. Programming"},{"issue":"1","key":"54_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/jgt.20192","volume":"54","author":"M. Chudnovsky","year":"2007","unstructured":"Chudnovsky, M., Ovetsky, A.: Coloring quasi-line graphs. J. Graph Theory\u00a054(1), 41\u201350 (2007)","journal-title":"J. Graph Theory"},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.D.: The structure of claw-free graphs. In: Surveys in Combinatorics, vol.\u00a0327, pp. 153\u2013171. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"issue":"50","key":"54_CR5","doi-asserted-by":"publisher","first-page":"6982","DOI":"10.1016\/j.tcs.2011.09.010","volume":"412","author":"M. Cygan","year":"2011","unstructured":"Cygan, M., Philip, G., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Dominating set is fixed parameter tractable in claw-free graphs. Theoretical Computer Science\u00a0412(50), 6982\u20137000 (2011)","journal-title":"Theoretical Computer Science"},{"key":"54_CR6","doi-asserted-by":"crossref","unstructured":"Dell, H., Marx, D.: Kernelization of packing problems. In: Proc. SODA 2012, pp. 68\u201381 (2012)","DOI":"10.1137\/1.9781611973099.6"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"Faenza, Y., Oriolo, G., Stauffer, G.: An algorithmic decomposition of claw-free graphs leading to an O(n\n                3)-algorithm for the weighted stable set problem. In: Proc. SODA 2011, pp. 630\u2013646 (2011)","DOI":"10.1137\/1.9781611973082.49"},{"issue":"1-3","key":"54_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"R.J. Faudree","year":"1997","unstructured":"Faudree, R.J., Flandrin, E., Ryj\u00e1cek, Z.: Claw-free graphs - A survey. Discrete Math.\u00a0164(1-3), 87\u2013147 (1997)","journal-title":"Discrete Math."},{"issue":"1","key":"54_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science\u00a0410(1), 53\u201361 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"54_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00453-007-9146-y","volume":"52","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F.A., Stege, U., Thilikos, D.M., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica\u00a052(2), 167\u2013176 (2008)","journal-title":"Algorithmica"},{"key":"54_CR12","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"54_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-31155-0_14","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"P.A. Golovach","year":"2012","unstructured":"Golovach, P.A., Paulusma, D., van Leeuwen, E.J.: Induced Disjoint Paths in AT-Free Graphs. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 153\u2013164. Springer, Heidelberg (2012)"},{"key":"54_CR14","series-title":"LNCS","first-page":"515","volume-title":"ESA 2012","author":"P.A. Golovach","year":"2012","unstructured":"Golovach, P.A., Paulusma, D., van Leeuwen, E.J.: Induced Disjoint Paths in Claw-Free Graphs. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 515\u2013526. Springer, Heidelberg (2012)"},{"key":"54_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-22006-7_39","volume-title":"Automata, Languages and Programming","author":"D. Hermelin","year":"2011","unstructured":"Hermelin, D., Mnich, M., van Leeuwen, E.J., Woeginger, G.J.: Domination When the Stars Are Out. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 462\u2013473. Springer, Heidelberg (2011)"},{"key":"54_CR16","doi-asserted-by":"crossref","unstructured":"Hermelin, D., Wu, X.: Weak compositions and their applications to polynomial lower bounds for kernelization. In: Proc. SODA 2012, pp. 104\u2013113 (2012)","DOI":"10.1137\/1.9781611973099.9"},{"issue":"3","key":"54_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/jgt.20334","volume":"59","author":"A.D. King","year":"2008","unstructured":"King, A.D., Reed, B.A.: Bounding \u03c7 in terms of \u03c9 and \u0394 for quasi-line graphs. J. Graph Theory\u00a059(3), 215\u2013228 (2008)","journal-title":"J. Graph Theory"},{"issue":"3","key":"54_CR18","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D., Hell, P.: On the complexity of general graph factor problems. SIAM J. Computing\u00a012(3), 601\u2013609 (1983)","journal-title":"SIAM J. Computing"},{"key":"54_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11917496_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kneis","year":"2006","unstructured":"Kneis, J., M\u00f6lle, D., Richter, S., Rossmanith, P.: Divide-and-Color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 58\u201367. Springer, Heidelberg (2006)"},{"issue":"4","key":"54_CR20","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00453-003-1035-4","volume":"37","author":"D. Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Finding maximum induced matchings in subclasses of claw-free and p\n                5-free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica\u00a037(4), 327\u2013346 (2003)","journal-title":"Algorithmica"},{"key":"54_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/11561071_41","volume-title":"Algorithms \u2013 ESA 2005","author":"D. Marx","year":"2005","unstructured":"Marx, D.: Efficient Approximation Schemes for Geometric Problems? In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 448\u2013459. Springer, Heidelberg (2005)"},{"key":"54_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-95891-8_37","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"H. Moser","year":"2009","unstructured":"Moser, H.: A Problem Kernelization for Graph Packing. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 401\u2013412. Springer, Heidelberg (2009)"},{"key":"54_CR23","first-page":"107","volume-title":"Proc. ACiD 2006. Texts in Algorithmics","author":"H. Moser","year":"2006","unstructured":"Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. In: Broersma, H., Dantchev, S.S., Johnson, M., Szeider, S. (eds.) Proc. ACiD 2006. Texts in Algorithmics, vol.\u00a07, pp. 107\u2013118. King\u2019s College, London (2006)"},{"issue":"8","key":"54_CR24","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1016\/j.disc.2011.12.029","volume":"312","author":"G. Oriolo","year":"2012","unstructured":"Oriolo, G., Pietropaoli, U., Stauffer, G.: On the recognition of fuzzy circular interval graphs. Discrete Math.\u00a0312(8), 1426\u20131435 (2012)","journal-title":"Discrete Math."},{"issue":"3","key":"54_CR25","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.tcs.2005.10.009","volume":"351","author":"E. Prieto","year":"2006","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. Theoretical Computer Science\u00a0351(3), 437\u2013445 (2006)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T06:17:03Z","timestamp":1557209823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}