Asghar Asgharian-Sardroud

According to our database, Asghar Asgharian-Sardroud authored at least 7 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2023

The g-good-neighbor diagnosability of triangle-free graphs.

Asghar Asgharian-Sardroud, Mohsen Ghasemi

J. Supercomput., May, 2023

2022

Placement of dynamic service function chains in partially VNF-enabled networks.

Afsaneh Allahvirdi, Saleh Yousefi, Asghar Asgharian-Sardroud

Telecommun. Syst., 2022

2017

Embedding cycles and paths on solid grid graphs.

Asghar Asgharian-Sardroud, Alireza Bagheri

J. Supercomput., 2017

2016

An approximation algorithm for the longest path problem in solid grid graphs.

Asghar Asgharian-Sardroud, Alireza Bagheri

Optim. Methods Softw., 2016

An approximation algorithm for the longest cycle problem in solid grid graphs.

Asghar Asgharian-Sardroud, Alireza Bagheri

Discret. Appl. Math., 2016

2014

Unit-length embedding of cycles and paths on grid graphs.

Asghar Asgharian-Sardroud, Alireza Bagheri

CoRR, 2014

2012

A linear-time algorithm for the longest path problem in rectangular grid graphs.

Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri, Asghar Asgharian-Sardroud

Discret. Appl. Math., 2012