E-LIB Suche - Ergebnisse für: Abboud, Amir

1

Faster Combinatorial k-Clique Algorithms:

, In: Lecture Notes in Computer Science; LATIN 2024: Theoretical Informatics,

Abboud, Amir ; Fischer, Nick ; Shechter, Yarin - p. 193-206 , 2024

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

2

New Graph Decompositions and Combinatorial Boolean Matrix M..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Abboud, Amir ; Fischer, Nick ; Kelley, Zander.. - p. 935-943 , 2024

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

3

Reachability Preservers: New Extremal Bounds and Approximat..:

Abboud, Amir ; Bodwin, Greg
SIAM Journal on Computing. 53 (2024) 2 - p. 221-246 , 2024

Link: https://doi.org/10.1137/..

4

Stronger 3-SUM Lower Bounds for Approximate Distance Oracle..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Abboud, Amir ; Bringmann, Karl ; Fischer, Nick - p. 391-404 , 2023

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

5

Subcubic Equivalences between Graph Centrality Problems, AP..:

Abboud, Amir ; Grandoni, Fabrizio ; Vassilevska Williams, Virginia
ACM Transactions on Algorithms. 19 (2023) 1 - p. 1-30 , 2023

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

6

All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: ..:

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

Abboud, Amir ; Li, Jason ; Panigrahi, Debmalya. - p. 2204-2212 , 2023

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

7

Hardness of approximation in p via short cycle removal: cyc..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,

Abboud, Amir ; Bringmann, Karl ; Khoury, Seri. - p. 1487-1500 , 2022

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

8

Scheduling lower bounds via AND subset sum:

Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny.
Journal of Computer and System Sciences. 127 (2022) - p. 29-40 , 2022

Link: https://doi.org/10.1016/..

9

SETH-based Lower Bounds for Subset Sum and Bicriteria Path:

Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny.
ACM Transactions on Algorithms. 18 (2022) 1 - p. 1-22 , 2022

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

10

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/..

11

SETH-based Lower Bounds for Subset Sum and Bicriteria Path:

Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny.
ACM Transactions on Algorithms (TALG). 18 (2022) 1 - p. 1-22 , 2022

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

12

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/..

13

Smaller Cuts, Higher Lower Bounds:

Abboud, Amir ; Censor-Hillel, Keren ; Khoury, Seri.
ACM Transactions on Algorithms. 17 (2021) 4 - p. 1-40 , 2021

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

14

Smaller Cuts, Higher Lower Bounds:

Abboud, Amir ; Censor-Hillel, Keren ; Khoury, Seri.
ACM Transactions on Algorithms (TALG). 17 (2021) 4 - p. 1-40 , 2021

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

15

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..