Project Grant 2337901
- This National Science Foundation project grant of $362,015 supports research into developing more fine-grained algorithms under the Computer and Information Science and Engineering program. The University of California, San Diego will conduct this research from November 2021 to January 2023. Specifically, the awardee will build a unified theory of designing fast approximation algorithms and study their fine-grained computational hardness. They will develop systematic techniques emphasizing...
- The National Science Foundation's Division of Computing and Communication Foundations awarded a five-year CAREER Project Grant totaling $530,283 to the University of Michigan, effective May 1, 2026 through April 30, 2031, under the Computer and Information Science and Engineering program (CFDA 47.070). This award supports fundamental research advancing the theoretical foundations and structural understanding of path-finding algorithms in graphs—a critical computational primitive applicable to...
- 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 three-year National Science Foundation project grant of $600,000 supports algorithmic research in online and matching-based market design at the University of California, Irvine from October 2022 to September 2025. The Computer and Information Science and Engineering program aims to advance computing and informatics research. Key work under this award includes developing algorithms for online hypergraph matching and its generalizations, extending ranking algorithms to the AdWords problem to...
- This $1.2 million Project Grant from the National Science Foundation's Computer and Information Science and Engineering program will fund research into the fine-grained complexity of basic geometric problems from June 2022 through May 2025. The principal investigator at the University of Illinois will apply conditional proof techniques to establish new reductions between geometric optimization, searching, data structures, point cloud matching, and other problems. The goal is to prove conditional...
- Federal Grant Award Summary The National Science Foundation's Division of Computing and Communication Foundations awarded Boston University a CAREER grant of $412,038 under the Computer and Information Science and Engineering (CISE) program (CFDA 47.070) for the period October 1, 2025 through September 30, 2030. This project grant supports the development of improved approximation algorithms for computationally intractable graph problems, including the traveling salesperson problem and...
- Federal Project Grant Award Summary Carnegie Mellon University's Office of Sponsored Programs received a $331,723 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). The award, effective June 1, 2026 through May 31, 2031, supports a CAREER grant titled "New Approaches to Analytical and Combinatorial Problems in Computer Science." The research...
- 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...
- Federal Project Grant Award Summary Brown University received a $591,687 CAREER (Faculty Early Career Development Program) Project Grant from the National Science Foundation's Division of Computing and Communication Foundations (CFDA 47.070: Computer and Information Science and Engineering) effective June 1, 2026, through May 31, 2031. The award funds development of a new theoretical framework for length-constrained graph algorithms—algorithms that optimize network communication by imposing...
- This Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program supports research on the streaming approximability of constraint satisfaction problems, with a focus on the Maximum Directed Cut (Max-DiCut) problem. The $174,991 award to the Toyota Technological Institute at Chicago (TTIC), a private non-profit university, will fund efforts to design more efficient streaming algorithms for Max-DiCut and other constraint...
CAREER: DISTANCES AND MATCHINGS UNDER THE LENS OF FINE-GRAINED COMPLEXITY -TRADITIONALLY, THE THEORY OF COMPUTATIONAL COMPLEXITY CLASSIFIED PROBLEMS AS TRACTABLE OR INTRACTABLE DEPENDING ON WHETHER OR NOT A POLYNOMIAL TIME ALGORITHM TO SOLVE A PROBLEM EXACTLY EXISTS (?P VS NP?). HOWEVER, IN RECENT YEARS THE UNDERSTANDING THAT THESE CATEGORIES ARE TOO COARSE TO CHARACTERIZE TRACTABILITY IN THE ERA OF MODERN BIG DATA APPLICATIONS HAS MOTIVATED THE THEORY OF FINE-GRAINED COMPLEXITY, AND MORE RECENTLY, ANSWERING THE QUESTION OF WHETHER A NEAR-LINEAR TIME ALGORITHM EXISTS THAT SOLVES A CLOSE-ENOUGH APPROXIMATE PROBLEM. THE OBJECTIVE OF THIS CAREER PROJECT IS TO DEVELOP A THEORY OF FINE-GRAINED COMPLEXITY FOR APPROXIMATION ALGORITHMS FOR A FEW FUNDAMENTAL PROBLEMS. THESE PROBLEMS ARE NOT ONLY OF THEORETICAL IMPORTANCE IN THE STUDY OF ALGORITHM DESIGN BUT ARE ALSO IMPORTANT IN PRACTICAL APPLICATIONS IN DIVERSE AREAS SUCH AS BIOINFORMATICS, IMAGE COMPARISON, AND ONLINE MATCHING. THE EDUCATIONAL PLAN INCLUDES DEVELOPMENT OF NEW TEACHING MATERIALS, MENTORING OF UNDERGRADUATE AND GRADUATE STUDENTS, AND ORGANIZING WORKSHOPS. THE PROJECT FOCUSES ON A CLASS OF PROBLEMS IN ALGORITHM DESIGN KNOWN AS METRIC MATCHING PROBLEMS. THE RESEARCH TEAM WILL INVESTIGATE A PRIMARY EXEMPLAR OF THIS CLASS, APPROXIMATE EDIT DISTANCE (AND IT'S MAXIMIZATION COUNTERPART, LONGEST COMMON SUBSEQUENCE), AS A GENERAL APPROACH FOR STUDYING SUCH PROBLEMS AS EARTH MOVER'S DISTANCE, ROOT MEAN SQUARE DISTANCE, AND DYNAMIC TIME WARPING. THE GOAL IS TO DEVELOP A NEW FRAMEWORK THAT PROVIDES A CLEARER PICTURE OF THE POSSIBLE COMPLEXITY-APPROXIMATION QUALITY TRADEOFF FRONTIER FOR PROBLEMS IN P AND TO UNDERSTAND WHERE ALGORITHM PERFORMANCE IS EITHER ACHIEVABLE OR RULED OUT BY THE STRONG TIME EXPONENTIAL HYPOTHESIS (SETH). THE PROJECT IS EXPECTED TO ADVANCE THE UNDERSTANDING OF THESE LONG-STANDING OPEN PROBLEMS BY EXPLORING NEW CONNECTIONS BETWEEN MATCHING PROBLEMS IN ABSTRACT GRAPHS AND THE EMBEDDING OF THOSE GRAPHS IN CONCRETE METRICS. THIS AWARD REFLECTS NSF'S STATUTORY MISSION AND HAS BEEN DEEMED WORTHY OF SUPPORT THROUGH EVALUATION USING THE FOUNDATION'S INTELLECTUAL MERIT AND BROADER IMPACTS REVIEW CRITERIA.- SUBAWARDS ARE NOT PLANNED FOR THIS AWARD.
Mod # | Description | ReasonForModification | Federal Obligation | Date |
|---|---|---|---|---|
| Not listed | $273.7k | 8/22/25 | ||
| Not listed | $229.2k | 2/28/24 |