Kristina L. Vušković (Serbian: Кристина Л. Вушковић, born 6 May 1967) is a Serbian mathematician and theoretical computer scientist working in graph theory.
She is Professor in Algorithms and Combinatorics in the School of Computing at the University of Leeds, and a professor of computer science at Union University (Serbia).
[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.
[3] Since 2007 she has also been a professor of computer science at Union University (Serbia).