| No. |
Title |
Author |
Year |
| 1 |
Fast Approximation of Search Trees on Trees with Centroid Trees |
Berendsohn, Benjamin Aram et al. |
2023 |
| 2 |
Fixed-Point Cycles and Approximate EFX Allocations |
Berendsohn, Benjamin Aram et al. |
2022 |
| 3 |
Analysis of Smooth Heaps and Slim Heaps |
Hartmann, Maria et al. |
2021 |
| 4 |
Exact Exponential Algorithms for Two Poset Problems |
Kozma, László |
2020 |
| 5 |
Finding and Counting Permutations via CSPs |
Berendsohn, Benjamin Aram et al. |
2019 |
| 6 |
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees |
Dorfman, Dani et al. |
2018 |
| 7 |
Multi-Finger Binary Search Trees |
Chalermsook, Parinya et al. |
2018 |
| 8 |
Pairing heaps: the forward variant |
Dorfman, Dani et al. |
2018 |
| 9 |
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps |
Kaplan, Haim et al. |
2018 |
| 10 |
Hitting Set for Hypergraphs of Low VC-dimension |
Bringmann, Karl et al. |
2016 |
