Main Subjects = Algorithms and Complexity
Number of Articles: 5
1. The complexity of cost constrained vehicle scheduling problem

Volume 2, Issue 1, Winter and Spring 2021, Pages 109-115

10.22060/ajmc.2021.19454.1046

Malihe Niksirat; Seyed Naser Hashemi


2. Approximation algorithms for multi-multiway cut and multicut problems on directed graphs

Volume 1, Issue 2, Summer and Autumn 2020, Pages 145-152

10.22060/ajmc.2018.15109.1014

Ramin Yarinezhad; Seyed Naser Hashemi


3. Counting closed billiard paths

Volume 1, Issue 2, Summer and Autumn 2020, Pages 171-177

10.22060/ajmc.2020.17320.1026

Sina Farahzad; Ali Rahmati; Zahed Rahmati


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

Volume 1, Issue 2, Summer and Autumn 2020, Pages 263-270

10.22060/ajmc.2020.18444.1035

Pouyeh Sharifani; Mohammadreza Hooshmandasl; Saeid Alikhani


5. A simple greedy approximation algorithm for the unit disk cover problem

Volume 1, Issue 1, Winter and Spring 2020, Pages 47-55

10.22060/ajmc.2018.3044

Mahdi Imanparast; Seyed Naser Hashemi