{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:19:11Z","timestamp":1725815951409},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_17","type":"book-chapter","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T20:23:50Z","timestamp":1422390230000},"page":"169-180","source":"Crossref","is-referenced-by-count":5,"title":["Domination in Some Subclasses of Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Arti","family":"Pandey","sequence":"first","affiliation":[]},{"given":"B. S.","family":"Panda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Domination in graphs: Advanced topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs: Advanced topics, vol.\u00a0209. Marcel Dekker Inc., New York (1998)"},{"key":"17_CR2","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs, vol.\u00a0208. Marcel Dekker Inc., New York (1998)"},{"key":"17_CR3","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Interactability: a guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco (1979)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"A.A. Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inform. Process. Lett.\u00a019, 37\u201340 (1984)","journal-title":"Inform. Process. Lett."},{"key":"17_CR5","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\u00e4dt, A.: The NP-completeness of steeiner tree and dominating set for chordal bipartite graphs. Theoret. Comput. Sci.\u00a053, 257\u2013265 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR6","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. Inform. Process. Lett.\u00a036, 231\u2013236 (1990)","journal-title":"Inform. Process. Lett."},{"key":"17_CR7","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 hamiltonial circuits. Inform. Process. Lett.\u00a056, 215\u2013219 (1995)","journal-title":"Inform. Process. Lett."},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-38756-2_16","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"M. Lu","year":"2013","unstructured":"Lu, M., Liu, T., Xu, K.: Independent domination: Reductions from circular- and triad-convex bipartite graphs to convex bipartite graphs. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol.\u00a07924, pp. 142\u2013152. Springer, Heidelberg (2013)"},{"key":"17_CR9","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.\u00a07936, pp. 721\u2013728. Springer, Heidelberg (2013)"},{"key":"17_CR10","doi-asserted-by":"crossref","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":"17_CR11","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 2012 and FAW 2012. LNCS, vol.\u00a07285, pp. 129\u2013138. Springer, Heidelberg (2012)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2012.12.021","volume":"507","author":"W.J.T. Liu","year":"2013","unstructured":"Liu, W.J.T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theoret. Comput. Sci.\u00a0507, 41\u201351 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1111\/j.1467-8640.2012.00428.x","volume":"28","author":"Y. Zhang","year":"2012","unstructured":"Zhang, Y., Bao, F.S.: A review of tree convex sets test. Computational Intelligence\u00a028, 358\u2013372 (2012)","journal-title":"Computational Intelligence"},{"key":"17_CR14","unstructured":"Bang-Jensen, J., Huang, J., MacGillivray, G., Yeo, A.: Domination in convex bipartite and convex-round graphs. Recent Trends in Computational Math. and its Applications. International Journal of Mathematical Sciences 5 (2006)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045, 634\u2013652 (1998)","journal-title":"J. ACM"}],"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-14974-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:59:40Z","timestamp":1559091580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}