{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T19:44:21Z","timestamp":1770234261595,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319530062","type":"print"},{"value":"9783319530079","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_27","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"308-319","source":"Crossref","is-referenced-by-count":4,"title":["Induced Matching in Some Subclasses of Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Arti","family":"Pandey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. S.","family":"Panda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piyush","family":"Dane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manav","family":"Kashyap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","volume":"15","author":"LJ Stockmeyer","year":"1982","unstructured":"Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalizations of the maximum matching problem. Inf. Process. Lett. 15, 14\u201319 (1982)","journal-title":"Inf. Process. Lett."},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K Cameron","year":"1989","unstructured":"Cameron, K.: Induced matchings. Discret. Appl. Math. 24, 97\u2013102 (1989)","journal-title":"Discret. Appl. Math."},{"key":"27_CR3","doi-asserted-by":"crossref","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 $$ {P}_5$$ -free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica 37, 327\u2013346 (2003)","journal-title":"Algorithmica"},{"key":"27_CR4","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. 1665, pp. 89\u2013101. Springer, Heidelberg (1999). doi: 10.1007\/3-540-46784-X_10"},{"key":"27_CR5","doi-asserted-by":"crossref","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. Discret. Algorithms 3, 79\u201391 (2005)","journal-title":"J. Discret. Algorithms"},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0020-0190(01)00185-5","volume":"81","author":"VV Lozin","year":"2002","unstructured":"Lozin, V.V.: On maximum induced matchings in bipartite graphs. Inf. Process. Lett. 81, 7\u201311 (2002)","journal-title":"Inf. Process. Lett."},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0012-365X(02)00803-8","volume":"266","author":"K Cameron","year":"2003","unstructured":"Cameron, K., Sritharan, R., Tang, Y.: Finding a maximum induced matching in weakly chordal graphs. Discret. Math. 266, 133\u2013142 (2003)","journal-title":"Discret. Math."},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","volume":"101","author":"M Golumbic","year":"2000","unstructured":"Golumbic, M., Lewenstein, M.: New results on induced matchings. Discret. Appl. Math. 101, 157\u2013165 (2000)","journal-title":"Discret. Appl. Math."},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(95)00145-3","volume":"56","author":"YD Liang","year":"1995","unstructured":"Liang, Y.D., Blum, N.: Circular convex bipartite graphs: maximum matching and hamiltonial circuits. Inf. Process. Lett. 56, 215\u2013219 (1995)","journal-title":"Inf. Process. Lett."},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-07956-1_22","volume-title":"Algorithmic Aspects in Information and Management","author":"T Liu","year":"2014","unstructured":"Liu, T.: Restricted bipartite graphs: comparison and hardness results. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 241\u2013252. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-07956-1_22"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Liu, T., Lu, M., Lu, Z., Xu, K.: Circular convex bipartite graphs: feedback vertex sets. Theoret. Comput. Sci. (2014). doi: 10.1016\/j.tcs.2014.05.001","DOI":"10.1016\/j.tcs.2014.05.001"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/978-3-642-38768-5_65","volume-title":"Computing and Combinatorics","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Liu, T., Xu, K.: Tractable connected domination for restricted bipartite graphs (extended abstract). In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 721\u2013728. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38768-5_65"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-14974-5_17","volume-title":"Algorithms and Discrete Applied Mathematics","author":"A Pandey","year":"2015","unstructured":"Pandey, A., Panda, B.S.: Domination in some subclasses of bipartite graphs. In: Ganguly, S., Krishnamurti, R. (eds.) CALDAM 2015. LNCS, vol. 8959, pp. 169\u2013180. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-14974-5_17"},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10878-015-9917-3","volume":"32","author":"H Chen","year":"2016","unstructured":"Chen, H., Lei, Z., Liu, T., Tang, Z., Wang, C., Xu, K.: Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J. Comb. Optim. 32, 95\u2013110 (2016)","journal-title":"J. Comb. Optim."},{"key":"27_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.tcs.2012.12.021","volume":"507","author":"WJT Liu","year":"2013","unstructured":"Liu, W.J.T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theoret. Comput. Sci. 507, 41\u201351 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-29700-7_12","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Y Song","year":"2012","unstructured":"Song, Y., Liu, T., Xu, K.: Independent domination on tree convex bipartite graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM\/FAW -2012. LNCS, vol. 7285, pp. 129\u2013138. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29700-7_12"},{"key":"27_CR17","first-page":"260","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. Inf. Process. Lett. 381, 260\u2013265 (2007)","journal-title":"Inf. Process. Lett."},{"key":"27_CR18","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1111\/j.1467-8640.2012.00428.x","volume":"28","author":"Y Zhang","year":"2012","unstructured":"Zhang, Y., Bao, F.: A review of tree convex sets test. Comput. Intell. 28, 358\u2013372 (2012)","journal-title":"Comput. Intell."},{"key":"27_CR19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"MC Golumbic","year":"1978","unstructured":"Golumbic, M.C., Goss, C.F.: Perfect elimination and chordal bipartite graphs. J. Graph Theory 2, 155\u2013163 (1978)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:35:24Z","timestamp":1498368924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}