{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:41Z","timestamp":1761620921773},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322078"},{"type":"electronic","value":"9783540322085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_21","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:26:35Z","timestamp":1139995595000},"page":"270-281","source":"Crossref","is-referenced-by-count":9,"title":["Tighter Approximations for Maximum Induced Matchings in Regular Graphs"],"prefix":"10.1007","author":[{"given":"Zvi","family":"Gotthilf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K. Cameron","year":"1989","unstructured":"Cameron, K.: Induced matchings. Discrete Applied Mathematics\u00a024, 97\u2013102 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Cameron, K.: Induced matchings in intersection graphs. In: Proceedings of the Sixth International Conference on Graph Theory, Marseille, France (August 2000)","DOI":"10.1016\/S1571-0653(05)80122-2"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jda.2004.05.001","volume":"3","author":"W. Duckworth","year":"2005","unstructured":"Duckworth, W., Manlove, D., Zito, M.: On the approximability of the maximum induced matching problem. Journal of Discrete Algorithms\u00a03(1), 79\u201391 (2005)","journal-title":"Journal of Discrete Algorithms"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0012-365X(88)90196-3","volume":"72","author":"P. Erdos","year":"1988","unstructured":"Erdos, P.: Problems and results in combinatorial analysis and graph theory. Discrete Mathematics\u00a072, 81\u201392 (1988)","journal-title":"Discrete Mathematics"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0012-365X(89)90163-5","volume":"78","author":"R.J. Faudree","year":"1989","unstructured":"Faudree, R.J., Gyarfas, A., Schelp, R.H., Tuza, Z.: Induced matchings in bipartite graphs. Discrete Mathematics\u00a078, 83\u201387 (1989)","journal-title":"Discrete Mathematics"},{"key":"21_CR6","first-page":"239","volume":"89","author":"G. Fricke","year":"1992","unstructured":"Fricke, G., Lasker, R.: Strong matchings in trees. Congressus Numerantium\u00a089, 239\u2013244 (1992)","journal-title":"Congressus Numerantium"},{"key":"21_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(93)90223-B","volume":"44","author":"M.C. Golumbic","year":"1993","unstructured":"Golumbic, M.C., Laskar, R.C.: Irredundancy in circular arc graphs. Discrete Applied Mathematics\u00a044, 79\u201389 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","volume":"101","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Lewenstein, M.: New results on induced matchings. Discrete Applied Mathematics\u00a0101, 157\u2013165 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/jgt.3190170204","volume":"17","author":"P. Horak","year":"1993","unstructured":"Horak, P., Qing, H., Trotter, W.T.: Induced matchings in cubic graphs. Journal of Graph Theory\u00a017(2), 151\u2013160 (1993)","journal-title":"Journal of Graph Theory"},{"key":"21_CR11","unstructured":"Ko, C.W., Shepherd, F.B.: Adding an identity to a totally unimodular matrix. Working paper LSEOR.94.14, London School of Economics, Operational Research Group (1994)"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(93)90590-P","volume":"120","author":"A. Steger","year":"1993","unstructured":"Steger, A., Yu, M.: On induced matchings. Discrete Mathematics\u00a0120, 291\u2013295 (1993)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","volume":"15","author":"L.J. Stockmeyer","year":"1982","unstructured":"Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalization of the maximum matching problem. Information Processing Letters\u00a015(1), 14\u201319 (1982)","journal-title":"Information Processing Letters"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-46784-X_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Zito","year":"1999","unstructured":"Zito, M.: Induced matchings in regular graphs and trees. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 89\u2013100. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:23Z","timestamp":1619507663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11671411_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}