4 citations · 9 across the 13 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2017
On the heapability of finite partial orders
János Balogh, Cosmin Bonchiş, Diana Diniş +2
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, whic…
math.CO2015
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
Gabriel Istrate, Cosmin Bonchis
We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al). We show that an extension of patience sortin…