1. Convex optimization for the planted k-disjoint-clique problem;Ames;Math. Program.,2014
2. A tight approximation algorithm for the cluster vertex deletion problem;Aprile,2020
3. On a polynomial fractional formulation for independence number of a graph;Balasundaram;J. Global Optim.,2006
4. Efficient algorithms for cluster editing;Bastos;J. Comb. Optim.,2016
5. Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung);Berge;Wiss. Z. Martin Luther Univ. Halle-Wittenberg Math.-Nat.wiss.,1961