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.

Graph out-of-distribution (OOD) generalization remains a major challenge in graph neural networks (GNNs). Invariant learning, aiming to extract invariant features across varied distributions, has ...

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

Researchers thought that they were five years away from solving a math riddle from the 1980's. In reality, and without knowing, they had nearly cracked the problem and had just given away much of the ...

The original version of this story appeared in Quanta Magazine. All of modern mathematics is built on the foundation of set theory, the study of how to organize abstract collections of objects. But in ...

GeekWire chronicles the Pacific Northwest startup scene. Sign up for our weekly startup newsletter, and check out the GeekWire funding tracker and VC directory. by John Cook on May 14, 2013 at 4:30 am ...

The Kennedy College of Science, Richard A. Miner School of Computer & Information Sciences, invites you to attend a doctoral dissertation proposal defense by Nidhi Vakil, titled: "Foundations for ...