Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan. A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. In Naoki Katoh, Amit Kumar, editors, WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Volume 6552 of Lecture Notes in Computer Science, pages 191-201, Springer, 2011. [doi]
@inproceedings{GhoshNR11,
title = {A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs},
author = {Esha Ghosh and N. S. Narayanaswamy and C. Pandu Rangan},
year = {2011},
doi = {10.1007/978-3-642-19094-0_20},
url = {http://dx.doi.org/10.1007/978-3-642-19094-0_20},
tags = {graph-rewriting, C++, rewriting},
researchr = {https://researchr.org/publication/GhoshNR11},
cites = {0},
citedby = {0},
pages = {191-201},
booktitle = {WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings},
editor = {Naoki Katoh and Amit Kumar},
volume = {6552},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-19093-3},
}