Lista de

Polynomial-time
9
"Ecient type checking for path polymorphism" (2018) Edi, J.;Viso, A.;Bonelli, E. (...)European Regional Development Fund 21st International Conference on Types for Proofs and Programs, TYPES 2015. 69:61-623
"Exact Algorithms for Minimum Weighted Dominating Induced Matching" (2017) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. Algorithmica. 77(3):642-660
"On neighborhood-Helly graphs" (2017) Groshaus, M.; Lin, M.C.; Szwarcfiter, J.L. Discrete Applied Mathematics. 216:191-202
"On probe 2-clique graphs and probe diamond-free graphs" (2015) Bonomo, F.;De Figueiredo, C.M.H.;Durán, G. (...)Szwarcfiter, J.L. Discrete Mathematics and Theoretical Computer Science. 17(1):187-200
"Normality in non-integer bases and polynomial time randomness" (2015) Almarza, J.I.; Figueira, S. Journal of Computer and System Sciences. 81(7):1059-1087
"A note on the Cornaz-Jost transformation to solve the graph coloring problem" (2013) Bonomo, F.; Giandomenico, M.; Rossi, F. Information Processing Letters. 113(18):649-652
"Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs" (2009) Bonomo, F.; Chudnovsky, M.; Durán, G. Discrete Mathematics. 309(11):3485-3499
"On hereditary Helly classes of graphs" (2008) Groshaus, M.; Szwarcfiter, J.L. Discrete Mathematics and Theoretical Computer Science. 10(1):71-78