On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Fábio Protti (Electron. Notes Discret. Math., 2004)

Partition into cliques for cubic graphs: Planar case, complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Carlos A. J. Martinhon; Fábio Protti; Bruce A. Reed (Discret. Appl. Math., 2008)

Logical Reasoning via Satisfiability Mapped into Energy Functions. - Priscila Machado Vieira Lima; M. Mariela Morveli-Espinoza; Glaucia C. Pereira; Talita O. Ferreira; Felipe Maia Galvão França (Int. J. Pattern Recognit. Artif. Intell., 2008)

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. - Márcia R. Cerioli; Luérbio Faria; Talita O. Ferreira; Fábio Protti (RAIRO Theor. Informatics Appl., 2011)