Kent Quanrud
Purdue University
H-index: 14
North America-United States
Top articles of Kent Quanrud
Adaptive Out-Orientations with Applications
2024
Faster exact and approximation algorithms for packing and covering matroids via push-relabel
2024
Kent Quanrud
H-Index: 11
Quotient sparsification for submodular functions
2024
Kent Quanrud
H-Index: 11
Independent Sets in Elimination Graphs with a Submodular Objective
arXiv preprint arXiv:2307.02022
2023/7/5
Chandra Chekuri
H-Index: 30
Kent Quanrud
H-Index: 11
Convergence to Lexicographically Optimal Base in a (Contra) Polymatroid and Applications to Densest Subgraph and Tree Packing
arXiv preprint arXiv:2305.02987
2023/5/4
Kent Quanrud
H-Index: 11
Chandra Chekuri
H-Index: 30
Faster and scalable algorithms for densest subgraph and decomposition
Advances in Neural Information Processing Systems
2022/12/6
Kent Quanrud
H-Index: 11
Chandra Chekuri
H-Index: 30
-approximate fully dynamic densest subgraph: linear space and faster update time
arXiv preprint arXiv:2210.02611
2022/10/6
Chandra Chekuri
H-Index: 30
Kent Quanrud
H-Index: 11
Algorithms for covering multiple submodular constraints and applications
Journal of combinatorial optimization
2022/9
Fast and Deterministic Approximations for -Cut
Theory of Computing
2022/4/19
Kent Quanrud
H-Index: 11
Minimum cuts in directed graphs via partial sparsification
2022/2/7
Densest subgraph: Supermodularity, iterative peeling, and flow
2022
Chandra Chekuri
H-Index: 30
Kent Quanrud
H-Index: 11
Random Sums and Graphs
2021/4/29
Kent Quanrud
H-Index: 11
Convex minimization
2021/4/28
Kent Quanrud
H-Index: 11
Random Graphs
2021/4/28
Kent Quanrud
H-Index: 11
Faster algorithms for rooted connectivity in directed graphs
arXiv preprint arXiv:2104.07205
2021/4/15
Chandra Chekuri
H-Index: 30
Kent Quanrud
H-Index: 11
Randomized Searching and Sorting
2021/4/15
Kent Quanrud
H-Index: 11
Fast approximations for rooted connectivity in weighted directed graphs
arXiv preprint arXiv:2104.06933
2021/4/14
Kent Quanrud
H-Index: 11
Dynamic Connectivity and MST’s
2021/3/25
Kent Quanrud
H-Index: 11
Isolating cuts,(bi-) submodularity, and faster algorithms for global connectivity problems
arXiv preprint arXiv:2103.12908
2021/3/24
Chandra Chekuri
H-Index: 30
Kent Quanrud
H-Index: 11
Range Queries and Dynamic Trees
Lecture ntoes for graduate algorithms course (CS580). Spring
2021/3/23
Kent Quanrud
H-Index: 11