%0 Journal Article %1 journals/talg/ChalermsookKMSUV24 %A Chalermsook, Parinya %A Kaul, Matthias %A Mnich, Matthias %A Spoerhase, Joachim %A Uniyal, Sumedha %A Vaz, Daniel %D 2024 %J ACM Trans. Algorithms %K dblp %N 1 %P 6:1-6:20 %T Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. %U http://dblp.uni-trier.de/db/journals/talg/talg20.html#ChalermsookKMSUV24 %V 20

@article{journals/talg/ChalermsookKMSUV24, added-at = {2024-02-29T00:00:00.000+0100}, author = {Chalermsook, Parinya and Kaul, Matthias and Mnich, Matthias and Spoerhase, Joachim and Uniyal, Sumedha and Vaz, Daniel}, biburl = {https://www.bibsonomy.org/bibtex/2dd1768d0c232f18f749a6179d70446d5/dblp}, ee = {https://doi.org/10.1145/3632623}, interhash = {ab546ec65ac1ff464edac200e34d0644}, intrahash = {dd1768d0c232f18f749a6179d70446d5}, journal = {ACM Trans. Algorithms}, keywords = {dblp}, month = {January}, number = 1, pages = {6:1-6:20}, timestamp = {2024-04-08T15:04:45.000+0200}, title = {Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.}, url = {http://dblp.uni-trier.de/db/journals/talg/talg20.html#ChalermsookKMSUV24}, volume = 20, year = 2024 }