9 citations · 17 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate +3
A heapable sequence is a sequence of numbers that can be arranged in a "min-heap data structure". Finding a longest heapable subsequence of a given sequence was proposed by Byers,…
cs.DS2016★ 8 cited
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
Pinyan Lu, Kuan Yang, Chihao Zhang +1
Graph coloring is arguably the most exhaustively studied problem in the area of approximate counting. It is conjectured that there is a fully polynomial-time (randomized) approxima…