3 Einträge gefunden

1. Approximating sparsest cut in low-treewidth graphs via combinatorial diameter

   1. Chalermsook, Parinya
   2. Kaul, Matthias
   3. Mnich, Matthias
   4. Spoerhase, Joachim
   5. Uniyal, Sumedha
   6. Vaz, Daniel

   2021 - TUHH Open Research - frei zugänglich
2. New algorithms for maximum disjoint paths based on tree-likeness

   1. Fleszar, Krzysztof
   2. Mnich, Matthias
   3. Spoerhase, Joachim

   2018 - TUHH Open Research
3. New algorithms for maximum disjoint paths based on tree-likeness

   1. Fleszar, Krzysztof
   2. Mnich, Matthias
   3. Spoerhase, Joachim

   2016 - TUHH Open Research