dispersion problem, FPT, Graph representations (geometric and intersection representations, etc.), Parameterized complexity, tractability and kernelization, Approximation algorithms, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Computer graphics; computational geometry (digital and algorithmic aspects), NP-hardness, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Manhattan distance, geometric optimization, Continuous location