{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:33Z","timestamp":1725563553219},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157806"},{"type":"electronic","value":"9783642157813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15781-3_10","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T07:40:03Z","timestamp":1283326803000},"page":"112-122","source":"Crossref","is-referenced-by-count":2,"title":["Induced Matchings in Subcubic Planar Graphs"],"prefix":"10.1007","author":[{"given":"Ross J.","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Mnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(92)90678-9","volume":"108","author":"L.D. Andersen","year":"1992","unstructured":"Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Discrete Math.\u00a0108(1-3), 231\u2013252 (1992); Topological, algebraical and combinatorial structures. Frol\u00edk\u2019s memorial volume","journal-title":"Discrete Math."},{"issue":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1109\/JSAC.2004.830909","volume":"22","author":"H. Balakrishnan","year":"2004","unstructured":"Balakrishnan, H., Barrett, C.L., Kumar, V.S.A., Marathe, M.V., Thite, S.: The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks. IEEE Journal on Selected Areas in Communications\u00a022(6), 1069\u20131079 (2004)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","volume":"81","author":"F.R.K. Chung","year":"1990","unstructured":"Chung, F.R.K., Gy\u00e1rf\u00e1s, A., Tuza, Z., Trotter, W.T.: The maximum number of edges in 2K\n                  2-free graphs of bounded degree. Discrete Math.\u00a081(2), 129\u2013135 (1990)","journal-title":"Discrete Math."},{"issue":"1","key":"10_CR4","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.F., Zito, M.: On the approximability of the maximum induced matching problem. J. Discrete Algorithms\u00a03(1), 79\u201391 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Erman, R., Kowalik, L., Krnc, M., Walen, T.: Improved induced matchings in sparse graphs. In: IWPEC, pp. 134\u2013148 (2009)","DOI":"10.1007\/978-3-642-11269-0_11"},{"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":"Faudree, R.J., Gy\u00e1rf\u00e1s, A., Schelp, R.H., Tuza, Z.: Induced matchings in bipartite graphs. Discrete Math.\u00a078(1-2), 83\u201387 (1989)","journal-title":"Discrete Math."},{"issue":"B","key":"10_CR7","first-page":"205","volume":"29","author":"R.J. Faudree","year":"1990","unstructured":"Faudree, R.J., Schelp, R.H., Gy\u00e1rf\u00e1s, A., Tuza, Z.: The strong chromatic index of graphs. Ars Combin.\u00a029(B), 205\u2013211 (1990); The 12th BCC (Norwich, 1989)","journal-title":"Ars Combin."},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/jgt.3190170204","volume":"17","author":"P. Hor\u00e1k","year":"1993","unstructured":"Hor\u00e1k, P., He, Q., Trotter, W.T.: Induced matchings in cubic graphs. J. Graph Theory\u00a017(2), 151\u2013160 (1993)","journal-title":"J. Graph Theory"},{"key":"10_CR9","unstructured":"Kanj, I.A., Pelsmajer, M.J., Xia, G., Schaefer, M.: On the induced matching problem. In: STACS, pp. 397\u2013408 (2008)"},{"issue":"1","key":"10_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(1), 7\u201311 (2002)","journal-title":"Inform. Process. Lett."},{"key":"10_CR11","volume-title":"Algorithms and data structures","author":"K. Mehlhorn","year":"2008","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and data structures. Springer, Berlin (2008)"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.dam.2008.07.011","volume":"157","author":"H. Moser","year":"2009","unstructured":"Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem. Discrete Appl. Math.\u00a0157(4), 715\u2013727 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jda.2008.09.005","volume":"7","author":"H. Moser","year":"2009","unstructured":"Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms\u00a07(2), 181\u2013190 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR14","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, Oxford (2006)"},{"issue":"1","key":"10_CR15","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 generalizations of the maximum matching problem. Inform. Process. Lett.\u00a015(1), 14\u201319 (1982)","journal-title":"Inform. Process. Lett."},{"key":"10_CR16","unstructured":"Wegner, G.: Graphs with given diameter and a coloring problem. Technical report, Institut f\u00fcr Mathematik, Universit\u00e4t Dortmund (1977)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15781-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T01:43:39Z","timestamp":1552959819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15781-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157806","9783642157813"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15781-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}