| 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 | 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 | 2022-07-22 | Paper |
| A Local Search Framework for Experimental Design | 2022-07-22 | Paper |
| Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues | 2022-03-11 | Paper |
| Approximating Unique Games Using Low Diameter Graph Decomposition | 2021-07-28 | Paper |
| Spectral Analysis of Matrix Scaling and Operator Scaling | 2021-06-29 | Paper |
| Graph Clustering using Effective Resistance | 2021-06-15 | Paper |
| A spectral approach to network design | 2021-01-19 | Paper |
| Improved analysis of higher order random walks and applications | 2021-01-19 | Paper |
| Improved Analysis of Higher Order Random Walks and Applications | 2020-01-08 | Paper |
| The Paulsen problem, continuous operator scaling, and smoothed analysis | 2019-08-22 | Paper |
| Spectral analysis of matrix scaling and operator scaling | 2019-04-05 | Paper |
| Random Walks and Evolving Sets: Faster Convergences and Limitations | 2018-07-16 | Paper |
| Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365124 | 2017-09-29 | Paper |
| A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks | 2017-08-08 | Paper |
| Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile | 2017-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969627 | 2017-03-22 | Paper |
| Algebraic algorithms for linear matroid parity problems | 2016-04-11 | Paper |
| A unified algorithm for degree bounded survivable network design | 2015-12-09 | Paper |
| Bipartite roots of graphs | 2015-09-02 | Paper |
| Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501358 | 2015-08-03 | Paper |
| Improved Cheeger's inequality | 2014-08-07 | Paper |
| Graph Connectivities, Network Coding, and Expander Graphs | 2014-07-30 | Paper |
| A Unified Algorithm for Degree Bounded Survivable Network Design | 2014-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417726 | 2014-05-22 | Paper |
| Fast matrix rank algorithms and applications | 2014-05-13 | Paper |
| Degree bounded matroids and submodular flows | 2014-05-05 | Paper |
| Additive Approximation for Bounded Degree Survivable Network Design | 2014-04-11 | Paper |
| Fast matrix rank algorithms and applications | 2014-02-17 | Paper |
| Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities | 2013-09-25 | Paper |
| Graph connectivities, network coding, and expander graphs | 2013-09-25 | Paper |
| Finding Small Sparse Cuts by Random Walk | 2012-11-02 | Paper |
| On linear and semidefinite programming relaxations for hypergraph matching | 2012-10-15 | Paper |
| Complexity of finding graph roots with girth conditions | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389994 | 2012-04-24 | Paper |
| On Disjoint Common Bases in Two Matroids | 2012-03-15 | Paper |
| Degree Bounded Network Design with Metric Costs | 2011-11-07 | Paper |
| Iterative Methods in Combinatorial Optimization | 2011-08-02 | Paper |
| Degree Bounded Forest Covering | 2011-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999657 | 2011-05-16 | Paper |
| Survivable Network Design with Degree or Order Constraints | 2010-07-07 | Paper |
| Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities | 2010-06-22 | Paper |
| Approximating minimum bounded degree spanning trees to within one of optimal | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302101 | 2009-01-05 | Paper |
| Survivable network design with degree or order constraints | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3547253 | 2008-12-21 | Paper |
| Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs | 2008-12-08 | Paper |
| Degree Bounded Matroids and Submodular Flows | 2008-06-10 | Paper |
| A note on degree-constrained subgraphs | 2008-05-13 | Paper |
| Packing Steiner Forests | 2007-08-30 | Paper |
| Recognizing Powers of Proper Interval, Split, and Chordal Graphs | 2005-02-28 | Paper |
