Project Grant 2402284
Award Date
7/1/24
Completion Date
6/30/28
Dollars Obligated
$442K
Federal Agency
Division of Computing and Communication Foundations
Federal Grant Program
47.070
Assistance Type
Project Grant
Place of Performance
Philadelphia, PA 19104, USA
Similar Awards
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....
This Project Grant award under the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) will support the development of general algorithmic frameworks and frameworks for analyzing and manipulating various types of real-world networks, such as gene regulatory networks, brain networks, and online social networks. The $320,000 award to the Massachusetts Institute of Technology (MIT) will fund research to create provably-efficient...
This Project Grant award, funded by the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070), will develop general algorithmic frameworks and analysis tools for understanding and manipulating real-world networks across various domains. The $300,000 award to the University of Maryland, College Park, with a period of performance from April 2024 to March 2027, aims to create provably efficient algorithms that can provide quality...
This $600,000 Project Grant award from the National Science Foundation (CFDA 47.070 - Computer and Information Science and Engineering) to the Regents of the University of Michigan aims to advance research in extremal combinatorics and the analysis of algorithms. The primary goals are to solve fundamental classification problems in the theory of pattern-avoiding 0-1 matrices and apply these techniques to address open problems in computer science, particularly regarding the dynamic optimality...
This $271,041 National Science Foundation (NSF) Computer and Information Science and Engineering (CFDA 47.070) project grant was awarded to Trustees of Boston University on October 1, 2025 for a 5-year period through September 30, 2030. The grant aims to develop improved approximation algorithms for NP-hard graph problems, with a focus on the Traveling Salesperson Problem, its asymmetric variant, and the K-Edge-Connected Spanning Subgraph problem. The research will investigate techniques such as...
This Project Grant award from the National Science Foundation (NSF) under the Mathematical and Physical Sciences program (CFDA 47.049) will support a collaborative research project between mathematicians and computer scientists at Carnegie Mellon University (CMU). The $418,035 award, effective October 1, 2024 through September 30, 2027, will explore new ways to solve complex mathematical problems by integrating advanced machine learning techniques with automated reasoning. The project will focus...
The National Science Foundation (NSF) awarded a $270,000 Project Grant under the Mathematical and Physical Sciences Federal Grant Program (CFDA 47.049) to Carnegie Mellon University (CMU) to study various properties of random graphs/networks. The principal investigator will examine computational problems associated with these complex stochastic structures, such as optimizing routing algorithms. The research will involve graduate students and postdocs, and aims to address fundamental questions...
This $599,302 federal Project Grant awarded by the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) will support the development of ultra-fast algorithms and software infrastructure for searching high-dimensional spaces. The research aims to create scalable, next-generation search capabilities applicable to a variety of physical world problems, such as robotic manipulation planning, autonomous vehicle navigation, chemical...
This National Science Foundation project grant of $225,884 awarded on March 15, 2023 will fund the development of fast and scalable algorithms for mining and analyzing large dynamic graphs. Under the Integrative Activities program (CFDA 47.083), which enhances STEM competitiveness through capacity building and infrastructure development, this University of Nevada, Las Vegas project will generate new algorithmic techniques and scalable software tools. Specifically, the awardee will design...
This National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) Program project grant, awarded on February 1, 2024 for $258,033.00, supports research exploring the synergies between dynamic algorithms and linear optimization to develop more efficient algorithms for solving dynamic optimization problems. The 5-year project, conducted by the Georgia Tech Research Corporation, aims to: (i) determine the optimal time complexity for solving linear programs, (ii)...