Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter

  • Parinya Chalermsook
  • , Matthias Kaul
  • , Matthias Mnich
  • , Joachim Spoerhase
  • , Sumedha Uniyal
  • , Daniel Vaz

Research output: Contribution to journal › Article › Scientific › peer-review

Search results

  • Finished

    Combinatorics of Graph Packing and Online Binary Search Trees

    Chalermsook, P. (Principal investigator), Obscura Acosta, N. (Project Member), Jiamjitrak, W. (Project Member), Uniyal, S. (Project Member), Gadekar, A. (Project Member) & Franck, M. (Project Member)

    01/09/2017 → 31/08/2022

    Project: Academy of Finland: Other research funding