A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

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

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.

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

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

Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields. When Avi Wigderson and László Lovász began their ...

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

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