| Publication | Date of Publication | Type |
|---|
| Algorithmic aspects of semistability of quiver representations | 2026-09-29 | Paper |
| O( n)-approximation algorithms for bipartiteness ratio | 2026-09-16 | Paper |
Online algorithms for spectral hypergraph sparsification
Mathematical Programming. Series A. Series B | 2026-05-08 | Paper |
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
Mathematical Programming. Series A. Series B | 2025-09-09 | Paper |
| Online algorithms for spectral hypergraph sparsification | 2025-02-07 | Paper |
Algebraic algorithms for fractional linear matroid parity via noncommutative rank
SIAM Journal on Computing | 2025-01-23 | Paper |
| Shrunk subspaces via operator Sinkhorn iteration | 2024-05-14 | Paper |
Accelerating operator Sinkhorn iteration with overrelaxation
(available as arXiv preprint) | 2024-01-01 | Paper |
| Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices | 2023-10-24 | Paper |
Online risk-averse submodular maximization
Annals of Operations Research | 2023-01-23 | Paper |
| Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank | 2022-07-16 | Paper |
Information geometry of operator scaling
Linear Algebra and its Applications | 2022-07-05 | Paper |
Polynomial-time algorithms for submodular Laplacian systems
Theoretical Computer Science | 2021-10-21 | Paper |
A new approximation guarantee for monotone submodular function maximization via discrete convexity
(available as arXiv preprint) | 2021-07-28 | Paper |
Information geometry of operator scaling
(available as arXiv preprint) | 2020-04-29 | Paper |
Spectral sparsification of hypergraphs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Maximizing monotone submodular functions over the integer lattice
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Non-convex compressed sensing with the sum-of-squares method
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On Orthogonal Tensors and Best Rank-One Approximation Ratio
SIAM Journal on Matrix Analysis and Applications | 2018-04-06 | Paper |
Multicasting in Linear Deterministic Relay Network by Matrix Completion
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Finding a low-rank basis in a matrix subspace
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
Maximizing monotone submodular functions over the integer lattice
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Fast deterministic algorithms for matrix completion problems
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Fast deterministic algorithms for matrix completion problems
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
