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

DOI10.4230/lipics.ipec.2020.7arXiv2110.00495OpenAlexW3110769028MaRDI QIDQ6089651

Karthekeyan Chandrasekaran, Elena Grigorescu, Young-San Lin, Minshen Zhu, Gabriel I. Istrate, Shubhang Kulkarni

Publication date: 13 November 2023

Full work available at URL: https://arxiv.org/abs/2110.00495

zbMATH Keywords

maximum binary treeheapabilitypermutation directed acyclic graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• The language (and series) of Hammersley-type processes
• Almost-sure asymptotics for the number of heaps inside a random sequence
• Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
• The Surprising Mathematics of Longest Increasing Subsequences
• Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process
• On the heapability of finite partial orders
• Heapable Sequences and Subseqeuences
• Transitive Orientation of Graphs and Identification of Permutation Graphs

This page was built for publication: Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree