My primary research area is graph theory, with a focus on the algorithmic complexities of fundamental graph problems like recognition, dominating set, clique cover, and Hamiltonian cycle on families of graphs. For some time now, I have been studying a family of graphs called well-covered graphs. A graph is well covered if every maximal independent set in it has the same size. My current focus in on finding hierarchical sub-classes that help define the P-NP boundary for certain fundamental graph problems for this family.
I am also trying to learn more about cryptography and its use in secure communication, and about java.