DOI,IST REx ID,Research Group,Title of publication
10.1145/3626183.3659969,17236,VlKo,"A simpler and parallelizable O(√log n)-approximation algorithm for sparsest cut"