{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:07:28Z","timestamp":1743034048467,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319196466"},{"type":"electronic","value":"9783319196473"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19647-3_19","type":"book-chapter","created":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T09:03:08Z","timestamp":1435309388000},"page":"198-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Union Closed Tree Convex Sets"],"prefix":"10.1007","author":[{"given":"Tian","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,27]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes - A Survey","author":"A Brandstad","year":"1999","unstructured":"Brandstad, A., Le, V.B., Spinrad, J.P.: Graph Classes - A Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"key":"19_CR2","series-title":"Centre de Recherches Mathematiques","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-88-7642-475-5_12","volume-title":"The Seventh European Conference on Combinatorics, Graph Theory and Applications","author":"H Bruhn","year":"2013","unstructured":"Bruhn, H., Charbit, P., Telle, J.A.: The graph formulation of the union-closed sets conjecture. In: Nesetril, J., Pellegrini, M. (eds.) EuroComb 2013. CRM, pp. 73\u201378. Scuola Normale Superiore, Pisa (2013)"},{"key":"19_CR3","unstructured":"Bruhn, H. and Schaudt, O.: The journey of the union-closed sets conjecture. ArXiv 1212.4175v2 (2012)"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1111\/j.1467-8640.2012.00418.x","volume":"28","author":"FS Bao","year":"2012","unstructured":"Bao, F.S., Zhang, Y.: A review of tree convex sets test. Comput. Intell. 28(3), 358\u2013372 (2012)","journal-title":"Comput. Intell."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30, 514\u2013550 (1983)","journal-title":"J. ACM"},{"key":"19_CR6","first-page":"1293","volume-title":"Handbook of Combinatorics","author":"P Frankl","year":"1995","unstructured":"Frankl, P.: Handbook of Combinatorics, vol. 2, pp. 1293\u20131329. MIT Press, Cambridge (1995)"},{"key":"19_CR7","doi-asserted-by":"publisher","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"},{"key":"19_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. 6681, pp. 233\u2013243. Springer, Heidelberg (2011)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","first-page":"241","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)"},{"key":"19_CR10","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. 7924, pp. 142\u2013152. Springer, Heidelberg (2013)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-06089-7_17","volume-title":"Theory and Applications of Models of Computation","author":"M Lu","year":"2014","unstructured":"Lu, M., Liu, T., Tong, W., Lin, G., Xu, K.: Set cover, set packing and hitting set for tree convex and tree-like set systems. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) TAMC 2014. LNCS, vol. 8402, pp. 248\u2013258. Springer, Heidelberg (2014)"},{"key":"19_CR12","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. 7285, pp. 129\u2013138. Springer, Heidelberg (2012)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Wang, C., Chen, H., Lei, Z., Tang, Z., Liu, T., Xu, K.: Tree convex bipartite graphs: $$calNP$$-complete domination, hamiltonicity and treewidth. In: Proceedings of FAW (2014)","DOI":"10.1007\/978-3-319-08016-1_23"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19647-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:31:56Z","timestamp":1676025116000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19647-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319196466","9783319196473"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19647-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}