Saeed Akhoondian Amiri

According to our database, Saeed Akhoondian Amiri authored at least 30 papers between 2013 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Homa: Online In-Flight Service Provisioning With Dynamic Bipartite Matching.

Amir Varasteh, Saeed Akhoondian Amiri, Carmen Mas Machuca

IEEE Trans. Netw. Serv. Manag., 2022

Distributed distance-<i>r</i> covering problems on sparse high-girth graphs.

Saeed Akhoondian Amiri, Ben Wiederhake

Theor. Comput. Sci., 2022

2021

A note on the fine-grained complexity of MIS on regular graphs.

Saeed Akhoondian Amiri

Inf. Process. Lett., 2021

Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs.

Saeed Akhoondian Amiri

CoRR, 2021

Distributed Distance-r Covering Problems on Sparse High-Girth Graphs.

Saeed Akhoondian Amiri, Ben Wiederhake

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

On Fine-Grained Exact Computation in Regular Graphs.

Saeed Akhoondian Amiri

CoRR, 2020

Disjoint Shortest Paths with Congestion on DAGs.

Saeed Akhoondian Amiri

CoRR, 2020

Walking Through Waypoints.

Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid

Algorithmica, 2020

Complexity of Computing the Anti-Ramsey Numbers for Paths.

Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Distributed Dominating Set Approximations beyond Planar Graphs.

Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz

ACM Trans. Algorithms, 2019

Routing with congestion in acyclic digraphs.

Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich

Inf. Process. Lett., 2019

Distributed Distance-r Dominating Set on Sparse High-Girth Graphs.

Saeed Akhoondian Amiri, Ben Wiederhake

CoRR, 2019

On Polynomial-Time Congestion-Free Software-Defined Network Updates.

Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht

Proceedings of the 2019 IFIP Networking Conference, 2019

2018

Complexity of computing the anti-Ramsey numbers.

Saeed Akhoondian Amiri, Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi

CoRR, 2018

Short Schedules for Fast Flow Rerouting.

Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht

CoRR, 2018

Charting the Algorithmic Complexity of Waypoint Routing.

Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid

Comput. Commun. Rev., 2018

Distributed Domination on Graph Classes of Bounded Expansion.

Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Waypoint Routing in Special Networks.

Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Mahmoud Parham, Stefan Schmid

Proceedings of the 17th International IFIP TC6 Networking Conference, 2018

Congestion-Free Rerouting of Flows on DAGs.

Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Structural graph theory meets algorithms: covering and connectivity problems in graphs (Strukturelle Graphentheorie trifft Algorithmen: Überdeckungs- und Zusammenhangsprobleme in Graphen)

Saeed Akhoondian Amiri

PhD thesis, 2017

Charting the Complexity Landscape of Waypoint Routing.

Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid

CoRR, 2017

On the complexity of recognizing tenacious graphs.

Ali Golshani, Dara Moazzami, Saeed Akhoondian Amiri

Ars Comb., 2017

2016

DAG-width is PSPACE-complete.

Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich

Theor. Comput. Sci., 2016

A local constant factor approximation for the minimum dominating set problem on bounded genus graphs.

Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz

CoRR, 2016

The Erdos-Posa Property for Directed Graphs.

Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan

CoRR, 2016

Transiently Consistent SDN Updates: Being Greedy is Hard.

Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid

Proceedings of the Structural Information and Communication Complexity, 2016

A Local Constant Factor MDS Approximation for Bounded Genus Graphs.

Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

Graph Searching Games and Width Measures for Directed Graphs.

Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Vertex Disjoint Paths in Upward Planar Graphs.

Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz

Proceedings of the Computer Science - Theory and Applications, 2014

2013

Vertex Disjoint Path in Upward Planar Graphs.

Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz

CoRR, 2013