{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:58:00Z","timestamp":1770227880382,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540667315","type":"print"},{"value":"9783540467847","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_10","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T12:02:55Z","timestamp":1175774575000},"page":"89-101","source":"Crossref","is-referenced-by-count":26,"title":["Induced Matchings in Regular Graphs and Trees"],"prefix":"10.1007","author":[{"given":"Michele","family":"Zito","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01277956","volume":"5","author":"N. Alon","year":"1995","unstructured":"N. Alon, U. Feige, A. Wigderson, and D. Zuckerman. Derandomized Graph Products. Computational Complexity, 5:60\u201375, 1995. 96","journal-title":"Computational Complexity"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"P. Berman and M. Karpinski. On Some Tighter Inapproximability Results. In Proc. 26th I.C.A.L.P., Springer-Verlag, 1999. 96","DOI":"10.1007\/3-540-48523-6_17"},{"issue":"1-3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K. Cameron","year":"1989","unstructured":"K. Cameron. Induced Matchings. Discr. Applied Math., 24(1-3):97\u2013102, 1989. 90,98","journal-title":"Discr. Applied Math."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"P. Crescenzi. A Short Guide to Approximation Preserving Reductions. In Proc. 12th Conf. on Comput. Complexity, pages 262\u2013273, Ulm, 1997. 93","DOI":"10.1109\/CCC.1997.612321"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0012-365X(88)90196-3","volume":"72","author":"P. Erd?os","year":"1988","unstructured":"P. Erd?os. Problems and Results in Combinatorial Analysis and Graph Theory. Discr. Math., 72:81\u201392, 1988. 89","journal-title":"Discr. Math."},{"issue":"1-2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0012-365X(89)90163-5","volume":"78","author":"R. J. Faudree","year":"1989","unstructured":"R. J. Faudree, A. Gy\u00e1rfas, R. H. Schelp, and Z. Tuza. Induced Matchings in Bipartite Graphs. Discr. Math., 78(1-2):83\u201387, 1989. 89","journal-title":"Discr. Math."},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"F. Gavril. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques and Maximum Independent Set of a Chordal Graph. SIAM J. Comp., 1(2):180\u2013187, June 1972. 90, 98","journal-title":"SIAM J. Comp."},{"key":"10_CR8","unstructured":"M. R. Garey and D. S. Johnson. Computer and Intractability, a Guide to the Theory of NP-Completeness. Freeman and Company, 1979. 94"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-5060(08)70322-4","volume":"2","author":"B. Korte","year":"1978","unstructured":"B. Korte and D. Hausmann. An Analysis of the Greedy Heuristic for Independence Systems. Ann. Discr. Math., 2:65\u201374, 1978. 90","journal-title":"Ann. Discr. Math."},{"key":"10_CR10","unstructured":"S. Khanna and S. Muthukrishnan. Personal communication. 94"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0012-365X(96)00125-2","volume":"170","author":"J. Liu","year":"1997","unstructured":"J. Liu and H. Zhou. Maximum Induced Matchings in Graphs. Discr. Math., 170:277\u2013281, 1997. 89","journal-title":"Discr. Math."},{"key":"10_CR12","unstructured":"C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994. 93"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. H. Papadimitriou","year":"1991","unstructured":"C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation and Complexity Classes. J. Comp. Sys. Sciences, 43:425\u2013440, 1991. 93","journal-title":"J. Comp. Sys. Sciences"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","volume":"15","author":"L. J. Stockmeyer","year":"1982","unstructured":"L. J. Stockmeyer and V. V. Vazirani. NP-Completeness of Some Generalizations of the Maximum Matching Problem. I.P.L., 15(1):14\u201319, August 1982. 89","journal-title":"I.P.L."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(93)90590-P","volume":"120","author":"A. Steger","year":"1993","unstructured":"A. Steger and M. Yu. On Induced Matchings. Discr. Math., 120:291\u2013295, 1993. 89","journal-title":"Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T03:38:12Z","timestamp":1556336292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}