Cited By
View all- Chalermsook PKaul MMnich MSpoerhase JUniyal SVaz D(2024)Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial DiameterACM Transactions on Algorithms10.1145/363262320:1(1-20)Online publication date: 22-Jan-2024
- Guan RLiang DWang WYang W(2024)Direct Product Multicommodity Max-Concurrent-Flow Min-Sparse-Cut TheoremJournal of the Operations Research Society of China10.1007/s40305-024-00567-8Online publication date: 18-Oct-2024
- Cohen-Addad VMömke TVerdugo V(2024)A 2-approximation for the bounded treewidth sparsest cut problem in $$\textsf{FPT}$$ TimeMathematical Programming10.1007/s10107-023-02044-1206:1-2(479-495)Online publication date: 4-Jan-2024
- Show More Cited By