1. Färbung von Graphen, deren sämtliche bzw. deren ungeraden Kreise starr sind (Zusammenfassung);Berge;Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur., Reihe,1961
2. Partitions of graphs into one or two independent sets and cliques;Brandstädt;Discrete Mathematics,1996
3. On the partition of permutations into increasing or decreasing subsequences;Brandstädt;Elektron. Inform. Kybernet.,1986
4. Graph Classes: A Survey;Brandstädt,1999
5. A fixed-parameter algorithm for the directed feedback vertex set problem;Chen;J. ACM,2008