| Publication | Date of Publication | Type |
|---|
| Experimental design for any \(p\)-norm | 2025-01-14 | Paper |
| Fast algorithms for directed graph partitioning using flows and reweighted eigenvalues | 2024-11-28 | Paper |
Network Design for s - t Effective Resistance
ACM Transactions on Algorithms | 2023-10-31 | Paper |
| Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues | 2023-06-15 | Paper |
| Cheeger Inequalities for Directed Graphs and Hypergraphs Using Reweighted Eigenvalues | 2022-11-17 | Paper |
A Spectral Approach to Network Design
SIAM Journal on Computing | 2022-07-22 | Paper |
A Local Search Framework for Experimental Design
SIAM Journal on Computing | 2022-07-22 | Paper |
| Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues | 2022-03-11 | Paper |
Approximating unique games using low diameter graph decomposition
(available as arXiv preprint) | 2021-07-28 | Paper |
Spectral analysis of matrix scaling and operator scaling
SIAM Journal on Computing | 2021-06-29 | Paper |
Graph Clustering using Effective Resistance
(available as arXiv preprint) | 2021-06-15 | Paper |
A spectral approach to network design
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Improved analysis of higher order random walks and applications
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Improved Analysis of Higher Order Random Walks and Applications
(available as arXiv preprint) | 2020-01-08 | Paper |
The Paulsen problem, continuous operator scaling, and smoothed analysis
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Spectral analysis of matrix scaling and operator scaling
(available as arXiv preprint) | 2019-04-05 | Paper |
Random Walks and Evolving Sets: Faster Convergences and Limitations
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved Cheeger's inequality and analysis of local graph partitioning using vertex expansion and expansion profile
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Algebraic algorithms for linear matroid parity problems | 2017-09-29 | Paper |
A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Improved Cheeger's inequality and analysis of local graph partitioning using vertex expansion and expansion profile
SIAM Journal on Computing | 2017-05-30 | Paper |
| Lower bounds on expansions of graph powers | 2017-03-22 | Paper |
Algebraic algorithms for linear matroid parity problems
ACM Transactions on Algorithms | 2016-04-11 | Paper |
A unified algorithm for degree bounded survivable network design
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Bipartite roots of graphs
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Approximating minimum bounded degree spanning trees to within one of optimal
Journal of the ACM | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6469239 (Why is no real title available?) | 2015-08-03 | Paper |
Improved Cheeger's inequality, analysis of spectral partitioning algorithms through higher order spectral gap
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Graph Connectivities, Network Coding, and Expander Graphs
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
A unified algorithm for degree bounded survivable network design
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
| scientific article; zbMATH DE number 6297805 (Why is no real title available?) | 2014-05-22 | Paper |
Fast matrix rank algorithms and applications
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Degree bounded matroids and submodular flows
Combinatorica | 2014-05-05 | Paper |
Additive Approximation for Bounded Degree Survivable Network Design
SIAM Journal on Computing | 2014-04-11 | Paper |
Fast matrix rank algorithms and applications
Journal of the ACM | 2014-02-17 | Paper |
Fast matrix rank algorithms and applications
Journal of the ACM | 2014-02-17 | Paper |
Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
SIAM Journal on Computing | 2013-09-25 | Paper |
Graph connectivities, network coding, and expander graphs
SIAM Journal on Computing | 2013-09-25 | Paper |
Finding small sparse cuts by random walk
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
On linear and semidefinite programming relaxations for hypergraph matching
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Complexity of finding graph roots with girth conditions
Algorithmica | 2012-04-26 | Paper |
| scientific article; zbMATH DE number 6027233 (Why is no real title available?) | 2012-04-24 | Paper |
On Disjoint Common Bases in Two Matroids
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Degree bounded network design with metric costs
SIAM Journal on Computing | 2011-11-07 | Paper |
| Iterative methods in combinatorial optimization. | 2011-08-02 | Paper |
Degree bounded forest covering
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
| Iterative rounding and relaxation | 2011-05-16 | Paper |
Survivable network design with degree or order constraints
SIAM Journal on Computing | 2010-07-07 | Paper |
Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485590 (Why is no real title available?) | 2009-01-05 | Paper |
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5454665 (Why is no real title available?) | 2008-12-21 | Paper |
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Journal of Combinatorial Theory. Series B | 2008-12-08 | Paper |
Degree Bounded Matroids and Submodular Flows
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
A note on degree-constrained subgraphs
Discrete Mathematics | 2008-05-13 | Paper |
Packing Steiner Forests
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Recognizing Powers of Proper Interval, Split, and Chordal Graphs
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
