@InProceedings{chandrasekaran_et_al:LIPIcs.IPEC.2020.7,
author = {Chandrasekaran, Karthekeyan and Grigorescu, Elena and Istrate, Gabriel and Kulkarni, Shubhang and Lin, Young-San and Zhu, Minshen},
title = {{Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.7},
URN = {urn:nbn:de:0030-drops-133102},
doi = {10.4230/LIPIcs.IPEC.2020.7},
annote = {Keywords: maximum binary tree, heapability, permutation directed acyclic graphs}
}