Saeed Akhoondian Amiri
Saeed Akhoondian Amiri
Verified email at - Homepage
Cited by
Cited by
Congestion-Free Rerouting of Flows on DAGs
S Akhoondian Amiri, S Dudycz, S Schmid, S Wiederrecht
45th International Colloquium on Automata, Languages, and Programming†…, 2018
Transiently consistent SDN updates: Being greedy is hard
SA Amiri, A Ludwig, J Marcinkowski, S Schmid
International Colloquium on Structural Information and Communication†…, 2016
Charting the algorithmic complexity of waypoint routing
SA Amiri, KT Foerster, R Jacob, S Schmid
ACM SIGCOMM Computer Communication Review 48 (1), 42-48, 2018
A local constant factor MDS approximation for bounded genus graphs
S Akhoondian Amiri, S Schmid, S Siebertz
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing†…, 2016
Walking through waypoints
SA Amiri, KT Foerster, S Schmid
Algorithmica, 1-29, 2020
DAG-width is PSPACE-complete
SA Amiri, S Kreutzer, R Rabinovich
Theoretical Computer Science 655, 78-89, 2016
Distributed Domination on Graph Classes of Bounded Expansion
S Akhoondian Amiri, P Ossona de Mendez, R Rabinovich, S Siebertz
Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, 143--151, 2018
Graph searching games and width measures for directed graphs
S Akhoondian Amiri, L Kaiser, S Kreutzer, R Rabinovich, S Siebertz
32nd International Symposium on Theoretical Aspects of Computer Science†…, 2015
The Erdos-Půsa property for directed graphs
SA Amiri, KI Kawarabayashi, S Kreutzer, P Wollan
arXiv preprint arXiv:1603.02504, 2016
Routing with Congestion in Acyclic Digraphs
SA Amiri, S Kreutzer, D Marx, R Rabinovich
41st International Symposium on Mathematical Foundations of Computer Science†…, 2016
Distributed dominating set approximations beyond planar graphs
SA Amiri, S Schmid, S Siebertz
ACM Transactions on Algorithms (TALG) 15 (3), 1-18, 2019
The Erdős-Půsa property for directed graphs
SA Amiri, K Kawarabayashi, S Kreutzer, P Wollan
arXiv preprint arXiv:1603.02504, 2016
Waypoint routing in special networks
SA Amiri, KT Foerster, R Jacob, M Parham, S Schmid
2018 IFIP Networking Conference (IFIP Networking) and Workshops, 1-9, 2018
On Polynomial-Time Congestion-Free Software-Defined Network Updates
S Akhoondian Amiri, S Dudycz, M Parham, S Schmid, S Wiederrecht
IFIP Networking, 1-9, 2019
Brief Announcement: A Log-Time Local MDS Approximation Scheme for Bounded Genus Graphs
S Akhoondian Amiri, S Schmid
Vertex disjoint paths in upward planar graphs
SA Amiri, A Golshani, S Kreutzer, S Siebertz
International Computer Science Symposium in Russia, 52-64, 2014
Complexity of computing the anti-ramsey numbers for paths
SA Amiri, A Popa, M Roghani, G Shahkarami, R Soltani, H Vahidi
arXiv preprint arXiv:1810.08004, 2018
Structural graph theory meets algorithms: covering and connectivity problems in graphs
SA Amiri
PQDT-Global, 2017
On Fine-Grained Exact Computation in Regular Graphs
SA Amiri
arXiv preprint arXiv:2008.09008, 2020
The -Vertex Shortest Paths on DAGs
SA Amiri
arXiv preprint arXiv:2008.08368, 2020
The system can't perform the operation now. Try again later.
Articles 1–20