Overview
Publications
(3)
We develop graph-based algorithms for applied combinatorial optimization problems. Problems we are working on include the computation of distances between graphs and trees and enumeration of matchings and paths under diversity constraints.
