{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:27:52Z","timestamp":1773656872602,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540792277","type":"print"},{"value":"9783540792284","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79228-4_32","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T01:07:56Z","timestamp":1209431276000},"page":"364-374","source":"Crossref","is-referenced-by-count":15,"title":["Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"M.","family":"Demange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Ekim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-662-03750-8","volume-title":"Current Trends in Economics : Theory and Applications","author":"A. Alkan","year":"1999","unstructured":"Alkan, A.: Current Trends in Economics: Theory and Applications, pp. 30\u201339. Springer, Heidelberg (1999)"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jeth.1998.2469","volume":"84","author":"M. Balinski","year":"1999","unstructured":"Balinski, M., S\u00f6nmez, T.: A Tale of Two Mechanisms: Student placement. Journal of Economic Theory\u00a084, 73\u201394 (1999)","journal-title":"Journal of Economic Theory"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(00)00383-8","volume":"118","author":"T. Fujito","year":"2002","unstructured":"Fujito, T., Nagamochi, H.: A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics\u00a0118, 199\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, I.S.: College admissions and the stability of marriage. Amer. Math. Montly\u00a069, 9\u201314 (1962)","journal-title":"Amer. Math. Montly"},{"key":"32_CR5","volume-title":"Graph Theory","author":"F. Harary","year":"1994","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1994)"},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0406030","volume":"6","author":"J.D. Horton","year":"1993","unstructured":"Horton, J.D., Kilakos, K.: Minimum edge dominating sets. SIAM J. Disc. Math.\u00a06(3), 375\u2013387 (1993)","journal-title":"SIAM J. Disc. Math."},{"issue":"1","key":"32_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1006","volume":"15","author":"S.F. Hwang","year":"1995","unstructured":"Hwang, S.F., Chang, G.J.: The edge domination problem. Discuss. Math. Graph. Theory\u00a015(1), 51\u201357 (1995)","journal-title":"Discuss. Math. Graph. Theory"},{"key":"32_CR8","unstructured":"Mitchell, S.L., Hedetniemi, S.T.: Edge domination in trees. In: Proc. of the 8th Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1977), pp. 489\u2013509 (1977)"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0020-0190(95)94093-8","volume":"56","author":"A. Srinivasan","year":"1995","unstructured":"Srinivasan, A., Madhukar, K., Nagavamsi, P., Pandu Rangan, C., Chang, M.-S.: Edge domination on bipartite permutation graphs and cotriangulated graphs. Inform. Process. Lett.\u00a056(3), 165\u2013171 (1995)","journal-title":"Inform. Process. Lett."},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M. Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math.\u00a038, 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:25:31Z","timestamp":1558265131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540792277","9783540792284"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}