| No. |
Title |
Author |
Year |
| 1 |
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games |
Dorfman, Dani et al. |
2019 |
| 2 |
Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps |
Thorup, Mikkel et al. |
2019 |
| 3 |
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees |
Dorfman, Dani et al. |
2018 |
| 4 |
Pairing heaps: the forward variant |
Dorfman, Dani et al. |
2018 |
| 5 |
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps |
Kaplan, Haim et al. |
2018 |
| 6 |
Bottleneck Paths and Trees and Deterministic Graphical Games |
Chechik, Shiri et al. |
2016 |
| 7 |
Random-Edge Is Slower Than Random-Facet on Abstract Cubes |
Hansen, Thomas Dueholm et al. |
2016 |
