Streaming Algorithms for Submodular Function Maximization. - Chandra Chekuri; Shalmoli Gupta; Kent Quanrud (ICALP (1), 2015)

Online Learning with Adversarial Delays. - Kent Quanrud; Daniel Khashabi (NIPS, 2015)

Approximation Algorithms for Low-Density Graphs. - Sariel Har-Peled; Kent Quanrud (CoRR, 2015)

A Fast Approximation for Maximum Weight Matroid Intersection. - Chandra Chekuri; Kent Quanrud (SODA, 2016)

Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. - Sariel Har-Peled; Kent Quanrud (CoRR, 2016)

Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. - Chandra Chekuri; Kent Quanrud (FOCS, 2017)

Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. - Chandra Chekuri; Kent Quanrud (SODA, 2017)

Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. - Sariel Har-Peled; Kent Quanrud (SIAM J. Comput., 2017)

Randomized MWU for Positive LPs. - Chandra Chekuri; Kent Quanrud (SODA, 2018)

Fast Approximations for Metric-TSP via Linear Programming. - Chandra Chekuri; Kent Quanrud (CoRR, 2018)

ell _1 -sparsity Approximation Bounds for Packing Integer Programs. - Chandra Chekuri; Kent Quanrud; Manuel R. Torres (IPCO, 2019)

LP Relaxation and Tree Packing for Minimum k-cuts. - Chandra Chekuri; Kent Quanrud; Chao Xu 002 (SOSA, 2019)

Submodular Function Maximization in Parallel via the Multilinear Relaxation. - Chandra Chekuri; Kent Quanrud (SODA, 2019)

On Approximating (Sparse) Covering Integer Programs. - Chandra Chekuri; Kent Quanrud (SODA, 2019)

Approximating Optimal Transport With Linear Programs. - Kent Quanrud (SOSA, 2019)

Parallelizing greedy for submodular set function maximization in matroids and beyond. - Chandra Chekuri; Kent Quanrud (STOC, 2019)

$ ell_1$-sparsity Approximation Bounds for Packing Integer Programs. - Chandra Chekuri; Kent Quanrud; Manuel R. Torres (CoRR, 2019)

On Approximating Partial Set Cover and Generalizations. - Chandra Chekuri; Kent Quanrud; Zhao Zhang 002 (CoRR, 2019)

Fast approximations for combinatorial optimization via multiplicative weight updates - Kent Quanrud (2019)

Fast LP-based Approximations for Geometric Packing and Covering Problems. - Chandra Chekuri; Sariel Har-Peled; Kent Quanrud (SODA, 2020)

Computing Circle Packing Representations of Planar Graphs. - Sally Dong; Yin Tat Lee; Kent Quanrud (SODA, 2020)

Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. - Kent Quanrud (SOSA, 2020)

ℓ 1-Sparsity approximation bounds for packing integer programs. - Chandra Chekuri; Kent Quanrud; Manuel R. Torres (Math. Program., 2020)

LP Relaxation and Tree Packing for Minimum k-Cut. - Chandra Chekuri; Kent Quanrud; Chao Xu 002 (SIAM J. Discret. Math., 2020)

Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. - Chandra Chekuri; Kent Quanrud; Manuel R. Torres (APPROX-RANDOM, 2021)

Online Directed Spanners and Steiner Forests. - Elena Grigorescu; Young-San Lin; Kent Quanrud (APPROX-RANDOM, 2021)

Minimum Cuts in Directed Graphs via Partial Sparsification. - Ruoxu Cen; Jason Li 006; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Kent Quanrud (FOCS, 2021)

Faster Algorithms for Rooted Connectivity in Directed Graphs. - Chandra Chekuri; Kent Quanrud (ICALP, 2021)

Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. - Chandra Chekuri; Kent Quanrud (ICALP, 2021)

Spectral Sparsification of Metrics and Kernels. - Kent Quanrud (SODA, 2021)

Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems. - Chandra Chekuri; Kent Quanrud (CoRR, 2021)

Fast Approximations for Rooted Connectivity in Weighted Directed Graphs. - Kent Quanrud (CoRR, 2021)

Faster and Scalable Algorithms for Densest Subgraph and Decomposition. - Elfarouk Harb; Kent Quanrud; Chandra Chekuri (NeurIPS, 2022)

Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. - Chandra Chekuri; Kent Quanrud; Manuel R. Torres (SODA, 2022)

(1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time. - Chandra Chekuri; Kent Quanrud (CoRR, 2022)

Algorithms for covering multiple submodular constraints and applications. - Chandra Chekuri; Tanmay Inamdar 002; Kent Quanrud; Kasturi R. Varadarajan; Zhao Zhang 002 (J. Comb. Optim., 2022)

Fast and Deterministic Approximations for k-Cut. - Kent Quanrud (Adv. Math. Commun., 2022)

Independent Sets in Elimination Graphs with a Submodular Objective. - Chandra Chekuri; Kent Quanrud (APPROX/RANDOM, 2023)

Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. - Elfarouk Harb; Kent Quanrud; Chandra Chekuri (ESA, 2023)

Approximate Fully Dynamic Directed Densest Subgraph. - Richard Li; Kent Quanrud (CoRR, 2023)

Adaptive Sparsification for Matroid Intersection. - Kent Quanrud (ICALP, 2024)

Adaptive Out-Orientations with Applications. - Chandra Chekuri; Aleksander Bjørn Grodt Christiansen; Jacob Holm; Ivor van der Hoog; Kent Quanrud; Eva Rotenberg; Chris Schwiegelshohn (SODA, 2024)

Faster exact and approximation algorithms for packing and covering matroids via push-relabel. - Kent Quanrud (SODA, 2024)

Quotient sparsification for submodular functions. - Kent Quanrud (SODA, 2024)

Faster single-source shortest paths with negative real weights via proper hop distance. - Yufan Huang; Peter Jin; Kent Quanrud (SODA, 2025)

Faster negative length shortest paths by bootstrapping hop reducers. - Yufan Huang; Peter Jin; Kent Quanrud (CoRR, 2025)