Kent Quanrud - RankMe

69 papers A* 21A 3B 1Journal 35Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Faster negative length shortest paths by bootstrapping hop reducers. SODA Yufan Huang, Peter Jin, Kent Quanrud
2025	J	`jnl`	Approximating Directed Connectivity in Almost-Linear Time. CoRR Kent Quanrud
2025	J	`jnl`	Faster negative length shortest paths by bootstrapping hop reducers. CoRR Yufan Huang, Peter Jin, Kent Quanrud
2025	A*	`conf`	Faster single-source shortest paths with negative real weights via proper hop distance. SODA Yufan Huang, Peter Jin, Kent Quanrud
2025	J	`jnl`	From Hop Reduction to Sparsification for Negative Length Shortest Paths. CoRR Kent Quanrud, Navid Tajkhorshid
2024	A*	`conf`	Adaptive Out-Orientations with Applications. SODA Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn
2024	A*	`conf`	Adaptive Sparsification for Matroid Intersection. ICALP Kent Quanrud
2024	A*	`conf`	Faster exact and approximation algorithms for packing and covering matroids via push-relabel. SODA Kent Quanrud
2024	J	`jnl`	Faster single-source shortest paths with negative real weights via proper hop distance. CoRR Yufan Huang, Peter Jin, Kent Quanrud
2024	A*	`conf`	Quotient sparsification for submodular functions. SODA Kent Quanrud
2023	J	`jnl`	Adaptive Out-Orientations with Applications. CoRR Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn
2023	J	`jnl`	Approximate Fully Dynamic Directed Densest Subgraph. CoRR Richard Li, Kent Quanrud
2023	A	`conf`	Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. ESA Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2023	J	`jnl`	Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. CoRR Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2023	J	`jnl`	Faster exact and approximation algorithms for packing and covering matroids via push-relabel. CoRR Kent Quanrud
2023	A	`conf`	Independent Sets in Elimination Graphs with a Submodular Objective. APPROX/RANDOM Chandra Chekuri, Kent Quanrud
2023	J	`jnl`	Independent Sets in Elimination Graphs with a Submodular Objective. CoRR Chandra Chekuri, Kent Quanrud
2022	J	`jnl`	(1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time. CoRR Chandra Chekuri, Kent Quanrud
2022	J	`jnl`	Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim. Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, Zhao Zhang
2022	A*	`conf`	Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. SODA Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2022	J	`jnl`	Fast and Deterministic Approximations for k-Cut. Theory Comput. Kent Quanrud
2022	A*	`conf`	Faster and Scalable Algorithms for Densest Subgraph and Decomposition. NeurIPS Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2021	—	`conf`	Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. APPROX-RANDOM Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2021	J	`jnl`	Fast Approximations for Rooted Connectivity in Weighted Directed Graphs. CoRR Kent Quanrud
2021	A*	`conf`	Faster Algorithms for Rooted Connectivity in Directed Graphs. ICALP Chandra Chekuri, Kent Quanrud
2021	J	`jnl`	Faster Algorithms for Rooted Connectivity in Directed Graphs. CoRR Chandra Chekuri, Kent Quanrud
2021	A*	`conf`	Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. ICALP Chandra Chekuri, Kent Quanrud
2021	J	`jnl`	Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems. CoRR Chandra Chekuri, Kent Quanrud
2021	A*	`conf`	Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud
2021	J	`jnl`	Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak
2021	—	`conf`	Online Directed Spanners and Steiner Forests. APPROX-RANDOM Elena Grigorescu, Young-San Lin, Kent Quanrud
2021	J	`jnl`	Online Directed Spanners and Steiner Forests. CoRR Elena Grigorescu, Young-San Lin, Kent Quanrud
2021	A*	`conf`	Spectral Sparsification of Metrics and Kernels. SODA Kent Quanrud
2020	A*	`conf`	Computing Circle Packing Representations of Planar Graphs. SODA Sally Dong, Yin Tat Lee, Kent Quanrud
2020	J	`jnl`	Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. CoRR Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2020	A*	`conf`	Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA Chandra Chekuri, Sariel Har-Peled, Kent Quanrud
2020	J	`jnl`	LP Relaxation and Tree Packing for Minimum k-Cut. SIAM J. Discret. Math. Chandra Chekuri, Kent Quanrud, Chao Xu
2020	—	`conf`	Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. SOSA Kent Quanrud
2020	J	`jnl`	ℓ Math. Program. Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2019	J	`jnl`	$\ell_1$-sparsity Approximation Bounds for Packing Integer Programs. CoRR Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2019	—	`conf`	Approximating Optimal Transport With Linear Programs. SOSA Kent Quanrud
2019	J	`jnl`	Computing Circle Packing Representations of Planar Graphs. CoRR Sally Dong, Yin Tat Lee, Kent Quanrud
2019	—	`conf`	Fast and Deterministic Approximations for k-Cut. APPROX-RANDOM Kent Quanrud
2019	—	`—`	Fast approximations for combinatorial optimization via multiplicative weight updates Kent Quanrud
2019	—	`conf`	LP Relaxation and Tree Packing for Minimum k-cuts. SOSA Chandra Chekuri, Kent Quanrud, Chao Xu
2019	A*	`conf`	On Approximating (Sparse) Covering Integer Programs. SODA Chandra Chekuri, Kent Quanrud
2019	J	`jnl`	On Approximating Partial Set Cover and Generalizations. CoRR Chandra Chekuri, Kent Quanrud, Zhao Zhang
2019	A*	`conf`	Parallelizing greedy for submodular set function maximization in matroids and beyond. STOC Chandra Chekuri, Kent Quanrud
2019	A*	`conf`	Submodular Function Maximization in Parallel via the Multilinear Relaxation. SODA Chandra Chekuri, Kent Quanrud
2019	B	`conf`	\ell _1 -sparsity Approximation Bounds for Packing Integer Programs. IPCO Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2018	J	`jnl`	Approximating optimal transport with linear programs. CoRR Kent Quanrud
2018	J	`jnl`	Fast Approximations for Metric-TSP via Linear Programming. CoRR Chandra Chekuri, Kent Quanrud
2018	J	`jnl`	Fast and Deterministic Approximations for k-Cut. CoRR Kent Quanrud
2018	J	`jnl`	LP Relaxation and Tree Packing for Minimum k-cuts. CoRR Chandra Chekuri, Kent Quanrud, Chao Xu
2018	J	`jnl`	On Approximating (Sparse) Covering Integer Programs. CoRR Chandra Chekuri, Kent Quanrud
2018	J	`jnl`	Parallelizing greedy for submodular set function maximization in matroids and beyond. CoRR Chandra Chekuri, Kent Quanrud
2018	A*	`conf`	Randomized MWU for Positive LPs. SODA Chandra Chekuri, Kent Quanrud
2018	J	`jnl`	Submodular Function Maximization in Parallel via the Multilinear Relaxation. CoRR Chandra Chekuri, Kent Quanrud
2017	A*	`conf`	Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. FOCS Chandra Chekuri, Kent Quanrud
2017	J	`jnl`	Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. CoRR Chandra Chekuri, Kent Quanrud
2017	J	`jnl`	Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. SIAM J. Comput. Sariel Har-Peled, Kent Quanrud
2017	A*	`conf`	Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. SODA Chandra Chekuri, Kent Quanrud
2016	A*	`conf`	A Fast Approximation for Maximum Weight Matroid Intersection. SODA Chandra Chekuri, Kent Quanrud
2016	J	`jnl`	Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. CoRR Sariel Har-Peled, Kent Quanrud
2015	J	`jnl`	Approximation Algorithms for Low-Density Graphs. CoRR Sariel Har-Peled, Kent Quanrud
2015	A	`conf`	Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. ESA Sariel Har-Peled, Kent Quanrud
2015	—	`conf`	Online Learning with Adversarial Delays. NIPS Kent Quanrud, Daniel Khashabi
2015	—	`conf`	Streaming Algorithms for Submodular Function Maximization. ICALP (1) Chandra Chekuri, Shalmoli Gupta, Kent Quanrud
2015	J	`jnl`	Streaming Algorithms for Submodular Function Maximization. CoRR Chandra Chekuri, Shalmoli Gupta, Kent Quanrud