Publications

3 results for Ohad Trabelsi

Cut-equivalent trees are optimal for min-cut queries
- - Amir Abboud
  - Robert Krauthgamer
  - et al.
- 2020
- FOCS 2020
New algorithms and lower bounds for all-pairs max-flow in undirected graphs
- - Amir Abboud
  - Robert Krauthgamer
  - et al.
- 2020
- SODA 2020
Faster algorithms for all-pairs bounded min-cuts
- - Amir Abboud
  - Loukas Georgiadis
  - et al.
- 2019
- ICALP 2019