External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree

Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. In Yixin Cao 0001, Marcin Pilipczuk, editors, 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). Volume 180 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Authors

Karthekeyan Chandrasekaran

This author has not been identified. Look up 'Karthekeyan Chandrasekaran' in Google

Elena Grigorescu

This author has not been identified. Look up 'Elena Grigorescu' in Google

Gabriel Istrate

This author has not been identified. Look up 'Gabriel Istrate' in Google

Shubhang Kulkarni

This author has not been identified. Look up 'Shubhang Kulkarni' in Google

Young-San Lin

This author has not been identified. Look up 'Young-San Lin' in Google

Minshen Zhu

This author has not been identified. Look up 'Minshen Zhu' in Google
runs on