Kent Quanrud

Kent Quanrud

Purdue University

H-index: 14

North America-United States

About Kent Quanrud

Kent Quanrud, With an exceptional h-index of 14 and a recent h-index of 14 (since 2020), a distinguished researcher at Purdue University, specializes in the field of Theoretical Computer Science.

His recent articles reflect a diverse array of research interests and contributions to the field:

Adaptive Out-Orientations with Applications

Faster exact and approximation algorithms for packing and covering matroids via push-relabel

Quotient sparsification for submodular functions

Independent Sets in Elimination Graphs with a Submodular Objective

Convergence to Lexicographically Optimal Base in a (Contra) Polymatroid and Applications to Densest Subgraph and Tree Packing

Faster and scalable algorithms for densest subgraph and decomposition

-approximate fully dynamic densest subgraph: linear space and faster update time

Algorithms for covering multiple submodular constraints and applications

Kent Quanrud Information

University

Position

___

Citations(all)

792

Citations(since 2020)

666

Cited By

399

hIndex(all)

14

hIndex(since 2020)

14

i10Index(all)

18

i10Index(since 2020)

17

Email

University Profile Page

Google Scholar

Kent Quanrud Skills & Research Interests

Theoretical Computer Science

Top articles of Kent Quanrud

Faster exact and approximation algorithms for packing and covering matroids via push-relabel

2024

Kent Quanrud
Kent Quanrud

H-Index: 11

Quotient sparsification for submodular functions

2024

Kent Quanrud
Kent Quanrud

H-Index: 11

Independent Sets in Elimination Graphs with a Submodular Objective

arXiv preprint arXiv:2307.02022

2023/7/5

Chandra Chekuri
Chandra Chekuri

H-Index: 30

Kent Quanrud
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
Kent Quanrud

H-Index: 11

Chandra Chekuri
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
Kent Quanrud

H-Index: 11

Chandra Chekuri
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
Chandra Chekuri

H-Index: 30

Kent Quanrud
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
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
Chandra Chekuri

H-Index: 30

Kent Quanrud
Kent Quanrud

H-Index: 11

Random Sums and Graphs

2021/4/29

Kent Quanrud
Kent Quanrud

H-Index: 11

Convex minimization

2021/4/28

Kent Quanrud
Kent Quanrud

H-Index: 11

Random Graphs

2021/4/28

Kent Quanrud
Kent Quanrud

H-Index: 11

Faster algorithms for rooted connectivity in directed graphs

arXiv preprint arXiv:2104.07205

2021/4/15

Chandra Chekuri
Chandra Chekuri

H-Index: 30

Kent Quanrud
Kent Quanrud

H-Index: 11

Randomized Searching and Sorting

2021/4/15

Kent Quanrud
Kent Quanrud

H-Index: 11

Fast approximations for rooted connectivity in weighted directed graphs

arXiv preprint arXiv:2104.06933

2021/4/14

Kent Quanrud
Kent Quanrud

H-Index: 11

Dynamic Connectivity and MST’s

2021/3/25

Kent Quanrud
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
Chandra Chekuri

H-Index: 30

Kent Quanrud
Kent Quanrud

H-Index: 11

Range Queries and Dynamic Trees

Lecture ntoes for graduate algorithms course (CS580). Spring

2021/3/23

Kent Quanrud
Kent Quanrud

H-Index: 11

See List of Professors in Kent Quanrud University(Purdue University)

Co-Authors

academic-engine