| Publication | Date of Publication | Type |
|---|
| Incremental approximate maximum flow on undirected graphs in subpolynomial update time | 2024-11-28 | Paper |
| A combinatorial cut-toggling algorithm for solving Laplacian linear systems | 2024-09-25 | Paper |
| Distance queries over dynamic interval graphs | 2024-07-23 | Paper |
| Nested dissection meets IPMs: planar min-cost flow in nearly-linear time | 2024-07-19 | Paper |
| Hardness of graph-structured algebraic and symbolic problems | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147280 | 2024-01-15 | Paper |
| Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions | 2023-12-19 | Paper |
| A combinatorial cut-toggling algorithm for solving Laplacian linear systems | 2023-12-13 | Paper |
| Sparsified block elimination for directed laplacians | 2023-12-08 | Paper |
| A generalized Cheeger inequality | 2023-03-24 | Paper |
| Density independent algorithms for sparsifying \(k\)-step random walks | 2021-07-28 | Paper |
| Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds | 2021-02-02 | Paper |
| Determinant-preserving sparsification of SDDM matrices | 2020-08-25 | Paper |
| A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices | 2020-08-06 | Paper |
| Fully dynamic spectral vertex sparsifiers and applications | 2020-01-30 | Paper |
| Iterative refinement for \(\ell_p\)-norm regression | 2019-10-15 | Paper |
| Parameterizing the hardness of binary search tree access sequences by inversion counts | 2019-09-18 | Paper |
| Solving 1-Laplacians in nearly linear time: collapsing and expanding a topological ball | 2019-06-20 | Paper |
| Approximate maximum flow on separable undirected graphs | 2019-05-15 | Paper |
| Faster spectral sparsification and numerical algorithms for SDD matrices | 2018-10-30 | Paper |
| Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time | 2018-07-16 | Paper |
| A framework for analyzing resparsification algorithms | 2018-07-16 | Paper |
| Sparsified Cholesky and multigrid solvers for connection Laplacians | 2017-09-29 | Paper |
| Approximate dynamic programming using halfspace queries and multiscale Monge decomposition | 2017-09-29 | Paper |
| Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs | 2017-08-17 | Paper |
| Partitioning well-clustered graphs: spectral clustering works! | 2017-05-30 | Paper |
| Uniform sampling for matrix approximation | 2017-05-19 | Paper |
| Runtime guarantees for regression problems | 2017-05-16 | Paper |
| \(\ell_p\) row sampling by Lewis weights | 2015-08-21 | Paper |
| Solving SDD linear systems in nearly \(m \log^{1/2} n\) time | 2015-06-26 | Paper |
| An efficient parallel solver for SDD linear systems | 2015-06-26 | Paper |
| Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs | 2015-01-19 | Paper |
| A Nearly-m log n Time Solver for SDD Linear Systems | 2014-07-30 | Paper |
| Approaching optimality for solving SDD linear systems | 2014-06-04 | Paper |
| Faster approximate multicommodity flow using quadratically coupled flows | 2014-05-13 | Paper |
| Approximation algorithms for speeding up dynamic programming and denoising acgh data | 2014-04-01 | Paper |
| Faster spectral sparsification and numerical algorithms for SDD matrices | 2012-09-26 | Paper |
| Efficient triangle counting in large graphs via degree-based vertex partitioning | 2012-08-29 | Paper |
| Improved spectral sparsification and numerical algorithms for SDD matrices | 2012-08-23 | Paper |
| Efficient triangle counting in large graphs via degree-based vertex partitioning | 2011-01-21 | Paper |
