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

Editor’s note: This post first appeared on Carl Cheo’s website. We’ve republished it here with his permission. To make learning more fun and interesting, here’s a list of important computer science ...

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

Abstract: The speed of algorithms on massive graphs depends on the size of the given data. Grammar-based compression is a technique to compress the size of a graph while still allowing to read or to ...