On the algorithmic complexity of twelve covering and independence parameters of graphs

Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Vertex and edge covers with clustering properties: Complexity and algorithms

Journal of Discrete Algorithms

The algorithmic complexity of mixed domination in graphs

Theoretical Computer Science

Nonblocker: parameterized algorithmics for minimum dominating set

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science

On the mixed domination problem in graphs

Theoretical Computer Science