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

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.

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

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

A Rutgers professor who studies and improves the design of algorithms – human-made instructions computers follow to solve problems and perform computations – has been selected to receive a 2024 Sloan ...

Discover why algorithms and data structures form the foundation of contemporary computing. Discover how DS&A spurs innovation ...

If someone asks you to determine whether two objects are the same, it might seem like a trivial request. In most everyday cases, a quick glance is enough for you to render an accurate judgment. But in ...