E-LIB Suche - Ergebnisse für: Trabelsi, Ohad

1

Bridge Girth: A Unifying Notion in Network Design:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Bodwin, Greg ; Hoppenworth, Gary ; Trabelsi, Ohad - p. 600-648 , 2023

Link: https://doi.org/10.1109/..

2

APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Abboud, Amir ; Krauthgamer, Robert ; Trabelsi, Ohad - p. 1135-1146 , 2022

Link: https://doi.org/10.1109/..

3

Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-H..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Abboud, Amir ; Krauthgamer, Robert ; Li, Jason... - p. 884-895 , 2022

Link: https://doi.org/10.1109/..

4

Subcubic algorithms for Gomory–Hu tree in unweighted graphs:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,

Abboud, Amir ; Krauthgamer, Robert ; Trabelsi, Ohad - p. 1725-1737 , 2021

Link: https://dl.acm.org/doi/1..

5

New algorithms and lower bounds for all-pairs max-flow in u..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,

Abboud, Amir ; Krauthgamer, Robert ; Trabelsi, Ohad - p. 48-61 , 2020

Link: https://dl.acm.org/doi/1..

6

Cut-Equivalent Trees are Optimal for Min-Cut Queries:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),

Abboud, Amir ; Krauthgamer, Robert ; Trabelsi, Ohad - p. 105-118 , 2020

Link: https://doi.org/10.1109/..

7

Conditional Lower Bounds for All-Pairs Max-Flow:

Krauthgamer, Robert ; Trabelsi, Ohad
ACM Transactions on Algorithms (TALG). 14 (2018) 4 - p. 1-15 , 2018

Link: https://dl.acm.org/doi/1..

8

Conditional Lower Bounds for All-Pairs Max-Flow:

Krauthgamer, Robert ; Trabelsi, Ohad
ACM Transactions on Algorithms. 14 (2018) 4 - p. 1-15 , 2018

Link: https://doi.org/10.1145/..

9

Bounded-Hop Communication Networks:

Carmi, Paz ; Chaitman-Yerushalmi, Lilach ; Trabelsi, Ohad
Algorithmica. 80 (2017) 11 - p. 3050-3077 , 2017

Link: https://doi.org/10.1007/..

10

(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flo:

Trabelsi, Ohad
http://arxiv.org/abs/2304.04667. , 2023

Link: http://arxiv.org/abs/230..

11

Bridge Girth: A Unifying Notion in Network Design:

Bodwin, Greg ; Hoppenworth, Gary ; Trabelsi, Ohad
http://arxiv.org/abs/2212.11944. , 2022

Link: http://arxiv.org/abs/221..

12

APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost..:

Abboud, Amir ; Krauthgamer, Robert ; Trabelsi, Ohad
http://arxiv.org/abs/2106.02981. , 2021

Link: http://arxiv.org/abs/210..

13

Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-H..:

Abboud, Amir ; Krauthgamer, Robert ; Li, Jason...
http://arxiv.org/abs/2111.04958. , 2021

Link: http://arxiv.org/abs/211..

14

Friendly Cut Sparsifiers and Faster Gomory-Hu Trees:

Abboud, Amir ; Krauthgamer, Robert ; Trabelsi, Ohad
http://arxiv.org/abs/2110.15891. , 2021

Link: http://arxiv.org/abs/211..

15

Cut-Equivalent Trees are Optimal for Min-Cut Queries:

Abboud, Amir ; Krauthgamer, Robert ; Trabelsi, Ohad
http://arxiv.org/abs/2009.06090. , 2020

Link: http://arxiv.org/abs/200..