56 citations · 70 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Computing nearest neighbour interchange distances between ranked phylogenetic trees
Lena Collienne, Alex Gavryushkin
Many popular algorithms for searching the space of leaf-labelled trees are based on tree rearrangement operations. Under any such operation, the problem is reduced to searching a g…
cs.DS2014★ 13 cited
Dynamic Algorithms for Interval Scheduling on a Single Machine
Alex Gavryushkin, Bakhadyr Khoussainov, Mikhail Kokho +1
We investigate dynamic algorithms for the interval scheduling problem. Our algorithm runs in amortised time for query operation and for insertion and rem…