Saeed Akhoondian Amiri

Orcid: 0000-0002-7402-2662

According to our database1, Saeed Akhoondian Amiri authored at least 30 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Homa: Online In-Flight Service Provisioning With Dynamic Bipartite Matching.
IEEE Trans. Netw. Serv. Manag., 2022

Distributed distance-<i>r</i> covering problems on sparse high-girth graphs.
Theor. Comput. Sci., 2022

2021
A note on the fine-grained complexity of MIS on regular graphs.
Inf. Process. Lett., 2021

Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs.
CoRR, 2021

Distributed Distance-r Covering Problems on Sparse High-Girth Graphs.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
On Fine-Grained Exact Computation in Regular Graphs.
CoRR, 2020

Disjoint Shortest Paths with Congestion on DAGs.
CoRR, 2020

Walking Through Waypoints.
Algorithmica, 2020

Complexity of Computing the Anti-Ramsey Numbers for Paths.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
Distributed Dominating Set Approximations beyond Planar Graphs.
ACM Trans. Algorithms, 2019

Routing with congestion in acyclic digraphs.
Inf. Process. Lett., 2019

Distributed Distance-r Dominating Set on Sparse High-Girth Graphs.
CoRR, 2019

On Polynomial-Time Congestion-Free Software-Defined Network Updates.
Proceedings of the 2019 IFIP Networking Conference, 2019

2018
Complexity of computing the anti-Ramsey numbers.
CoRR, 2018

Short Schedules for Fast Flow Rerouting.
CoRR, 2018

Charting the Algorithmic Complexity of Waypoint Routing.
Comput. Commun. Rev., 2018

Distributed Domination on Graph Classes of Bounded Expansion.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Waypoint Routing in Special Networks.
Proceedings of the 2018 IFIP Networking Conference and Workshops, 2018

Congestion-Free Rerouting of Flows on DAGs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Structural graph theory meets algorithms: covering and connectivity problems in graphs (Strukturelle Graphentheorie trifft Algorithmen: Überdeckungs- und Zusammenhangsprobleme in Graphen)
PhD thesis, 2017

Charting the Complexity Landscape of Waypoint Routing.
CoRR, 2017

On the complexity of recognizing tenacious graphs.
Ars Comb., 2017

2016
DAG-width is PSPACE-complete.
Theor. Comput. Sci., 2016

A local constant factor approximation for the minimum dominating set problem on bounded genus graphs.
CoRR, 2016

The Erdos-Posa Property for Directed Graphs.
CoRR, 2016

Transiently Consistent SDN Updates: Being Greedy is Hard.
Proceedings of the Structural Information and Communication Complexity, 2016

A Local Constant Factor MDS Approximation for Bounded Genus Graphs.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
Graph Searching Games and Width Measures for Directed Graphs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014
Vertex Disjoint Paths in Upward Planar Graphs.
Proceedings of the Computer Science - Theory and Applications, 2014

2013
Vertex Disjoint Path in Upward Planar Graphs.
CoRR, 2013


  Loading...