Main Subjects = Algorithms and Complexity
New heuristics for burning connected graphs

Volume 3, Issue 2, October 2022, Pages 165-172

10.22060/ajmc.2022.21692.1101

Maryam Tahmasbi; Zahra Rezai Farokh; Yousof Buali; Zahra Haj Rajab Ali Tehrani


The complexity of cost constrained vehicle scheduling problem

Volume 2, Issue 1, February 2021, Pages 109-115

10.22060/ajmc.2021.19454.1046

Malihe Niksirat; Seyed Naser Hashemi


Counting closed billiard paths

Volume 1, Issue 2, October 2020, Pages 171-177

10.22060/ajmc.2020.17320.1026

Sina Farahzad; Ali Rahmati; Zahed Rahmati


A linear-time algorithm to compute total [1, 2]-domination number of block graphs

Volume 1, Issue 2, October 2020, Pages 263-270

10.22060/ajmc.2020.18444.1035

Pouyeh Sharifani; Mohammadreza Hooshmandasl; Saeid Alikhani


A simple greedy approximation algorithm for the unit disk cover problem

Volume 1, Issue 1, February 2020, Pages 47-55

10.22060/ajmc.2018.3044

Mahdi Imanparast; Seyed Naser Hashemi