Federal Project Grant Award Summary

New York University received a $370,237 Project Grant from the National Science Foundation (NSF) Division of Computing and Communication Foundations under the Computer and Information Science and Engineering program (CFDA 47.070), awarded January 1, 2026, with completion targeted for June 30, 2028. This collaborative research initiative focuses on designing and developing fast combinatorial algorithms for central graph problems, specifically maximum matching, maximum flow, and shortest paths computations. The research addresses two complementary computational models: static algorithms that operate on graphs known in advance with near-optimal running times, and dynamic algorithms that efficiently support queries on graphs that change over time, such as road networks experiencing variable traffic congestion or communication networks with shifting topologies.

The project is structured around four interconnected research thrusts, with primary emphasis on dynamic all-pairs shortest paths (APSP) algorithms and related graph optimization problems. Deliverables include theoretical algorithmic innovations and computational methods applicable to large-scale data processing scenarios where input graphs are extensive and efficiency is critical. This research contributes to the NSF's broader mission of advancing computing and communications infrastructure by providing foundational algorithmic tools essential for real-world applications including transportation networks, computer networks, social networks, and other complex systems modeled as graphs where fast computation directly impacts operational performance and scalability.