"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

"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

"Dynamic Programming Principle for tug-of-war games with noise" (2012) Manfredi, J.J.; Parviainen, M.; Rossi, J.D. ESAIM - Control, Optimisation and Calculus of Variations. 18(1):81-90

"Solving a multicoloring problem with overlaps using integer programming" (2010) Méndez-Díaz, I.; Zabala, P. Discrete Applied Mathematics. 158(4):349-354

"An asymptotic mean value chara cterization for a class of nonlinear parabolic equations related to tug-of-war games" (2010) Manfredi, J.J.; Parviainenf, M.; Rossi, J.D. SIAM Journal on Mathematical Analysis. 42(5):2058-2081

"A column generation algorithm for choice-based network revenue management" (2009) Bront, J.J.M.; Méndez-Díaz, I.; Vulcano, G. Operations Research. 57(3):769-784

"A new formulation for the Traveling Deliveryman Problem" (2008) Méndez-Díaz, I.; Zabala, P.; Lucena, A. Discrete Applied Mathematics. 156(17):3223-3237

"DynAlloy: Upgrading alloy with actions" (2005) Frias, M.F.; Galeotti, J.P.; Pombo, C.G.L.; Aguirre, N.M. 27th International Conference on Software Engineering, ICSE05:442-450

"Social Mobility: The Barro-Becker Children Meet the Laitner-Loury Dynasties" (1999) Alvarez, F. Review of Economic Dynamics. 2(1):65-103