Project Grant 2505100
- This Project Grant award of $319,976 from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) Federal Grant Program, with an award date of October 1, 2025, and an ultimate completion date of September 30, 2029, supports collaborative research by the University of California, Santa Barbara (UCSB) on developing a theory of quasi-polynomial time algorithms for graph problems. The research aims to establish new mathematical theorems and efficient...
- The National Science Foundation (NSF) awarded a 5-year, $390,160 Project Grant under the Computer and Information Science and Engineering (CFDA 47.070) program to Northeastern University. The funding supports research on advancing sublinear-time graph algorithms, which are designed to process massive graph data by examining only a small portion of the input. The key objectives are to develop more efficient and optimal sublinear-time algorithms for foundational graph problems, explore the...
- This $443,217 Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) supports research on fast combinatorial algorithms for graph problems such as maximum matching, maximum flow, and shortest paths. The award aims to develop new algorithms for dynamic graphs, where the graph structure changes over time, as well as improve expander-related tools that can serve as building blocks for many graph algorithms....
- The National Science Foundation (NSF) awarded a Project Grant of $599,985 to New York University (NYU) under the Computer and Information Science and Engineering (CISE) Federal Grant Program (CFDA 47.070). The grant, with a performance period from July 15, 2025 to June 30, 2028, supports NYU's research on the approximability of Constraint Satisfaction Problems (CSPs) on satisfiable instances. The project aims to design approximation algorithms for these NP-hard problems and investigate the...
- This National Science Foundation (NSF) Project Grant award to Duke University, under the NSF's Computer and Information Science and Engineering program (CFDA 47.070), provides $299,990 over 3 years to develop new algorithms for graph connectivity problems. The project aims to design faster, simpler, and more deterministic algorithms that can better understand the properties of graph connections, with potential real-world impact in areas like image segmentation and network reliability. The...
- This National Science Foundation (NSF) Project Grant award under the Mathematical and Physical Sciences federal grant program (CFDA 47.049) will explore new ways to address complex mathematical problems by integrating advanced machine learning techniques with automated reasoning. The $418,035 grant awarded to Carnegie Mellon University will support a collaborative research effort between mathematicians and computer scientists to develop and evaluate new algorithms for solving three specific open...
- The National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) Federal Grant Program awarded a $591,545 Project Grant to the Research Foundation of the City University of New York (RFCUNY) - Queens College. The grant, awarded on May 1, 2025, will fund research to develop algorithms that can generate diverse sets of optimal solutions for classical optimization problems, rather than returning a single best solution. The project aims to explore the geometry and...
- The National Science Foundation (NSF) awarded a $200,000 Project Grant under the Computer and Information Science and Engineering (CFDA 47.070) program to The Trustees of Princeton University. The grant funds the "Collaborative Research: AIMING: Towards the Hadamard Conjecture: A Unified Neurosymbolic Reasoning and Formal Verification Paradigm" project. This project aims to develop a new AI system that works alongside mathematicians to tackle complex mathematical problems, with a focus...
- The National Science Foundation (NSF) awarded a $246,000 Project Grant under the Mathematical and Physical Sciences (CFDA 47.049) program to The Trustees of Princeton University. The award, active from July 1, 2025 to June 30, 2027, supports research on two central topics in number theory: the study of Galois groups and the study of L-functions. The principal investigator will develop new probabilistic models and multiple Dirichlet series to make progress on fundamental number-theoretic...
- The National Science Foundation (NSF) awarded a $270,000 Project Grant to Carnegie Mellon University under the Mathematical and Physical Sciences (CFDA 47.049) federal grant program. The 3-year grant, effective August 1, 2024, will support research to study the properties of random graphs and networks, including computational problems and algorithms associated with such complex structures. The principal investigator will examine topics such as matchings, Hamilton cycles, and spanning trees in...
The National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) Federal Grant Program awarded a $295,099 Project Grant to The Trustees of Princeton University on Oct 1, 2025. The grant supports collaborative research to develop a theory of quasi-polynomial time algorithms for graph problems, which will lead to new fundamental descriptive mathematical theorems, especially within the field of graph theory. Despite significant effort, many computational problems in algorithmic graph theory still resist classification into polynomial time solvable or NP-hard, and the investigators aim to establish quasi-polynomial time algorithms as an effective approach for these types of problems. The research will advance the understanding of the relationship between structural and descriptive mathematical statements and efficient algorithms, which is a critical connection throughout mathematics and computer science.
Mod # | Description | ReasonForModification | Federal Obligation | Date |
|---|---|---|---|---|
| Not listed | $295.1k | 7/19/25 |