1. Dominating sets of the cartesian products of cycles;Assadian,2019
2. Bird, W.H., 2017. Computational Methods for Domination Problems. PhD thesis, Department of Computer Science, University of Victoria, BC, Canada.
3. Greedy sequential maximal independent set and matching are parallel on average;Blelloch,2012
4. Osmnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks;Boeing;Comput. Environ. Urban Syst.,2017
5. k-domination and k-independence in graphs: A survey;Chellali;Graphs Combinatorics,2012