Profil

Devillez Gauvain

Université de Mons - UMONS > Faculté des Sciences > Service Algorithmique

Université de Mons - UMONS > Faculté des Sciences > Service de Génie Logiciel

Université de Mons - UMONS > Faculté des Sciences > Service d'Informatique théorique

Université de Mons - UMONS > Faculté des Sciences > Algorithmique

ORCID
0000-0002-3931-1610
Main Referenced Co-authors
MELOT, Hadrien  (19)
HAUWEELE, Pierre  (17)
Hertz, Alain (11)
BONTE, Sébastien  (6)
Ries, Bernard (3)
Main Referenced Keywords
Graph Theory (4); Average number of colors (3); Discrete Mathematics and Combinatorics (3); extremal graph theory (3); Graph coloring (3);
Main Referenced Unit & Research Centers
CREMMI - Modélisation mathématique et informatique (16)
Main Referenced Disciplines
Mathematics (21)
Electrical & electronics engineering (13)
Computer science (4)

Publications (total 23)

The most downloaded
55 downloads
Devillez, G. (2022). Proofs by Transformation in Extremal Graph Theory [Doctoral thesis, UMONS - University of Mons]. ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/44369 https://hdl.handle.net/20.500.12907/44369

The most cited

3 citations (Scopus®)

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 https://hdl.handle.net/20.500.12907/24802

Hertz, A., Bonte, S., Devillez, G., & Mélot, H. (April 2024). The average size of maximal matchings in graphs. Journal of Combinatorial Optimization, 47 (3). doi:10.1007/s10878-024-01144-8
Peer Reviewed verified by ORBi

Hertz, A., Mélot, H., Bonte, S., & Devillez, G. (15 August 2023). Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph. Discrete Applied Mathematics, 355, 69-81. doi:10.1016/j.dam.2022.08.011
Peer Reviewed verified by ORBi

Devillez, G., Mélot, H., Hertz, A., Bonte, S., & Hauweele, P. (04 July 2023). Extremal results on the Arithmetic Geometric Index [Paper presentation]. International Colloquium on Graphs and Optimization 2023, Spa, Belgium.
Editorial reviewed

Mélot, H., Bonte, S., Devillez, G., & Hauweele, P. (13 May 2023). Exploring extremal properties of graphs using PHOEG [Paper presentation]. 36th Conference of the European Chapter on Combinatorial Optimization (ECCO XXXVI), Chania, Greece.
Editorial reviewed

Hertz, A., Mélot, H., Bonte, S., Devillez, G., & Hauweele, P. (15 April 2023). Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph. Graphs and Combinatorics, 39 (49). doi:10.1007/s00373-023-02637-9
Peer Reviewed verified by ORBi

Devillez, G. (2022). Proofs by Transformation in Extremal Graph Theory [Doctoral thesis, UMONS - University of Mons]. ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/44369

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 presentation]. 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 presentation]. 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 presentation]. 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
Peer Reviewed verified by ORBi

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.
Peer reviewed

Hauweele, P., Hertz, A., Mélot, H., Ries, B., & Devillez, G. (14 August 2019). Extremal results on the eccentric connectivity index [Paper presentation]. 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.
Peer Reviewed verified by ORBi

Devillez, G. (14 June 2018). Minimizing the eccentric connectivity index with a fixed number of pending vertices [Paper presentation]. 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 presentation]. 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 presentation]. Computers in Scientific Discovery 8, Mons, Belgium.

Mélot, H., Devillez, G., & Hauweele, P. (18 August 2017). PHOEG Helps Obtaining Extremal Graphs [Paper presentation]. 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 presentation]. 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 presentation]. European Chapter on Combinatorial Optimization, Budapest, Hungary.

Mélot, H., Devillez, G., & Hauweele, P. (07 April 2016). PHOEG Helps Obtaining Extremal Graphs [Paper presentation]. 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 presentation]. Grascomp Doctoral Day, Namur, Belgium.

Contact ORBi UMONS