Daniel Lokshtanov’s work explores the limits of what computers can solve, paving the way for advances in artificial intelligence and computational efficiency.

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...

With a $9.2 million grant from Intelligence Advanced Research Projects Activity (IARPA), Prof. Andrew A. Chien will lead a team of University of Chicago computer science researchers building the ...

A collaboration from RIKEN, the Tokyo Institute of Technology, and University College Dublin won top place in the June 2014 Graph 500 supercomputer ranking using the K computer, which is located in ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...

On the 10th of October 2025, M.Sc. (Tech) Chamalee Wickrama Arachchi defends her PhD thesis on Methods for Finding Structures in Feature-rich Graph Networks. The thesis is related to research done in ...