13 citations · 19 across the 11 of their papers we have counts for
5 papers · 1 filter
Congestion-Free Rerouting of Flows on DAGs
Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid +1
Changing a given configuration in a graph into another one is known as a re- configuration problem. Such problems have recently received much interest in the context of algorithmic…
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…
Routing with Congestion in Acyclic Digraphs
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx +1
We study the version of the -disjoint paths problem where demand pairs , , are specified in the input and the paths in the solution are allowed…
The Erdos-Posa Property for Directed Graphs
Saeed Akhoondian Amiri, Ken-Ichi Kawarabayashi, Stephan Kreutzer +1
A classical result by Erdos and Posa states that there is a function such that for every , every graph contains pairwise vertex…
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-kn…