I agree that this site is using cookies. You can find further informations here.
X
Abboud, Amir
28  results:
Bookchapter (Online) X
Search for persons X
?
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

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

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

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

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

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

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

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

New hardness results for planar graph problems in p and an ..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Abboud, Amir ; Cohen-Addad, Vincent ; Klein, Philip N. - p. 996-1009 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

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

Evaluation of intel 3D-xpoint NVDIMM technology for memory-..:

, In: Proceedings of the International Symposium on Memory Systems,
Waddington, Daniel ; Kunitomi, Mark ; Dickey, Clem... - p. 277-287 , 2019
Link: https://dl.acm.org/doi/1..
 
?
13

Dynamic set cover: improved algorithms and lower bounds:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
Abboud, Amir ; Addanki, Raghavendra ; Grandoni, Fabrizio.. - p. 114-125 , 2019
Link: https://dl.acm.org/doi/1..
 
?
14

SETH-based lower bounds for subset sum and bicriteria path:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Abboud, Amir ; Bringmann, Karl ; Hermelin, Danny. - p. 41-57 , 2019
Link: https://dl.acm.org/doi/1..
 
?
15

More consequences of falsifying SETH and the orthogonal vec..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
Abboud, Amir ; Bringmann, Karl ; Dell, Holger. - p. 253-266 , 2018
Link: https://dl.acm.org/doi/1..
 
1-15