Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into distinct ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

My general research interest is in the area of combinatorics (graph theory) and algebra. My first exposure to research is through graph labeling when I was an undergraduate student. During my PhD, I ...