Kent Quanrud
Computer Science · Purdue University West Lafayette
Publications
61
Citations
505
Est. group size
—
Recurring co-author estimate
Active years
12
Publishing since 2015
Kent Quanrud works on the design and analysis of efficient algorithms for fundamental problems in graphs and combinatorial optimization, such as computing shortest paths, connectivity, and densest subgraphs, as well as matroid and submodular function optimization. Much of the work focuses on making these algorithms provably faster, including near-linear-time and approximation methods for large-scale graph and network problems. This research is theoretical in nature, aiming to establish rigorous performance guarantees for algorithms that could underlie practical systems for network analysis and optimization.
Publication output peaked around 2018-2019, dipped in 2020, and has settled into a steady but somewhat lower cadence of a few papers per year over the past five years.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Faster negative length shortest paths by bootstrapping hop reducers
Society for Industrial and Applied Mathematics eBooks · 2026
- Approximating Directed Connectivity in Almost-Linear Time
2026
- From Hop Reduction to Sparsification for Negative Length Shortest Paths
2026
- Faster single-source shortest paths with negative real weights via proper hop distance
Society for Industrial and Applied Mathematics eBooks · 2025
- Faster negative length shortest paths by bootstrapping hop reducers
arXiv (Cornell University) · 2025
- Quotient sparsification for submodular functions
Society for Industrial and Applied Mathematics eBooks · 2024
- Adaptive Out-Orientations with Applications
Society for Industrial and Applied Mathematics eBooks · 2024
- Faster exact and approximation algorithms for packing and covering matroids via push-relabel
Society for Industrial and Applied Mathematics eBooks · 2024
- Faster single-source shortest paths with negative real weights via proper hop distance
arXiv (Cornell University) · 2024
- Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing
arXiv (Cornell University) · 2023
- Faster exact and approximation algorithms for packing and covering matroids via push-relabel
arXiv (Cornell University) · 2023
- Independent Sets in Elimination Graphs with a Submodular Objective
arXiv (Cornell University) · 2023
- Adaptive Out-Orientations with Applications
arXiv (Cornell University) · 2023
- Algorithms for covering multiple submodular constraints and applications
Journal of Combinatorial Optimization · 2022
- Densest Subgraph: Supermodularity, Iterative Peeling, and Flow
Society for Industrial and Applied Mathematics eBooks · 2022
- arXiv (Cornell University)×20
- Society for Industrial and Applied Mathematics eBooks×13
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)×4
- Leibniz-Zentrum für Informatik (Schloss Dagstuhl)×2
- SIAM Journal on Computing×1
- Billy Jin
Computer Science · Purdue University West Lafayette
- Elena Grigorescu
Computer Science · Purdue University West Lafayette
- Pooya Hatami
Computer Science · The Ohio State University
- Qin Zhang
Computer Science · Indiana University
- Alex Pothen
Computer Science · Purdue University West Lafayette
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 20, 2026.
Claim or correct this profile