Paniz Abedin, Sahar Hooshmand, Arnab Ganguly 0002, Sharma V. Thankachan. The Heaviest Induced Ancestors Problem Revisited. In Gonzalo Navarro, David Sankoff, Binhai Zhu, editors, Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. Volume 105 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
@inproceedings{AbedinH0T18,
title = {The Heaviest Induced Ancestors Problem Revisited},
author = {Paniz Abedin and Sahar Hooshmand and Arnab Ganguly 0002 and Sharma V. Thankachan},
year = {2018},
doi = {10.4230/LIPIcs.CPM.2018.20},
url = {https://doi.org/10.4230/LIPIcs.CPM.2018.20},
researchr = {https://researchr.org/publication/AbedinH0T18},
cites = {0},
citedby = {0},
booktitle = {Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China},
editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu},
volume = {105},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-074-3},
}