Office:
Phone: (000) 000-0000
Website: http://www.cs.colostate.edu/~rmm/
About
My research is on efficient algorithms for combinatorial problems. I am especially interested in recursive decompositions of arbitrary graphs and digraphs, algorithms for classes of graphs that are subclasses of the class of perfect graphs, and classes of graphs that have geometric representations.
