| 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 | 40* | 2018 |
| Transiently consistent SDN updates: Being greedy is hard SA Amiri, A Ludwig, J Marcinkowski, S Schmid Structural Information and Communication Complexity: 23rd International …, 2016 | 29 | 2016 |
| 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 | 27 | 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 | 26* | 2018 |
| The Erdos-Pósa property for directed graphs SA Amiri, K Kawarabayashi, S Kreutzer, P Wollan arXiv preprint arXiv:1603.02504, 2016 | 26 | 2016 |
| Distributed dominating set approximations beyond planar graphs SA Amiri, S Schmid, S Siebertz ACM Transactions on Algorithms (TALG) 15 (3), 1-18, 2019 | 23 | 2019 |
| 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 | 22 | 2018 |
| Walking through waypoints S Akhoondian Amiri, KT Foerster, S Schmid Algorithmica 82 (7), 1784-1812, 2020 | 18 | 2020 |
| 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 | 17 | 2015 |
| Routing with Congestion in Acyclic Digraphs SA Amiri, S Kreutzer, D Marx, R Rabinovich 41st International Symposium on Mathematical Foundations of Computer Science …, 2016 | 15 | 2016 |
| DAG-width is PSPACE-complete SA Amiri, S Kreutzer, R Rabinovich Theoretical Computer Science 655, 78-89, 2016 | 14 | 2016 |
| On the complexity of recognizing tenacious graphs A Golshani, D Moazzami, SA Amiri Ars Combinatoria 131, 11-21, 2017 | 9 | 2017 |
| 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 | 8* | 2019 |
| 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 | 8* | 2018 |
| Brief Announcement: A Log*-Time Local MDS Approximation Scheme for Bounded Genus Graphs S Akhoondian Amiri, S Schmid 30th International Symposium on Distributed Computing, DISC 2016, 480-483, 2016 | 6* | 2016 |
| Homa: Online in-flight service provisioning with dynamic bipartite matching A Varasteh, SA Amiri, C Mas-Machuca IEEE Transactions on Network and Service Management 19 (3), 3174-3187, 2022 | 5 | 2022 |
| A note on the fine-grained complexity of MIS on regular graphs SA Amiri Information Processing Letters 170, 106123, 2021 | 5 | 2021 |
| Vertex disjoint paths in upward planar graphs S Akhoondian Amiri, A Golshani, S Kreutzer, S Siebertz Computer Science-Theory and Applications: 9th International Computer Science …, 2014 | 5 | 2014 |
| Disjoint Shortest Paths with Congestion on DAGs S Akhoondian Amiri, J Wargalla arXiv e-prints, arXiv: 2008.08368, 2020 | 4* | 2020 |
| Distributed Distance-r Covering Problems on Sparse High-Girth Graphs S Akhoondian Amiri, B Wiederhake International Conference on Algorithms and Complexity, 37-60, 2021 | 2 | 2021 |
Stefan SchmidProfessor, Computer Science, TU Berlin & Weizenbaum Institute & Fraunhofer SIT在 tu-berlin.de 的电子邮件经过验证
