A | B | C | D | E | F 
 G | H | I | J | K | L | M 
 N | O | P | Q | R | S | T 
 U | V | W | X | Y | Z 
max planck institut
mpii logo Minerva of the Max Planck Society


Amiri, Saeed

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

Email: samiri@mpi-inf.mpg.de
Phone: +49 681 9325 1012
Fax: +49 681 9325 199

Research Interests

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