I agree that this site is using cookies. You can find further informations here.
X
Abboud, Amir
92  results:
OpenAccess-fulltext X
Search for persons X
?
1

Faster Combinatorial k-Clique Algorithms:

Abboud, Amir ; Fischer, Nick ; Shechter, Yarin
http://arxiv.org/abs/2401.13502.  , 2024
Link: http://arxiv.org/abs/240..
 
?
2

Can You Solve Closest String Faster than Exhaustive Search?:

Abboud, Amir ; Fischer, Nick ; Goldenberg, Elazar..
http://arxiv.org/abs/2305.16878.  , 2023
Link: http://arxiv.org/abs/230..
 
?
3

Listing 4-Cycles:

Abboud, Amir ; Khoury, Seri ; Leibowitz, Oree.
Is Part Of LIPIcs, Volume 284, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023).  , 2023
Link: https://doi.org/10.4230/..
 
?
4

What Else Can Voronoi Diagrams Do For Diameter In Planar Gr..:

Abboud, Amir ; Mozes, Shay ; Weimann, Oren
http://arxiv.org/abs/2305.02946.  , 2023
Link: http://arxiv.org/abs/230..
 
?
5

New Graph Decompositions and Combinatorial Boolean Matrix M..:

Abboud, Amir ; Fischer, Nick ; Kelley, Zander..
http://arxiv.org/abs/2311.09095.  , 2023
Link: http://arxiv.org/abs/231..
 
?
6

On Diameter Approximation in Directed Graphs:

Abboud, Amir ; Dalirrooyfard, Mina ; Li, Ray.
http://arxiv.org/abs/2307.07583.  , 2023
Link: http://arxiv.org/abs/230..
 
?
7

Worst-Case to Expander-Case Reductions:

Abboud, Amir ; Wallheimer, Nathan
doi:10.4230/LIPIcs.ITCS.2023.1.  , 2023
Link: https://doi.org/10.4230/..
 
?
8

The Time Complexity of Fully Sparse Matrix Multiplication:

Abboud, Amir ; Bringmann, Karl ; Fischer, Nick.
http://arxiv.org/abs/2309.06317.  , 2023
Link: http://arxiv.org/abs/230..
 
?
9

Worst-Case to Expander-Case Reductions:

Abboud, Amir ; Wallheimer, Nathan
http://arxiv.org/abs/2211.12833.  , 2022
Link: http://arxiv.org/abs/221..
 
?
10

Hardness of Approximation in P via Short Cycle Removal: Cyc..:

Abboud, Amir ; Bringmann, Karl ; Khoury, Seri.
http://arxiv.org/abs/2204.10465.  , 2022
Link: http://arxiv.org/abs/220..
 
?
11

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

Abboud, Amir ; Bringmann, Karl ; Fischer, Nick
http://arxiv.org/abs/2211.07058.  , 2022
Link: http://arxiv.org/abs/221..
 
?
12

Listing 4-Cycles:

Abboud, Amir ; Khoury, Seri ; Leibowitz, Oree.
http://arxiv.org/abs/2211.10022.  , 2022
Link: http://arxiv.org/abs/221..
 
?
13

Improved Approximation Algorithms and Lower Bounds for Sear..:

Abboud, Amir ; Cohen-Addad, Vincent ; Lee, Euiwoong.
doi:10.4230/LIPIcs.ICALP.2022.7.  , 2022
Link: https://doi.org/10.4230/..
 
?
14

Improved Approximation Algorithms and Lower Bounds for Sear..:

Abboud, Amir ; Cohen-Addad, Vincent ; Lee, Euiwoong.
http://arxiv.org/abs/2203.01857.  , 2022
Link: http://arxiv.org/abs/220..
 
?
15

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