NSF award 2625203 · New York University

Collaborative Research: AF: Medium: Fast Combinatorial Algorithms for (Dynamic) Matchings and Shortest Paths

Final report due

28 October 2028

in 741 days · The award ends on 30 June 2028.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

Decide about an extension2 Mar 2028in 501 days
award ending 2028-06-30 · Research.gov
This one is ours, not NSF’s.
Extension request16 May 2028in 576 days
award ending 2028-06-30 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice20 Jun 2028in 611 days
award ending 2028-06-30 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Oct 2028in 741 days
award ending 2028-06-30 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Oct 2028in 741 days
award ending 2028-06-30 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Oct 2028in 741 days
award ending 2028-06-30 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

NSF lists this award's end date as 30 June 2028.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 October 2028.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number: 2625203
Period of support: 1 Jan 2026 – 30 Jun 2028
Amount: $599,380
Awardee: New York University, NEW York, NY
Program: Algorithmic Foundations
Directorate: CSE

Abstract

A graph is a collection of vertices (points or objects), and a collection of edges (links or lines), that connect pairs of vertices. Graphs are a central and an extensively studied type of mathematical object, and they are commonly used to model various problems in many different real world scenarios and applications. For example, it is natural to model a road network in a city, or a computer network, or friendship…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.