Saeed Akhoondian Amiri

Publication Activity (10 Years)

Years Active: 2013-2022
Publications (10 Years): 34

Top Topics

Constant Factor

Top Venues

Theor. Comput. Sci.

Inf. Process. Lett.

Publications

Saeed Akhoondian Amiri, Ben Wiederhake
covering problems on sparse high-girth graphs. Theor. Comput. Sci. 906 (2022)
Amir Varasteh, Saeed Akhoondian Amiri, Carmen Mas Machuca
Homa: Online In-Flight Service Provisioning With Dynamic Bipartite Matching. IEEE Trans. Netw. Serv. Manag. 19 (3) (2022)
Saeed Akhoondian Amiri
A note on the fine-grained complexity of MIS on regular graphs. Inf. Process. Lett. 170 (2021)
Saeed Akhoondian Amiri, Ben Wiederhake
Distributed Distance-r Covering Problems on Sparse High-Girth Graphs. CIAC (2021)
Saeed Akhoondian Amiri
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs. CoRR (2021)
Saeed Akhoondian Amiri
Disjoint Shortest Paths with Congestion on DAGs. CoRR (2020)
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi
Complexity of Computing the Anti-Ramsey Numbers for Paths. MFCS (2020)
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid
Walking Through Waypoints. Algorithmica 82 (7) (2020)
Saeed Akhoondian Amiri
On Fine-Grained Exact Computation in Regular Graphs. CoRR (2020)
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
Distributed Dominating Set Approximations beyond Planar Graphs. ACM Trans. Algorithms 15 (3) (2019)
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Routing with congestion in acyclic digraphs. Inf. Process. Lett. 151 (2019)
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht
On Polynomial-Time Congestion-Free Software-Defined Network Updates. Networking (2019)
Saeed Akhoondian Amiri, Ben Wiederhake
Distributed Distance-r Dominating Set on Sparse High-Girth Graphs. CoRR (2019)
Saeed Akhoondian Amiri, Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi
Complexity of computing the anti-Ramsey numbers. CoRR (2018)
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid
Walking Through Waypoints. LATIN (2018)
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht
Short Schedules for Fast Flow Rerouting. CoRR (2018)
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Mahmoud Parham, Stefan Schmid
Waypoint Routing in Special Networks. Networking (2018)
Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht
Congestion-Free Rerouting of Flows on DAGs. ICALP (2018)
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid
Charting the Algorithmic Complexity of Waypoint Routing. Comput. Commun. Rev. 48 (1) (2018)
Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Distributed Domination on Graph Classes of Bounded Expansion. SPAA (2018)
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
Distributed Dominating Set Approximations beyond Planar Graphs. CoRR (2017)
Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Distributed Domination on Graph Classes of Bounded Expansion. CoRR (2017)
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid
Charting the Complexity Landscape of Waypoint Routing. CoRR (2017)
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid
Walking Through Waypoints. CoRR (2017)
Ali Golshani, Dara Moazzami, Saeed Akhoondian Amiri
On the complexity of recognizing tenacious graphs. Ars Comb. 131 (2017)
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
A Local Constant Factor MDS Approximation for Bounded Genus Graphs. PODC (2016)
Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht
Congestion-Free Rerouting of Flows on DAGs. CoRR (2016)
Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid
Transiently Consistent SDN Updates: Being Greedy is Hard. CoRR (2016)
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Routing with Congestion in Acyclic Digraphs. MFCS (2016)
Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan
The Erdos-Posa Property for Directed Graphs. CoRR (2016)
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich
Routing with Congestion in Acyclic Digraphs. CoRR (2016)
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs. CoRR (2016)
Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich
DAG-width is PSPACE-complete. Theor. Comput. Sci. 655 (2016)
Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid
Transiently Consistent SDN Updates: Being Greedy is Hard. SIROCCO (2016)
Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
Graph Searching Games and Width Measures for Directed Graphs. STACS (2015)
Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz
Vertex Disjoint Paths in Upward Planar Graphs. CSR (2014)
Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich
DAG-width is PSPACE-complete. CoRR (2014)
Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz
Vertex Disjoint Path in Upward Planar Graphs. CoRR (2013)