"On star and biclique edge-colorings" (2017) Dantas, S.;Groshaus, M.;Guedes, A. (...)Sasaki, D. International Transactions in Operational Research. 24(1-2):339-346

"Polyhedral studies of vertex coloring problems: The standard formulation" (2016) Delle Donne, D.; Marenco, J. Discrete Optimization. 21:1-13

"b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs" (2015) Bonomo, F.; Schaudt, O.; Stein, M.; Valencia-Pabon, M. Algorithmica. 73(2):289-305

"A branch-and-price algorithm for the (k,c)-coloring problem" (2015) Malaguti, E.; Méndez-Díaz, I.; José Miranda-Bront, J.; Zabala, P. Networks. 65(4):353-366

"A DSATUR-based algorithm for the Equitable Coloring Problem" (2015) Méndez-Díaz, I.; Nasini, G.; Severín, D. Computers and Operations Research. 57:41-50

"b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs" (2014) Bonomo, F.;Schaudt, O.;Stein, M. (...)Associacao Portuguesa de Investigacao Operacional; de Lisboa, Centro de Investigacao Operacional; Faculdade de Ciencias da Universidade; Fundacao para a Ciencia e a Tecnologia; Instituto Nacional de Estatistica; Universite Paris-Dauphine, LAMSADE 3rd International Symposium on Combinatorial Optimization, ISCO 2014. 8596 LNCS:100-111

"b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs" (2014) Bonomo, F.;Schaudt, O.;Stein, M. (...)Associacao Portuguesa de Investigacao Operacional; de Lisboa, Centro de Investigacao Operacional; Faculdade de Ciencias da Universidade; Fundacao para a Ciencia e a Tecnologia; Instituto Nacional de Estatistica; Universite Paris-Dauphine, LAMSADE 3rd International Symposium on Combinatorial Optimization, ISCO 2014. 8596 LNCS:100-111

"Between coloring and list-coloring: μ-coloring" (2011) Bonomo, F.; Palacio, M.C. Ars Combinatoria. 99:383-398

"Minimum sum set coloring of trees and line graphs of trees" (2011) Bonomo, F.; Durn, G.; Marenco, J.; Valencia-Pabon, M. Discrete Applied Mathematics. 159(5):288-294

"On the b-coloring of P4-tidy graphs" (2011) Velasquez, C.I.B.; Bonomo, F.; Koch, I. Discrete Applied Mathematics. 159(1):60-68

"Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem" (2011) Bonomo, F.; Mattia, S.; Oriolo, G. Theoretical Computer Science. 412(45):6261-6268

"Exploring the complexity boundary between coloring and list-coloring" (2009) Bonomo, F.; Durán, G.; Marenco, J. Annals of Operations Research. 169(1):3-16

"Exploring the complexity boundary between coloring and list-coloring" (2006) Bonomo, F.; Durán, G.; Marenco, J. Electronic Notes in Discrete Mathematics. 25(SPEC ISS):41-47