![]() | Hertz, A., Mélot, H., Bonte, S., & Devillez, G. (2022). Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph. Discrete Applied Mathematics. doi:10.1016/j.dam.2022.08.011 ![]() |
![]() | Devillez, G. (2022). Proofs by Transformation in Extremal Graph Theory. Unpublished doctoral thesis, UMONS - University of Mons [Faculty of Science], Mons, Belgium. Jury: Mélot, H. (Promotor), Hertz, A. (Promotor), Bruyère, V., Ries, B., Labarre, A., Goedgebeur, J., & Wijsen, J. |
![]() | Devillez, G., Hertz, A., Mélot, H., Bonte, S., & Hauweele, P. (11 June 2021). On the average number of colors in the non-equivalent colorings of a graph. Paper presented at 34th Conference of the European Chapter on Combinatorial Optimization (ECCO 2021), Madrid, Spain. |
![]() | Devillez, G., Hauweele, P., Hertz, A., & Mélot, H. (15 November 2019). Minimizing the eccentric connectivity index with fixed number of pending vertices. Paper presented at 21st Journées Graphes et Algorithmes, Bruxelles, Belgium. |
![]() | Hauweele, P., Hertz, A., Mélot, H., Ries, B., & Devillez, G. (15 November 2019). Maximum eccentric connectivity index for graphs with given diameter. Paper presented at 21st Journées Graphes et Algorithmes, Bruxelles, Belgium. |
Hauweele, P., Hertz, A., Mélot, H., Ries, B., & Devillez, G. (2019). Maximum Eccentric Connectivity Index for Graphs with Given Diameter. Discrete Applied Mathematics. doi:10.1016/j.dam.2019.04.031 ![]() |
Devillez, G., Hauweele, P., & Mélot, H. (2019). PHOEG Helps to Obtain Extremal Graphs. In M. Labbé & B. Fortz (Ed.), Operations Research Proceedings 2018 (first edition). Switzerland: Springer Cham. ![]() |
![]() | Hauweele, P., Hertz, A., Mélot, H., Ries, B., & Devillez, G. (14 August 2019). Extremal results on the eccentric connectivity index. Paper presented at Ghent Graph Theory Workshop On Structure and Algorithms, Ghent, Belgium. |
![]() | Devillez, G., Hertz, A., Mélot, H., & Hauweele, P. (25 April 2019). Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pendant Vertices. Yugoslav Journal of Operations Research, 29 (2), 193-202. ![]() |
![]() | Devillez, G. (14 June 2018). Minimizing the eccentric connectivity index with a fixed number of pending vertices. Paper presented at 31th Conference of the European Chapter on Combinatorial Optimization, University of Fribourg, Fribourg, Switzerland. |
![]() | Hauweele, P., Devillez, G., & Mélot, H. (23 August 2017). PHOEG Helps Obtaining Extremal Graphs. Paper presented at Computers in Scientific Discovery 8, Mons, Belgium. |
![]() | Devillez, G., Mélot, H., Hauweele, P., & Hertz, A. (23 August 2017). Transproof : Computer assisted graph transformations. Paper presented at Computers in Scientific Discovery 8, Mons, Belgium. |
Mélot, H., Devillez, G., & Hauweele, P. (18 August 2017). PHOEG Helps Obtaining Extremal Graphs. Paper presented at Ghent Graph Theory Workshop on Structure and Algorithms, Gand, Belgium. |
Bruyère, V., Devillez, G., Hautem, Q., & Mélot, H. (2017). Sciencebook. |
Hauweele, P., Devillez, G., & Mélot, H. (13 July 2016). PHOEG Helps Obtaining Extremal Graphs. Paper presented at 10tg International Colloquium on Graphs and Optimization (GO X), Rigi, Switzerland. |
![]() | Devillez, G., Mélot, H., & Hauweele, P. (26 May 2016). PHOEG Helps Obtaining Extremal Graphs. Paper presented at European Chapter on Combinatorial Optimization, Budapest, Hungary. |
Mélot, H., Devillez, G., & Hauweele, P. (07 April 2016). PHOEG Helps Obtaining Extremal Graphs. Paper presented at Séminaires du GERAD (Ecole Polytechnique), Montréal, Canada. |
Devillez, G. (2016). Un monstre parmi les cubes. |
![]() | Devillez, G., & Hauweele, P. (10 December 2015). PHOEG Helps Obtaining Extremal Graphs. Poster session presented at Grascomp Doctoral Day, Namur, Belgium. |