NSF award 2540331 · Brown University

CAREER: A New Theory of Length-Constrained Graph Algorithms

Final report due

28 September 2031

in 1,806 days · The award ends on 31 May 2031.

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 extension31 Jan 2031in 1566 days
award ending 2031-05-31 · Research.gov
This one is ours, not NSF’s.
Extension request16 Apr 2031in 1641 days
award ending 2031-05-31 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice21 May 2031in 1676 days
award ending 2031-05-31 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Sep 2031in 1806 days
award ending 2031-05-31 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Sep 2031in 1806 days
award ending 2031-05-31 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Sep 2031in 1806 days
award ending 2031-05-31 · 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 31 May 2031.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 September 2031.

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: 2540331
Period of support: 1 Jun 2026 – 31 May 2031
Amount: $591,687
Awardee: Brown University, Providence, RI
Program: Algorithmic Foundations
Directorate: CSE

Abstract

The field of graph algorithms aims to understand how to efficiently construct and use networks, as well as what properties make for a good network. This project aims to advance graph algorithms by way of a new theory of “length-constrained” graph algorithms. Length constraints are a way of encouraging communication to happen quickly in networks. However, most classic graph algorithms do not work in the presence of…

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.