Vertex partitioning problems: characterization, complexity and algorithms on partial K-trees

Complexity of domination-type problems in graphs

Nordic Journal of Computing

Generalized domination in chordal graphs

Nordic Journal of Computing

Computational complexity of generalized domination: a complete dichotomy for chordal graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science

Generalized domination in degenerate graphs: a complete dichotomy of computational complexity

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation

Breaking the 2n-barrier for Irredundance: Two lines of attack

Journal of Discrete Algorithms

Parameterized complexity of generalized domination problems

Discrete Applied Mathematics

A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance (Extended Abstract)

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity

On independence domination

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems

Theoretical Computer Science