An algorithm outputting all safe partial solutions is called safe and complete ... String Problems Generalized to Labeled Graphs (and Pan-genomics) Many problems on strings can be naturally ...

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

sorting algorithms, algorithmic lower bounds, graph algorithms. This course is delivered through a combination of lectures and classes totalling a minimum of 30 hours across Winter Term.

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