[1]
S. Barman, M. Pal, and S. Mondal, “An optimal algorithm for computing minimum \(k\)-hop dominating set of permutation graphs”, Serdica Math. J., vol. 46, no. 1, pp. 43–60, Jun. 2020.