Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes

Unit disk graphs

Brent N. Clark, Charles J. Colbourn, David Johnson · Discrete Mathematics · 1990 · 1.4K citations

Clique is hard to approximate within n1−ε

Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text

Computing, Computer Science, Algorithms +3

Frequency assignment: Theory and applications

William K. Hale · Proceedings of the IEEE · 1980 · 1.3K citations

Natural Sciences, Computer Science, Algorithms +14

Simple heuristics for unit disk graphs

Madhav Marathe, Heinz Breu, Harry B. Hunt et al. · Networks · 1995 · 494 citations

Natural Sciences, Computer Science, Mathematics +17

A graph‐theoretic generalization of the clique concept

Stephen B. Seidman, Brian L. Foster · Journal of Mathematical Sociology · 1978 · 454 citations

Social Sciences, Sociology, Group Dynamics +13