![]() | Monter d'un niveau |
Absil, R., Camby, E., Hertz, A., & Mélot, H. (2015). A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n-3. (Rapport technique n° G-2015-04). Lien externe
Aouchiche, M., Hansen, P., Hertz, A., & Sellal, C. (2015). Bounds on differences between some graph theoretic invariants. (Rapport technique n° G-2015-31). Lien externe
Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., & Gagnon, F. (août 2012). Directed weighted improper coloring for cellular channel allocation [Communication écrite]. 8th International Colloquium on Graphs and Optimization (GO VIII), Leukerbad, Switzerland. Publié dans Discrete Applied Mathematics, 182(19). Lien externe
Bécotte-Boutin, H.-S., Caporossi, G., & Hertz, A. (2015). The progressive visualization, a new tool for analyzing the writing process. (Rapport technique n° G-2015-141). Lien externe
de Werra, D., & Hertz, A. (2015). Chromatic scheduling. Dans Beineke, L. W., & Wilson, R. J. (édit.), Topics in chromatic graph theory (p. 255-276). Lien externe
Hertz, A., Lozin, V., Ries, B., Zamaraev, V., & De Werra, D. (2015). Dominating induced matchings in graphs containing no long claw. (Rapport technique n° G-2015-49). Lien externe
Hertz, A., Montagné, R., & Gagnon, F. (2015). Constructive algorithms for the partial directed weighted improper coloring problem. (Rapport technique n° G-2015-61). Lien externe