| Subcubic algorithms for Gomory–Hu tree in unweighted graphs A Abboud, R Krauthgamer, O Trabelsi Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 31 | 2021 |
| Conditional lower bounds for all-pairs max-flow R Krauthgamer, O Trabelsi ACM Transactions on Algorithms (TALG) 14 (4), 1-15, 2018 | 31 | 2018 |
| Breaking the cubic barrier for all-pairs max-flow: Gomory-hu tree in nearly quadratic time A Abboud, R Krauthgamer, J Li, D Panigrahi, T Saranurak, O Trabelsi 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 30 | 2022 |
| New algorithms and lower bounds for all-pairs max-flow in undirected graphs A Abboud, R Krauthgamer, O Trabelsi Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 26 | 2020 |
| Faster algorithms for all-pairs bounded min-cuts A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ... arXiv preprint arXiv:1807.05803, 2018 | 24 | 2018 |
| Cut-equivalent trees are optimal for min-cut queries A Abboud, R Krauthgamer, O Trabelsi 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 22 | 2020 |
| Relaxed voronoi: A simple framework for terminal-clustering problems A Filtser, R Krauthgamer, O Trabelsi arXiv preprint arXiv:1809.00942, 2018 | 19 | 2018 |
| APMF< apsp? gomory-hu tree for unweighted graphs in almost-quadratic time A Abboud, R Krauthgamer, O Trabelsi 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 18* | 2022 |
| The set cover conjecture and subgraph isomorphism with a tree pattern R Krauthgamer, O Trabelsi arXiv preprint arXiv:1711.08041, 2017 | 12* | 2017 |
| Friendly cut sparsifiers and faster Gomory-Hu trees A Abboud, R Krauthgamer, O Trabelsi Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 9 | 2022 |
| On the bounded-hop range assignment problem P Carmi, L Chaitman-Yerushalmi, O Trabelsi Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015 | 6 | 2015 |
| Bounded-hop communication networks P Carmi, L Chaitman-Yerushalmi, O Trabelsi Algorithmica 80, 3050-3077, 2018 | 4 | 2018 |
| Bridge Girth: A Unifying Notion in Network Design G Bodwin, G Hoppenworth, O Trabelsi arXiv preprint arXiv:2212.11944, 2022 | 2 | 2022 |
| Nearly optimal time bounds for kpath in hypergraphs L Kamma, O Trabelsi arXiv preprint arXiv:1803.04940, 2018 | 2* | 2018 |
| (Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow O Trabelsi arXiv preprint arXiv:2304.04667, 2023 | | 2023 |
| Algorithms and Lower Bounds for All-Pairs Max-Flow O Trabelsi Weizmann Institute of Science, 2020 | | 2020 |
Robert KrauthgamerWeizmann Institute of ScienceVerified email at weizmann.ac.il
