A unified approximation algorithm for node-deletion problems

Approximating element-weighted vertex deletion problems for the complete k-partite property

Journal of Algorithms

A new approach for approximating node deletion problems

Information Processing Letters

Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004

ACM Computing Surveys (CSUR)

Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties

Journal of Computer and System Sciences

A tale of two methods

Theoretical Computer Science

Faster parameterized algorithms for deletion to split graphs

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory

Combination of parallel machine scheduling and vertex cover

Theoretical Computer Science