Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing ...

RECOMB 2018: 105-121 Network flows, and in particular min-cost flows, are a computational model generalizing several classical problems on graphs. We were among ... I. Tomescu: Complexity and ...

in particular reference to computational complexity. Computation with quantum qubit circuits will be developed. Glover's search algorithm and Shor's factorization algorithms will be covered. The more ...

Some current research interests include studying algorithms and computational complexity when moving from sequences to variation graphs in (pan-)genomics, and studying applications of different index ...