research
∙
09/16/2022
Fast approximation of search trees on trees with centroid trees
Search trees on trees (STTs) generalize the fundamental binary search tr...
share
research
∙
01/21/2022
Fixed-point cycles and EFX allocations
We study edge-labelings of the complete bidirected graph ↔K_n with funct...
research
∙
07/10/2021
Analysis of Smooth Heaps and Slim Heaps
The smooth heap is a recently introduced self-adjusting heap [Kozma, Sar...
research
∙
10/02/2020
Splay trees on trees
Search trees on trees (STTs) are a far-reaching generalization of binary...
research
∙
04/30/2020
Geometric group testing
Group testing is concerned with identifying t defective items in a set o...
research
∙
12/30/2019
Exact exponential algorithms for two poset problems
Partially ordered sets (posets) are fundamental combinatorial objects wi...
research
∙
08/13/2019
Finding and counting permutations via CSPs
Permutation patterns and pattern avoidance have been intensively studied...
research
∙
02/23/2019
Faster and simpler algorithms for finding large patterns in permutations
Permutation patterns and pattern avoidance have been intensively studied...
research
∙
02/05/2019
Hamiltonicity below Dirac's condition
Dirac's theorem (1952) is a classical result of graph theory, stating th...
research
∙
09/05/2018
Multi-finger binary search trees
We study multi-finger binary search trees (BSTs), a far-reaching extensi...
research
∙
06/22/2018
Improved bounds for multipass pairing heaps and path-balanced binary search trees
We revisit multipass pairing heaps and path-balanced binary search trees...
research
∙
04/17/2018
Time- and space-optimal algorithms for the many-visits TSP
The many-visits traveling salesperson problem (MV-TSP) asks for an optim...
research
∙
02/20/2018
Selection from heaps, row-sorted matrices and X+Y using soft heaps
We use soft heaps to obtain simpler optimal algorithms for selecting the...
research
∙
02/15/2018