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 exploiting structural properties of
graphs to solve the problem or improve our understanding on the topic. Maybe you can find outcome of such interests in my series of papers on dominating sets in distributed setting or rerouting problems in networks, however, I'm not bound to these problems.
One might ask why then distributed computing?
I found it awesome to think about standpoint of a single node in the graph and see how much information from the entire graph is necessary to provide a suitable output. This actually is what happening in the reality (even though I'm conducting research on the theoretical aspects of it).
Graph Theory:
I'm interested in various algorithmic graph theory
problems. Agian this is aligned with my interest in better understanding of graphs. You may see outcome of such interests in my papers on structural graph problems such as disjoint paths problem and our interesting work on
Erdős-Posa property in digraphs.
Short
CV
Since
december 2017 I am a postdoctoral fellow at MPII working under supervision of
Dr. Christoph
Lenzen and Prof. Kurt Mehlhorn.
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 .
Sep 2009 - Jan 2012:
Master study at University of Tehran, Iran
Industry Experience: Before continuing my Master's and Ph.D. studies, I've worked as software developer/technical team leader, for several years. Back then I was a decent developer.
Teaching:
I will be moving to the university of Cologn soon, hence, I do not offer any course in this semester. I have taught advance courses on graph algorithms and distributed computing in the last semesters. If you are interested in, have a look at the corresponding course materials in the following links.
Community Service:
- Program Committee: I'll be serving as the program committee of SPAA 2020.
- Reviews: I am a regular reviewer of several journals and conferences. I review approximately 10 papers per year.
Publications
- Distributed Dominating Set Approximations beyond Planar Graphs
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
ACM Transaction on Algorithms (TALG) 2019.
- Routing with congestion in acyclic digraphs.
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Information Processing Letter 2019.
- Complexity of computing the
anti-Ramsey numbers
Saeed Akhoondian Amiri, Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi
Submitted to STACS 2020.
- Distributed Distance-r Dominating Set on Sparse High-Girth Graphs.
Saeed Akhoondian Amiri, Ben Wiederhake
Submitted to STACS 2020
- 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.