Quantum computers promise to speed calculations dramatically in some key areas such as computational chemistry and high-speed networking. But they're so different from today's computers that ...

Our research is focused on graph algorithms, from both a theoretical perspective, and a practical perspective motivated by real-world problems in Bioinformatics, such as genome sequencing technologies ...

Tomescu: Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. IEEE/ACM Trans. Comput. Biology Bioinform.15(1): 96-108 (2018) (also WABI 2015) K. E. van Rens, V. Mäkinen, ...

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential ...

CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...

Puneet Gupta's research highlights the immense potential of greedy algorithms in addressing timing closure challenges.