  | Hertz, A., Bonte, S., Devillez, G., Dusollier, V., Mélot, H., & Schindl, D. (01 January 2025). Extremal Chemical Graphs for the Arithmetic-Geometric Index. Match, 93 (3), 791 - 818. doi:10.46793/match.93-3.791H  Peer reviewed |
  | 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 |
 | Meurisse, Q., Koutra, S., Mélot, H., Laplume, D., Becue, V., Brihaye, T., Cenci, J., Coszach, E., De Smet, I., & Rivière, C. (2024). Building functionality assignment in dense and compact blocks using graph theory and game theory [Paper presentation]. Urban Complex Systems 2021, Lyon, France. Editorial reviewed |
 | 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 |
Mélot, H. (22 May 2022). Visualizing and manipulating PHOEG data to explore extremal properties of graphs [Paper presentation]. 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 presentation]. 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 presentation]. 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 presentation]. 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. SHS Web of Conferences. doi:10.1051/shsconf/20208203004 Editorial Reviewed verified by ORBi |
 | 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 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 |
 | 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 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. |
Mélot, H. (13 February 2017). Prouver les propriétés extrémales d'un graphe [Paper presentation]. 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 presentation]. 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 presentation]. 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 presentation]. International Workshop on Folk Music Analysis, Dublin, Ireland. |
 | Devillez, G., Mélot, H., & Hauweele, P. (26 May 2016). PHOEG Helps Obtaining Extremal Graphs [Paper presentation]. 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 presentation]. 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 presentation]. 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 presentation]. 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 presentation]. 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 presentation]. 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 presentation]. 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. Peer reviewed |
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 |
