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 ...
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 ...
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 ...
The K-Computer in Japan continues to top the Graph 500 ranking of the world’s fastest supercomputers. The latest list was released today at SC16 in Salt Lake City. The Graph 500 measures performance ...
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.
Discover why algorithms and data structures form the foundation of contemporary computing. Discover how DS&A spurs innovation ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback