S. Amiri

Most-cited papers

Distributed Dominating Set Approximations beyond Planar Graphs
S. Amiri, S. Schmid, S. Siebertz
2017ACM Trans. Algorithms35 citations Open access
Semantic Scholar
Congestion-Free Rerouting of Flows on DAGs
S. Amiri, S. Dudycz, S. Schmid, S. Wiederrecht
2016International Colloquium on Automata, Languages and Programming33 citations
Semantic Scholar
Transiently Consistent SDN Updates: Being Greedy is Hard
S. Amiri, A. Ludwig, Jan Marcinkowski, S. Schmid
2016Colloquium on Structural Information & Communication Complexity30 citations Open access
Semantic Scholar
The Erdos-Posa Property for Directed Graphs
S. Amiri, K. Kawarabayashi, S. Kreutzer, Paul Wollan
2016arXiv.org25 citations
Semantic Scholar
Charting the Algorithmic Complexity of Waypoint Routing
S. Amiri, Klaus-Tycho Foerster, Riko Jacob, S. Schmid
2018CCRV21 citations Open access
Semantic Scholar
Routing with Congestion in Acyclic Digraphs
S. Amiri, S. Kreutzer, Dániel Marx, R. Rabinovich
2016International Symposium on Mathematical Foundations of Computer Science17 citations Open access
Semantic Scholar
Graph Searching Games and Width Measures for Directed Graphs
S. Amiri, Lukasz Kaiser, S. Kreutzer, R. Rabinovich +1 more
2015Symposium on Theoretical Aspects of Computer Science11 citations
Semantic Scholar
On Polynomial-Time Congestion-Free Software-Defined Network Updates
S. Amiri, S. Dudycz, Mahmoud Parham, S. Schmid +1 more
20192019 IFIP Networking Conference (IFIP Networking)9 citations
Semantic Scholar
A note on the fine-grained complexity of MIS on regular graphs
S. Amiri
2021Information Processing Letters8 citations
Semantic Scholar
Waypoint Routing in Special Networks
S. Amiri, Klaus-Tycho Foerster, Riko Jacob, Mahmoud Parham +1 more
20182018 IFIP Networking Conference (IFIP Networking) and Workshops8 citations
Semantic Scholar
Brief Announcement : A Log ∗-Time Local MDS Approximation Scheme for Bounded Genus Graphs ?
S. Amiri, S. Schmid
20168 citations
Semantic Scholar
DAG-width is PSPACE-complete
S. Amiri, S. Kreutzer, R. Rabinovich
2014Theoretical Computer Science8 citations Open access
Semantic Scholar
Homa: Online In-Flight Service Provisioning With Dynamic Bipartite Matching
Amir Varasteh, S. Amiri, C. Mas-Machuca
2022IEEE Transactions on Network and Service Management6 citations Open access
Semantic Scholar
Disjoint Shortest Paths with Congestion on DAGs
S. Amiri, Julian Wargalla
2020arXiv.org6 citations
Semantic Scholar
On the complexity of recognizing tenacious graphs
A. Golshani, D. Moazzami, S. Amiri
2017Ars Comb.6 citations
Semantic Scholar
Distributed Distance-r Covering Problems on Sparse High-Girth Graphs
S. Amiri, Ben Wiederhake
2022International/Italian Conference on Algorithms and Complexity5 citations Open access
Semantic Scholar
Charting the Complexity Landscape of Waypoint Routing
S. Amiri, Klaus-Tycho Foerster, Riko Jacob, S. Schmid
2017arXiv.org5 citations
Semantic Scholar
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs
S. Amiri
2021arXiv.org4 citations
Semantic Scholar
Vertex Disjoint Paths in Upward Planar Graphs
S. Amiri, A. Golshani, S. Kreutzer, S. Siebertz
2013Computer Science Symposium in Russia3 citations Open access
Semantic Scholar
Complexity of computing the anti-Ramsey numbers
S. Amiri, Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi
2018arXiv.org2 citations
Semantic Scholar
Short Schedules for Fast Flow Rerouting
S. Amiri, S. Dudycz, Mahmoud Parham, S. Schmid +1 more
2018arXiv.org2 citations
Semantic Scholar
Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors
S. Amiri, S. Siebertz
20261 citations
Semantic Scholar
Congestion-Free Rerouting of Flows on DAGs ∗ 1
S. Amiri, S. Dudycz, S. Schmid, S. Wiederrecht
20181 citations
Semantic Scholar
Structural graph theory meets algorithms: covering and connectivity problems in graphs (Strukturelle Graphentheorie trifft Algorithmen: Überdeckungs- und Zusammenhangsprobleme in Graphen)
S. Amiri
20171 citations
Semantic Scholar
The $k$-Vertex Shortest Paths on DAGs
S. Amiri
20200 citations
Semantic Scholar
On Fine-Grained Exact Computation in Regular Graphs
S. Amiri
2020arXiv.org0 citations
Semantic Scholar
Distributed Distance-r Dominating Set on Sparse High-Girth Graphs
S. Amiri, Ben Wiederhake
2019arXiv.org0 citations
Semantic Scholar
Complexity of Computing the Anti-Ramsey Numbers for Paths
S. Amiri, Alexandru Popa, M. Roghani, Golnoosh Shahkarami +2 more
2018International Symposium on Mathematical Foundations of Computer Science0 citations
Semantic Scholar
Complexity Landscape of Computing the Anti-Ramsey Numbers
S. Amiri, Alexandru Popa, M. Roghani, Golnoosh Shahkarami +2 more
20180 citations
Semantic Scholar
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs
S. Amiri, S. Schmid, S. Siebertz
2016arXiv.org0 citations
Semantic Scholar
KIT-REPORT 160 Vertex Disjoint Paths in Upward Planar Graphs
S. Amiri, A. Golshani, S. Kreutzer, S. Siebertz
0 citations
Semantic Scholar