logo biblio digital exactas
logo twitter logo instagram logo whatsapp logo mail

Navegar

Colección

Datos Estadísticas

Lista de

Time algorithms
5
"A faster algorithm for the cluster editing problem on proper interval graphs" (2015) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. Information Processing Letters. 115(12):913-916
"O(n) time algorithms for dominating induced matching problems" (2014) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. 11th Latin American Theoretical Informatics Symposium, LATIN 2014. 8392 LNCS:399-408
"Fast algorithms for some dominating induced matching problems" (2014) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. Information Processing Letters. 114(10):524-528
"An O*(1.1939n) time algorithm for minimum weighted dominating induced matching" (2013) Lin, M.C.; Mizrahi, M.J.; Szwarcfiter, J.L. 24th International Symposium on Algorithms and Computation, ISAAC 2013. 8283 LNCS:558-567
"Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques" (2009) Marenco, J.; Wagler, A. Discrete Optimization. 6(1):64-78