Amir Abboud

Available identifiers

zbMath Open abboud.amirMaRDI QIDQ1660915

List of research outcomes

Publication	Date of Publication	Type
Reachability Preservers: New Extremal Bounds and Approximation Algorithms	2024-03-19	Paper
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond	2023-12-08	Paper
Subcubic algorithms for Gomory–Hu tree in unweighted graphs	2023-11-14	Paper
SETH-based Lower Bounds for Subset Sum and Bicriteria Path	2023-10-31	Paper
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter	2023-10-23	Paper
https://portal.mardi4nfdi.de/entity/Q5091155	2022-07-21	Paper
Fine-Grained Reductions and Quantum Speedups for Dynamic Programming.	2022-07-21	Paper
Scheduling lower bounds via AND subset sum	2022-04-04	Paper
Smaller Cuts, Higher Lower Bounds	2022-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q5158499	2021-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q5002674	2021-07-28	Paper
Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds	2021-06-15	Paper
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs	2021-02-02	Paper
Fooling views: a new lower bound technique for distributed computations under congestion	2021-01-22	Paper
New hardness results for planar graph problems in p and an algorithm for sparsest cut	2021-01-19	Paper
Dynamic set cover: improved algorithms and lower bounds	2020-01-30	Paper
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path	2019-10-15	Paper
More consequences of falsifying SETH and the orthogonal vectors conjecture	2019-08-22	Paper
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser	2018-12-19	Paper
A Hierarchy of Lower Bounds for Sublinear Additive Spanners	2018-12-05	Paper
Subtree Isomorphism Revisited	2018-11-13	Paper
Near-linear lower bounds for distributed distance computations, even in sparse networks	2018-08-16	Paper
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs	2018-07-16	Paper
Error Amplification for Pairwise Spanner Lower Bounds	2018-07-16	Paper
Subtree Isomorphism Revisited	2018-07-16	Paper
A Hierarchy of Lower Bounds for Sublinear Additive Spanners	2018-07-16	Paper
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture	2018-07-04	Paper
The 4/3 Additive Spanner Exponent Is Tight	2018-05-17	Paper
https://portal.mardi4nfdi.de/entity/Q4638059	2018-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q4607916	2018-03-15	Paper
Reachability Preservers: New Extremal Bounds and Approximation Algorithms	2018-03-15	Paper
More Applications of the Polynomial Method to Algorithm Design	2017-10-05	Paper
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter	2017-10-05	Paper
The 4/3 additive spanner exponent is tight	2017-09-29	Paper
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made	2017-09-29	Paper
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture	2015-08-21	Paper
Losing Weight by Gaining Edges	2014-10-08	Paper
Consequences of Faster Alignment of Sequences	2014-07-01	Paper
Exact Weight Subgraphs and the k-Sum Conjecture	2013-08-06	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Amir Abboud