Saeed Akhoondian Amiri

40 papers A* 2A 1B 7C 1Misc 1Journal 27

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