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.

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

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

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

If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a slippery concept. Perhaps one day there’s an accident or road closure ...

Graph databases explicitly express the connections between nodes, and are more efficient at the analysis of networks (computer, human, geographic, or otherwise) than relational databases. There has ...

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