| Publication | Date of Publication | Type |
|---|
| The two-squirrel problem and its relatives | 2026-01-28 | Paper |
| Pattern-avoiding access in binary search trees | 2025-08-05 | Paper |
| Fast approximation of search trees on trees with centroid trees | 2024-11-14 | Paper |
| Selection from heaps, row-sorted matrices, and \(X+Y\) using soft heaps | 2024-08-26 | Paper |
| Fixed-point cycles and approximate EFX allocations | 2024-08-06 | Paper |
| Splay trees on trees | 2024-07-19 | Paper |
| Optimization with pattern-avoiding input | 2023-10-06 | Paper |
| Finding and Counting Permutations via CSPs | 2023-02-03 | Paper |
| Fast approximation of search trees on trees with centroid trees | 2022-09-16 | Paper |
Multi-Finger Binary Search Trees
(available as arXiv preprint) | 2022-07-21 | Paper |
| Fixed-point cycles and EFX allocations | 2022-01-21 | Paper |
Pairing heaps: the forward variant
(available as arXiv preprint) | 2021-08-04 | Paper |
Improved bounds for multipass pairing heaps and path-balanced binary search trees
(available as arXiv preprint) | 2021-08-04 | Paper |
Finding and counting permutations via CSPs
Algorithmica | 2021-07-26 | Paper |
Time- and space-optimal algorithm for the many-visits TSP
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Time- and space-optimal algorithm for the many-visits TSP
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Smooth heaps and a dual view of self-adjusting data structures
SIAM Journal on Computing | 2020-10-29 | Paper |
| Splay trees on trees | 2020-10-02 | Paper |
| Geometric group testing | 2020-04-30 | Paper |
Hamiltonicity below Dirac's condition
(available as arXiv preprint) | 2020-02-24 | Paper |
A time- and space-optimal algorithm for the many-visits TSP
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Smooth heaps and a dual view of self-adjusting data structures
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Finding and counting permutations via CSPs
(available as arXiv preprint) | 2019-08-13 | Paper |
Hamiltonicity below Dirac's condition
(available as arXiv preprint) | 2019-02-05 | Paper |
Maximum Scatter TSP in Doubling Metrics
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved bounds for multipass pairing heaps and path-balanced binary search trees
(available as arXiv preprint) | 2018-06-22 | Paper |
Hitting Set for hypergraphs of low VC-dimension
(available as arXiv preprint) | 2018-03-02 | Paper |
| Binary search trees and rectangulations | 2016-03-26 | Paper |
Self-adjusting binary search trees: what makes them tick?
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Greedy is an almost optimal deque
Lecture Notes in Computer Science | 2015-10-30 | Paper |
| Pattern-avoiding access in binary search trees | 2015-07-24 | Paper |
Shattering, graph orientations, and connectivity
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Shattering, graph orientations, and connectivity
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Minimum Average Distance Triangulations
Algorithms – ESA 2012 | 2012-09-25 | Paper |
