Hermelin, Danny Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Hermelin, D., Mnich, M., & van Leeuwen, E. J. (2012). Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. In L. Epstein, & P. Ferragina (Eds.), Algorithms - ESA 2012 (pp. 624-635). Berlin: Springer.