{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:04Z","timestamp":1759063684522},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_16","type":"book-chapter","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T20:43:48Z","timestamp":1369082628000},"page":"142-152","source":"Crossref","is-referenced-by-count":11,"title":["Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Min","family":"Lu","sequence":"first","affiliation":[]},{"given":"Tian","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1111\/j.1467-8640.2012.00418.x","volume":"28","author":"F.S. Bao","year":"2012","unstructured":"Bao, F.S., Zhang, Y.: A review of tree convex sets test. Comput. Intell.\u00a028(3), 358\u2013372 (2012), Old version: A survey of tree convex sets test. arXiv.0906.0205 (2009)","journal-title":"Comput. Intell."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-29700-7_10","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"D.Z. Chen","year":"2012","unstructured":"Chen, D.Z., Liu, X., Wang, H.: Computing maximum non-crossing matching in convex bipartite graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) FAW-AAIM 2012. LNCS, vol.\u00a07285, pp. 105\u2013116. Springer, Heidelberg (2012)"},{"issue":"5","key":"16_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P. Damaschke","year":"1990","unstructured":"Damaschke, P., M\u00fcller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inf. Process. Lett.\u00a036(5), 231\u2013236 (1990)","journal-title":"Inf. Process. Lett."},{"key":"16_CR4","first-page":"27","volume":"98","author":"M. Dom","year":"2009","unstructured":"Dom, M.: Algorithmic aspects of the consecutive ones property. Bulletin of the EATCS\u00a098, 27\u201359 (2009)","journal-title":"Bulletin of the EATCS"},{"key":"16_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"M.C. Golumbic","year":"1978","unstructured":"Golumbic, M.C., Goss, C.F.: Perfect elimination and chordal bipartite graphs. J. Graph Theory\u00a02, 155\u2013163 (1978)","journal-title":"J. Graph Theory"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F. Grover","year":"1967","unstructured":"Grover, F.: Maximum matching in a convex bipartite graph. Nav. Res. Logist. Q.\u00a014, 313\u2013316 (1967)","journal-title":"Nav. Res. Logist. Q."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-21204-8_26","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"W. Jiang","year":"2011","unstructured":"Jiang, W., Liu, T., Ren, T., Xu, K.: Two hardness results on feedback vertex sets. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol.\u00a06681, pp. 233\u2013243. Springer, Heidelberg (2011)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, W., Liu, T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theor. Comput. Sci (in press, 2013), doi:10.1016\/j.tcs.2012.12.021","DOI":"10.1016\/j.tcs.2012.12.021"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-22616-8_33","volume-title":"Combinatorial Optimization and Applications","author":"W. Jiang","year":"2011","unstructured":"Jiang, W., Liu, T., Xu, K.: Tractable feedback vertex sets in restricted bipartite graphs. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol.\u00a06831, pp. 424\u2013434. Springer, Heidelberg (2011)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(95)00145-3","volume":"56","author":"Y.D. Liang","year":"1995","unstructured":"Liang, Y.D., Blum, N.: Circular convex bipartite graphs: maximum matching and Hamiltonian circuits. Inf. Process. Lett.\u00a056, 215\u2013219 (1995)","journal-title":"Inf. Process. Lett."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/978-3-642-38768-5_65","volume-title":"COCOON 2013","author":"Z. Lu","year":"2013","unstructured":"Lu, Z., Liu, T., Xu, K.: Tractable connected domination for restricted bipartite graphs. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol.\u00a07936, pp. 721\u2013728. Springer, Heidelberg (2013)"},{"issue":"2-3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H. M\u00fcller","year":"1987","unstructured":"M\u00fcller, H., Brandst\u00e4t, A.: The NP-completeness of steiner tree and dominating set for chordal bipartite graphs. Theor. Comput. Sci.\u00a053(2-3), 257\u2013265 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR14","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.) FAW-AAIM 2012. LNCS, vol.\u00a07285, pp. 129\u2013138. Springer, Heidelberg (2012)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-31770-5_9","volume-title":"Combinatorial Optimization and Applications","author":"C. Wang","year":"2012","unstructured":"Wang, C., Liu, T., Jiang, W., Xu, K.: Feedback vertex sets on tree convex bipartite graphs. In: Lin, G. (ed.) COCOA 2012. LNCS, vol.\u00a07402, pp. 95\u2013102. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:20:09Z","timestamp":1557703209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}