Through a Summer Undergraduate Research Fellowship, Jenny Quan is exploring the mathematical principles behind Rubik's cubes.

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at 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 ...

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 ...

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

On the 27th of June 2025, M.Sc. Nicola Rizzo defends his PhD thesis on Indexable Sequence Graphs: Exploiting Uniqueness in the Pangenome Era. The thesis is related to research done in the Department ...

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

Computer scientists are constantly searching for ways to squeeze ever more bandwidth from communications networks. Now a new approach to understanding a basic concept in graph theory, known as "vertex ...

Expanders graphs are sparse but well-connected. These seemingly contrasting properties have led to many applications in theoretical computer science, from complexity ...

A research team has developed a new technology that enables to process a large-scale graph algorithm without storing the graph in the main memory or on disks. A KAIST research team has developed a new ...