| 2026 | SODA | Faster negative length shortest paths by bootstrapping hop reducers. | Yufan Huang, Peter Jin, Kent Quanrud |
| 2026 | STOC | Approximating Directed Connectivity in Almost-Linear Time. | Kent Quanrud |
| 2026 | STOC | From Hop Reduction to Sparsification for Negative Length Shortest Paths. | Kent Quanrud, Navid Tajkhorshid |
| 2025 | SODA | Faster single-source shortest paths with negative real weights via proper hop distance. | Yufan Huang, Peter Jin, Kent Quanrud |
| 2024 | ICALP | Adaptive Sparsification for Matroid Intersection. | Kent Quanrud |
| 2024 | SODA | Adaptive Out-Orientations with Applications. | Chandra Chekuri, Aleksander Bjrn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn |
| 2024 | SODA | Faster exact and approximation algorithms for packing and covering matroids via push-relabel. | Kent Quanrud |
| 2024 | SODA | Quotient sparsification for submodular functions. | Kent Quanrud |
| 2023 | ESA | Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. | Elfarouk Harb, Kent Quanrud, Chandra Chekuri |
| 2022 | SODA | Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. | Chandra Chekuri, Kent Quanrud, Manuel R. Torres |
| 2021 | FOCS | Minimum Cuts in Directed Graphs via Partial Sparsification. | Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud |
| 2021 | ICALP | Faster Algorithms for Rooted Connectivity in Directed Graphs. | Chandra Chekuri, Kent Quanrud |
| 2021 | ICALP | Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. | Chandra Chekuri, Kent Quanrud |
| 2021 | SODA | Spectral Sparsification of Metrics and Kernels. | Kent Quanrud |
| 2020 | SODA | Fast LP-based Approximations for Geometric Packing and Covering Problems. | Chandra Chekuri, Sariel Har-Peled, Kent Quanrud |
| 2020 | SODA | Computing Circle Packing Representations of Planar Graphs. | Sally Dong, Yin Tat Lee, Kent Quanrud |
| 2020 | SODA | Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. | Kent Quanrud |
| 2019 | IPCO | \ell _1 -sparsity Approximation Bounds for Packing Integer Programs. | Chandra Chekuri, Kent Quanrud, Manuel R. Torres |
| 2019 | SODA | LP Relaxation and Tree Packing for Minimum k-cuts. | Chandra Chekuri, Kent Quanrud, Chao Xu |
| 2019 | SODA | Submodular Function Maximization in Parallel via the Multilinear Relaxation. | Chandra Chekuri, Kent Quanrud |
| 2019 | SODA | On Approximating (Sparse) Covering Integer Programs. | Chandra Chekuri, Kent Quanrud |
| 2019 | SODA | Approximating Optimal Transport With Linear Programs. | Kent Quanrud |
| 2019 | STOC | Parallelizing greedy for submodular set function maximization in matroids and beyond. | Chandra Chekuri, Kent Quanrud |
| 2018 | SODA | Randomized MWU for Positive LPs. | Chandra Chekuri, Kent Quanrud |
| 2017 | FOCS | Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. | Chandra Chekuri, Kent Quanrud |
| 2017 | SODA | Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. | Chandra Chekuri, Kent Quanrud |
| 2016 | SODA | A Fast Approximation for Maximum Weight Matroid Intersection. | Chandra Chekuri, Kent Quanrud |
| 2015 | ESA | Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. | Sariel Har-Peled, Kent Quanrud |
| 2015 | ICALP | Streaming Algorithms for Submodular Function Maximization. | Chandra Chekuri, Shalmoli Gupta, Kent Quanrud |