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

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport ...

Michele Mosca of the Institute for Quantum Computing and Dept. of Combinatorics & Optimization, University of Waterloo and St. Jerome’s University, and Perimeter Institute for Theoretical Physics ...