Kristina Vušković

Vušković was born on 6 May 1967 in Belgrade.^[1][2] She graduated summa cum laude from the Courant Institute of Mathematical Sciences of New York University in 1989, majoring in mathematics and computer science, and completed her PhD in Algorithms, Combinatorics and Optimization at Carnegie Mellon University in 1994.^[3][1][2] Her dissertation, supervised by Gérard Cornuéjols, was Holes in Bipartite Graphs.^[4]

After postdoctoral research as an NSERC Canada International Fellow at the University of Waterloo, she became an assistant professor of mathematics at the University of Kentucky, in 1996.^[3][2] She moved to Leeds in 2000, and was given the chair of algorithms and combinatorics at Leeds in 2011.^[3] Since 2007 she has also been a professor of computer science at Union University (Serbia).^[1][2]

Vušković's research in graph theory concerns the structure and algorithms of hereditary classes of graphs. Her results include the recognition of perfect graphs in polynomial time;^[5] she has also worked in combinatorial algorithms for graph coloring of perfect graphs.^[6]