Homepage
Saeed Amiri
PostDoc at Distributed and Embedded Systems Group
Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 312
66123 Saarbrücken
Germany
Email: samiri@mpi-inf.mpg.de
Phone: +49 681 9325 1012
Fax: +49 681 9325 199
Theory of Distributed Computing:
I work on the intersection of distributed computing, networks and
graph theory. In distributed computing and networks I work on
covering and routing problems.
In all of them, I'm interested in using structural properties of
graphs. For instance, I've done several works in the local model of
computation on the dominating set problem in the classes sparse graphs.
There I try to understand how many distributed
communication rounds are needed to find a reasonable answer to a
given covering problem. Recently I started to move to more general
covering problems, such as network decompositions.
In networks, I'm interested in finding a solution for one of the most
challenging network problems. In particular, I'm concentrated on
routing and rerouting in networks.
In the modern networks, traffic of the network changes dynamically,
therefore, we cannot rely on a fixed routing scheme. Software
Defined Networks (SDNs), enabled us to separate the control plane
from the data plane, however, still in the connection point
between these two parts we face many algorithmic challenges. I try
to understand this intersection point better to overcome existing challenges.
Since last year, I've been involved in understanding clock
synchronization paradigms and their corresponding challenges.
Graph Theory:
I'm interested in various algorithmic graph theory
problems. Including routing problems such
as disjoint paths problem in digraphs and covering problems such as
Erdős-Posa property and dominating set problem.
Short
CV
Since
December 2017: I'm a PostDoc fellow at MPII working with
Christoph
Lenzen
October 2012-2017: Ph.D. student at TU-Berlin under supervision of
Prof. Stephan
Kreutzer. My thesis was Structural
Graph Theory Meets Algorithms: Covering and Connectivity Problems in
Graphs .
2009-2012:
Masters study at University of Tehran, Iran
Publications
- Distributed Dominating Set Approximations beyond Planar Graphs
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
To appear in ACM Transaction on Algorithms (TALG) 2019.
- Complexity of computing the
anti-Ramsey numbers
Saeed Akhoondian Amiri, Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi
Submitted.
- Short Schedules for Fast Flow Rerouting
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham,
Stefan Schmid, Sebastian Wiederrecht
IFIP Networking 2019.
- Congestion-Free
Rerouting of Flows on DAGs
Saeed Akhoondian Amiri, Szymon Dudycz,
Stefan Schmid, Sebastian Wiederrecht
ICALP 2018.
2018.
- Walking Through Waypoints
Saeed Akhoondian Amiri, Klaus-Tycho Foerster,
Stefan Schmid.
LATIN 2018.
- Distributed
Domination on Graph Classes of Bounded Expansion
Saeed Akhoondian
Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian
Siebertz
To Appear in SPAA
2018
- Charting
the Complexity Landscape of Waypoint Routing
Saeed Akhoondian
Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid
IFIP Networking 2018.
- Structural
Graph Theory Meets Algorithms: Covering and Connectivity Problems in
Graphs.
Ph.D. thesis 2017.
- Routing
with Congestion in Acyclic Digraphs
Saeed Akhoondian Amiri,
Stephan Kreutzer, Dániel Marx, Roman Rabinovich
MFCS 2016.
- A Local Constant Factor MDS Approximation for Bounded Genus
Graphs.
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian
Siebertz.
PODC 2016.
- Transiently
Consistent SDN Updates: Being Greedy is Hard.
Saeed Akhoondian Amiri, Arne Ludwig, Jan
Marcinkowski, Stefan Schmid
SIROCCO 2016.
- Brief
Announcement: A Log*-Time Local MDS Approximation
Saeed Akhoondian
Amiri, Stefan Schmid
DISC 2016
- DAG-width is PSPACE-complete
Saeed
Akhoondian Amiri, Stephan Kreutzer, Roman
Rabinovich
Theor. Comput. Sci. 2016.
- The Erdos-Posa Property for Directed Graphs
Saeed Akhoondian Amiri,
Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan.
- Graph
Searching Games and Width Measures for Directed Graphs
Saeed
Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich,
and Sebastian Siebertz
STACS 2015.
- Vertex
Disjoint Paths in Upward Planar Graphs
Saeed Akhoondian Amiri, Ali
Golshani, Stephan Kreutzer, Sebastian Siebertz
CSR 2014.