Back
  1. Home
  2. Profile
Profil

Mélot Hadrien

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

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

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

ORCID
0000-0003-4805-1352

Main Referenced Co-authors
Devillez, Gauvain  (15)
Hauweele, Pierre  (13)
Hertz, Alain (11)
Bruyère, Véronique  (6)
Brihaye, Thomas  (5)
Main Referenced Keywords
extremal graph theory (4); graph invariant (3); graph theory (3); Average number of colors (2); Database of graphs (2);
Main Referenced Unit & Research Centers
CREMMI - Modélisation mathématique et informatique (31)
CRTI - Centre de Recherche en Technologie de l'Information (2)
CREMH - Mind & Health (1)
URBAINE - Urbanisation Revitalisation Bâtiment Architecture Innovations Espaces (1)
Main Referenced Disciplines
Mathematics (43)
Electrical & electronics engineering (28)
Computer science (8)
Architecture (3)
Library & information sciences (1)

Publications (total 54)

The most downloaded
29 downloads
Mélot, H., & Buys, A. (2020). Academic Writing in Computer Science. https://hdl.handle.net/20.500.12907/8103
The most cited
111 citations (Scopus®)
Brinkmann, G., Coolsaet, K., Goedgebeur, J., & Mélot, H. (01 January 2013). House of Graphs: A database of interesting graphs. Discrete Applied Mathematics, 161, 311-314. https://hdl.handle.net/20.500.12907/28128

Meurisse, Q., Koutra, S., Mélot, H., Laplume, D., Becue, V., Brihaye, T., Cenci, J., Coszach, E., De Smet, I., & Rivière, C. (In press). Building functionality assignment in dense and compact blocks using graph theory and game theory. Paper presented at Urban Complex Systems 2021, Lyon, France.

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

Mélot, H. (22 May 2022). Visualizing and manipulating PHOEG data to explore extremal properties of graphs. Paper presented at Bid Data in Pure Mathematics, Boston, United States.

De Smet, I., Meurisse, Q., Brihaye, T., Cenci, J., Laplume, D., Mélot, H., & Rivière, C. (2022). Compacts typo-morphologies by use of local search methods. Paper presented at ISUF 2019 XXVI International Seminar on Urban Form: Cities as Assemblages, Nicosia, Cyprus.

Blekic, W., Bellaert, N., Lecomte, N., Kandana Arachchige, K., Mélot, H., & Rossignol, M. (2022). Cognitive flexibility and attentional patterns among trauma survivors: preliminary evidence from an eye-tracking study. European Journal of Psychotraumatology.
Peer Reviewed verified by ORBi

Hertz, A., & Mélot, H. (21 December 2021). Using Graph Theory to Derive Inequalities for the Bell Numbers. Journal of Integer Sequences, 24 (21.10.6).
Peer reviewed

Mélot, H. (22 September 2021). Using Graph Theory to Derive Inequalities for the Bell Numbers. Paper presented at Discrete Mathematics Seminar, Virginia Commonwealth University, United States.

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.

Meurisse, Q., De Smet, I., Mélot, H., Laplume, D., Brihaye, T., Rivière, C., Coszach, E., Cenci, J., Koutra, S., & Becue, V. (2020). Recherche locale et théorie des jeux appliqués à la création de typo-morphologies compactes. Paper presented at SCAN20 « Culture numérique et conception architecturale ... Retour vers le Futur », Bruxelles , Belgium.

Mélot, H., & Buys, A. (2020). Academic Writing in Computer Science.

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

Absil, R., Camby, E., Hertz, A., & Mélot, H. (10 January 2018). A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n-3. Discrete Applied Mathematics, 234, 3-11.
Peer Reviewed verified by ORBi

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.

Mélot, H. (13 February 2017). Prouver les propriétés extrémales d'un graphe. Paper presented at Séminaire jeune, Mons, Belgium.

Siebert, X., Mélot, H., & Hulshof, C. (12 September 2016). Study of the robustness of descriptors for musical instruments classification. Poster session presented at Belgian-Dutch Conference on Machine Learning, BeneLearn, Courtrai, Belgium.

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.

Hulshof, C., Siebert, X., & Mélot, H. (2016). NeoMI: a New Environment for the Organization of Musical Instruments. Paper presented at International Workshop on Folk Music Analysis, Dublin, Ireland.

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.

Hertz, A., & Mélot, H. (20 April 2016). Counting the number of non-equivalent vertex colorings of a graph. Discrete Applied Mathematics, 203, 62-71.
Peer Reviewed verified by ORBi

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.

Mélot, H. (2016). Intervention à propos d'Alpha-Go.

Mélot, H. (2016). Intervention dans un débat sur l'Intelligence Artificielle.

Mélot, H. (2016). Intervention à propos d'Alpha-Go.

Mélot, H., & Hertz, A. (28 May 2015). Minimum number of non-equivalent colorings for graphs with Delta = n - 3. Paper presented at European Chapter on Combinatorial Optimization XXVII, Catane, Sicile, Italy.

Absil, R., & Mélot, H. (05 March 2013). Partial proofs on the price of symmetrisation. Paper presented at GraphDay, Mons, Belgium.

