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

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Dynamic graph algorithms and data structures represent a vital research frontier in computer science, underpinning applications from network analysis to real-time system monitoring. These methods ...

Rice quantum computing researchers have introduced a novel algorithm that earned the team a place in the global XPRIZE Quantum Applications competition.

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

This research topic explores the theoretical foundations and practical applications of graph labeling and coloring problems, both of which are central to modern combinatorics and computer science.