Hao Chen, Tian Liu. Maximum Edge Bicliques in Tree Convex Bipartite Graphs. In Mingyu Xiao, Frances A. Rosamond, editors, Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings. Volume 10336 of Lecture Notes in Computer Science, pages 47-55, Springer, 2017. [doi]
@inproceedings{ChenL17-18,
title = {Maximum Edge Bicliques in Tree Convex Bipartite Graphs},
author = {Hao Chen and Tian Liu},
year = {2017},
doi = {10.1007/978-3-319-59605-1_5},
url = {https://doi.org/10.1007/978-3-319-59605-1_5},
researchr = {https://researchr.org/publication/ChenL17-18},
cites = {0},
citedby = {0},
pages = {47-55},
booktitle = {Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings},
editor = {Mingyu Xiao and Frances A. Rosamond},
volume = {10336},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-59605-1},
}