DR. BORIE'S RESEARCH REVIEW

My research has concentrated in the design of algorithms for difficult graph problems that are NP-hard on arbitrary graphs, but which can be efficiently solved on certain structured classes of graphs. Together with colleagues, we have determined sufficient conditions such that, given a type of problem and a structural graph property, an efficient sequential algorithm can be automatically derived. We have also developed fast parallel algorithms for many of the same problems, requiring only polylogarithmic time using a polynomial number of processors.  Most recently I've been working on the design of algorithmic solutions for several variations of the pursuit-evasion problem on various graph classes.

DR. BORIE'S SELECTED PUBLICATIONS