RECOMB 2018: 105-121 Network flows, and in particular min-cost flows, are a computational model generalizing several classical problems on graphs. We were among ... I. Tomescu: Complexity and ...

University of Virginia School of Engineering and Applied Science professor Nikolaos Sidiropoulos has introduced a breakthrough in graph mining ... of a new computational algorithm.

Algorithms are lists of instructions ... applying the techniques of a branch of mathematics called graph theory to the study of computational complexity. One of his most famous contributions ...

The most widely used algorithm is slow and not all that ... is also true. Most computational complexity researchers assume that this is the case—including Piotr Indyk and Artūrs Bačkurs ...

He made several key contributions to the rigorous analysis of the computational complexity of algorithms. He popularized asymptotic notation, that we all affectionately know as the big-O notation. He ...