Author:
Bansal Nikhil,Svensson Ola,Trevisan Luca
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k;Mathematics of Operations Research;2023-12-13
2. Additive Sparsification of CSPs;ACM Transactions on Algorithms;2023-11-13
3. Sparsifying Sums of Norms;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Spectral Hypergraph Sparsification via Chaining;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02