2 citations · 2 across the 2 of their papers we have counts for
9 papers
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs
Saeed Akhoondian Amiri
We provide a deterministic CONGEST algorithm to constant factor approximate the minimum dominating set on graphs of bounded arboricity in rounds. This improves over the…
On Fine-Grained Exact Computation in Regular Graphs
Saeed Akhoondian Amiri
We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs unless ETH fails. We expand our m…
Distributed Distance- Dominating Set on Sparse High-Girth Graphs
Saeed Akhoondian Amiri, Ben Wiederhake
The dominating set problem and its generalization, the distance- dominating set problem, are among the well-studied problems in the sequential settings. In distributed models of…
Complexity of Computing the Anti-Ramsey Numbers for Paths
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani +3
The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs and the \emph{anti-Ramsey number}…
Short Schedules for Fast Flow Rerouting
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham +2
This paper studies the fundamental problem of how to reroute unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new pa…
Transiently Consistent SDN Updates: Being Greedy is Hard
Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski +1
The software-defined networking paradigm introduces interesting opportunities to operate networks in a more flexible, optimized, yet formally verifiable manner. Despite the logical…