@article{article, title  = {{Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter}},

 publisher = {{Association for Computing Machinery (ACM)}},

 url = {{https://doi.org/10.1145/3632623 }},

 year = {{2024}},

 month = {{1}},

 author = {{Chalermsook P and Kaul M and Mnich M and Spoerhase J and Uniyal S and Vaz D}},

 doi = {{10.1145/3632623}},

 volume = {{20}},

 journal = {{ACM Transactions on Algorithms}},

 issue = {{1}},

 pages = {{1-20}},

 note = {{Accessed on 2025/03/03}}}