Brinkmann, G., Coolsaet, K., Goedgebeur, J., & Mélot, H. (01 January 2013). House of Graphs: A database of interesting graphs. Discrete Applied Mathematics, 161, 311-314.
Peer Reviewed verified by ORBi

Brinkmann, G., Coolsaet, K., Goedgebeur, J., & Mélot, H. (23 August 2012). An open database of interesting graphs : the House of Graphs. Paper presented at Computers in Scientific Discovery 6, Portoroz, Slovenia.

Absil, R., & Mélot, H. (23 August 2012). Digenes, a new tool using genetic algorithms for directed extremal graph theory. Paper presented at Computers in Scientific Discovery 6, Portoroz, Slovenia.

Brihaye, T., Bruyère, V., & Mélot, H. (2012). Non, les ordinateurs ne seront jamais tout-puissants ! Interstices.

Brinkmann, G., Crevals, S., Mélot, H., Rylands, L., & Steffen, E. (04 June 2012). Alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit. Discrete Mathematics and Theoretical Computer Science, 14 (1), 159-174.
Peer Reviewed verified by ORBi

Brinkmann, G., Coolsaet, K., Goedgebeur, J., & Mélot, H. (31 May 2012). A database of interesting graphs: the House of Graphs. Paper presented at Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization, Munich, Germany.

Bruyère, V., Joret, G., & Mélot, H. (01 March 2012). Trees with Given Stability Number and Minimum Number of Stable Sets. Graphs and Combinatorics, 28 (2), 167-187.
Peer Reviewed verified by ORBi

Brihaye, T., Bruyère, V., & Mélot, H. (01 March 2011). Non, les ordinateurs ne seront jamais tout-puissants! : Magazine Elément 05. Élement: le Magazine de l'Université de Mons, 5.

Mélot, H., & Troestler, C. (01 March 2011). L'ordinateur au coeur de la découverte mathématique. Élement: le Magazine de l'Université de Mons, 5, 29-31.

Bruyère, V., & Mélot, H. (01 May 2009). Fibonacci index and stability number of graphs: a polyhedral study. Journal of Combinatorial Optimization, 18, 207 - 228.
Peer Reviewed verified by ORBi

Bruyère, V., & Mélot, H. (01 August 2008). Turan graphs, stability number, and fibonacci index. Lecture Notes in Computer Science, 5165, 127-138. doi:10.1007/978-3-540-85097-7_12
Peer reviewed

Christophe, J., Dewez, S., Doignon, J. P., Elloumi, S., Fasbender, G., Grégoire, P., Huygens, D., Labbé, M., Mélot, H., & Yaman, H. (03 June 2008). Linear inequalities among graph invariants: using GraPHedron to uncover optimal relationships. Networks, 52, 287-298. doi:10.1002/net.20250
Peer Reviewed verified by ORBi

Mélot, H. (28 May 2008). Facet defining inequalities among graph invariants: the system GraPHedron. Discrete Applied Mathematics, 156, 1875-1891. doi:10.1016/j.dam.2007.09.005
Peer Reviewed verified by ORBi

Cardinal, J., Labbé, M., Langerman, S., Levy, E., & Mélot, H. (07 September 2005). A tight analysis of the maximal matching heuristic. Lecture Notes in Computer Science, 3595, 701-709. doi:10.1007/11533719_71
Peer reviewed

Gutman, I., Hansen, P., & Mélot, H. (09 February 2005). Variable Neighborhood Search for Extremals Graphs 10. Comparison of Irregularity Indices for Chemical Trees. Journal of Chemical Information and Modeling, 45, 222-230. doi:10.1021/ci0342775
Peer Reviewed verified by ORBi

Hansen, P., Mélot, H., & Gutman, I. (01 January 2005). Variable Neighborhood Search for Extremals Graphs 12. A Note on the Variance of Bounded Degrees in Graphs. MATCH Communications in Mathematical and in Computer Chemistry, 54, 221-232.
Peer reviewed

Hansen, P., Aouchiche, M., Caporossi, G., Mélot, H., & Stevanovic, D. (01 January 2005). What Forms Do Interesting Conjectures Have in Graph Theory? Discrete Mathematics and Theoretical Computer Science, 69, 231-252.
Peer Reviewed verified by ORBi

Hansen, P., & Mélot, H. (01 January 2005). Variable Neighborhood Search for Extremal Graphs 9. Bounding the Irregularity of a Graph. Discrete Mathematics and Theoretical Computer Science, 69, 253-264.
Peer Reviewed verified by ORBi

Hansen, P., & Mélot, H. (01 January 2003). Variable Neighborhood Search for Extremals Graphs 6. Analysing Bounds for the Connectivity Index. Journal of Chemical Information and Computer Sciences, 43, 1-14. doi:10.1021/ci010133j
Peer Reviewed verified by ORBi

Hansen, P., & Mélot, H. (15 November 2002). Computers and discovery in algebraic graph theory. Linear Algebra and its Applications, 356, 211-230.

Hansen, P., Mélot, H., & Stevanovic, D. (01 January 2002). Integral Complete Split Graphs. Publikacije Elektrotehnickog Fakulteta Univerziteta u Beogradu, Serija Matematika, 13, 89-95.
Peer reviewed

Contact ORBi