Daniel Lokshtanov’s work explores the limits of what computers can solve, paving the way for advances in artificial intelligence and computational efficiency.

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

Graph matching remains a core challenge in computer vision, where establishing correspondences between features is crucial for tasks such as object recognition, 3D reconstruction and scene ...

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

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

Computer scientists are constantly searching for ways to squeeze ever more bandwidth from communications networks. Now a new approach to understanding a basic concept in graph theory, known as "vertex ...

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

Programming in assembly language and C for students with prior experience in Java. Topics include binary number encodings, instruction set architecture, assembly language programming, and instruction ...