Chandrasekaran, Karthekeyan, Grigorescu, Elena, Istrate, Gabriel, Kulkarni, Shubhang, Lin, Young-San, and Zhu, Minshen. Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. Retrieved from https://par.nsf.gov/biblio/10293523. 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) . Web. doi:10.4230/LIPIcs.IPEC.2020.7.

Chandrasekaran, Karthekeyan, Grigorescu, Elena, Istrate, Gabriel, Kulkarni, Shubhang, Lin, Young-San, & Zhu, Minshen. Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), (). Retrieved from https://par.nsf.gov/biblio/10293523. https://doi.org/10.4230/LIPIcs.IPEC.2020.7

Chandrasekaran, Karthekeyan, Grigorescu, Elena, Istrate, Gabriel, Kulkarni, Shubhang, Lin, Young-San, and Zhu, Minshen. "Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree". 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) (). Country unknown/Code not available. https://doi.org/10.4230/LIPIcs.IPEC.2020.7. https://par.nsf.gov/biblio/10293523.

@article{osti_10293523,
place = {Country unknown/Code not available}, title = {Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree}, url = {https://par.nsf.gov/biblio/10293523}, DOI = {10.4230/LIPIcs.IPEC.2020.7}, abstractNote = {}, journal = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)}, author = {Chandrasekaran, Karthekeyan and Grigorescu, Elena and Istrate, Gabriel and Kulkarni, Shubhang and Lin, Young-San and Zhu, Minshen}, }