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 ...
New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science. But the way to do it ...
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 ...
Expanders graphs are sparse but well-connected. These seemingly contrasting properties have led to many applications in theoretical computer science, from complexity ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback