Navegar

Colección

Datos Estadísticas

Lista de

Durán, Guillermo A.
54
2006
6
"Polynomial time recognition of unit circular-arc graphs" (2006) Durán, G.;Gravano, A.;McConnell, R.M. (...)Tucker, A. Journal of Algorithms. 58(1):67-78
"On clique-perfect and K-perfect graphs" (2006) Bonomo, F.; Durán, G.; Groshaus, M.; Szwarcfiter, J.L. Ars Combinatoria. 80:97-112
"On balanced graphs" (2006) Bonomo, F.; Durán, G.; Lin, M.C.; Szwarcfiter, J.L. Mathematical Programming. 105(2-3):233-250
"NP-completeness results for edge modification problems" (2006) Burzyn, P.; Bonomo, F.; Durán, G. Discrete Applied Mathematics. 154(13 SPEC ISS):1824-1844
"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
"Algorithms for clique-independent sets on subclasses of circular-arc graphs" (2006) Durán, G.; Lin, M.C.; Mera, S.; Szwarcfiter, J.L. Discrete Applied Mathematics. 154(13 SPEC ISS):1783-1790