Rauf, Imran Algorithms and Complexity, MPI for Informatics, Max Planck Society; International Max Planck Research School, MPI for Informatics, Max Planck Society;
http://scidok.sulb.uni-saarland.de/volltexte/2011/4471/ (Any fulltext)
http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de (Copyright transfer agreement)
Rauf, I. (2011). Polynomially Solvable Cases of Hypergraph Transversal and Related Problems. PhD Thesis, Universität des Saarlandes, Saarbrücken. doi:10.22028/D291-26196.