{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:19Z","timestamp":1725535819013},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02029-2_8","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T14:12:39Z","timestamp":1248703959000},"page":"77-86","source":"Crossref","is-referenced-by-count":9,"title":["Dominating Induced Matchings"],"prefix":"10.1007","author":[{"given":"Domingos M.","family":"Cardoso","sequence":"first","affiliation":[]},{"given":"Vadim V.","family":"Lozin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.tcs.2007.04.006","volume":"381","author":"A. Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt, A., Eschen, E.M., Sritharan, R.: The induced matching and chain subgraph cover problems for convex bipartite graphs. Theoret. Comput. Sci.\u00a0381, 260\u2013265 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR2","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 Appl. Math.\u00a024, 97\u2013102 (1989)","journal-title":"Discrete Appl. Math."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput.\u00a0 Syst.\u00a033, 125\u2013150 (2000)","journal-title":"Theory Comput.\u00a0 Syst."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"3060","DOI":"10.1016\/j.dam.2008.01.021","volume":"156","author":"D.M. Cardoso","year":"2008","unstructured":"Cardoso, D.M., Cerdeira, J.O., Delorme, C., Silva, P.C.: Efficient edge domination in regular graphs. Discrete App. Math.\u00a0156, 3060\u20133065 (2008)","journal-title":"Discrete App. Math."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. International J.\u00a0Foundations of Computer Sci.\u00a011, 423\u2013443 (2000)","journal-title":"International J.\u00a0Foundations of Computer Sci."},{"key":"8_CR6","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 Appl. Math.\u00a0101, 157\u2013165 (2000)","journal-title":"Discrete Appl. Math."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0020-0190(93)90084-M","volume":"48","author":"D.L. Grinstead","year":"1993","unstructured":"Grinstead, D.L., Slater, P.J., Sherwani, N.A., Holmes, N.D.: Efficient edge domination problems in graphs. Inform. Process. Lett.\u00a048, 221\u2013228 (1993)","journal-title":"Inform. Process. Lett."},{"key":"8_CR8","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 \n                  \n                    \n                  \n                  $P\\sb 5$\n                -free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica\u00a037, 327\u2013346 (2003)","journal-title":"Algorithmica"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(94)90026-4","volume":"133","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: Regular codes in regular graphs are difficult. Discrete Math\u00a0133, 191\u2013205 (1994)","journal-title":"Discrete Math"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(01)00185-5","volume":"81","author":"V.V. Lozin","year":"2002","unstructured":"Lozin, V.V.: On maximum induced matchings in bipartite graphs. Inform. Process. Lett.\u00a081, 7\u201311 (2002)","journal-title":"Inform. Process. Lett."},{"key":"8_CR11","first-page":"57","volume":"34","author":"V.V. Lozin","year":"2006","unstructured":"Lozin, V.V., Rautenbach, R.: The tree- and clique-width of bipartite graphs in special classes. Australasian J.\u00a0Combinatorics\u00a034, 57\u201367 (2006)","journal-title":"Australasian J.\u00a0Combinatorics"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0166-218X(01)00198-6","volume":"119","author":"C.L. Lu","year":"2002","unstructured":"Lu, C.L., Ko, M.-T., Tang, C.Y.: Perfect edge domination and efficient edge domination in graphs. Discrete Appl. Math.\u00a0119, 227\u2013250 (2002)","journal-title":"Discrete Appl. Math."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0166-218X(98)00057-2","volume":"87","author":"C.L. Lu","year":"1998","unstructured":"Lu, C.L., Tang, C.Y.: Solving the weighted efficient edge domination problem on bipartite permutation graphs. Discrete Appl. Math.\u00a087, 203\u2013211 (1998)","journal-title":"Discrete Appl. Math."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/S0129054199000241","volume":"10","author":"J.A. Makowsky","year":"1999","unstructured":"Makowsky, J.A., Rotics, U.: On the clique-width of graphs with few P\n                4\u2019s. International J.\u00a0Foundations of Computer Sci.\u00a010, 329\u2013348 (1999)","journal-title":"International J.\u00a0Foundations of Computer Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:09:18Z","timestamp":1552115358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}