House of Graphs: a database of interesting graphs G Brinkmann, K Coolsaet, J Goedgebeur, H Mélot Discrete Applied Mathematics 161 (1-2), 311-314, 2013 | 173 | 2013 |

Variable neighborhood search for extremal graphs. 10. Comparison of irregularity indices for chemical trees I Gutman, P Hansen, H Mélot Journal of chemical information and modeling 45 (2), 222-230, 2005 | 126 | 2005 |

Variable neighborhood search for extremal graphs. 6. Analyzing bounds for the connectivity index P Hansen, H Mélot Journal of chemical information and computer sciences 43 (1), 1-14, 2003 | 86 | 2003 |

Variable neighborhood search for extremal graphs 9: Bounding the irregularity of a graph P Hansen, H Mélot Groupe d'études et de recherche en analyse des décisions, 2002 | 84 | 2002 |

Facet defining inequalities among graph invariants: the system GraPHedron H Mélot Discrete Applied Mathematics 156 (10), 1875-1891, 2008 | 43 | 2008 |

Variable neighborhood search for extremal graphs 12. A note on the variance of bounded degrees in graphs P Hansen, H Mélot, I Gutman Match, 2005 | 35 | 2005 |

A tight analysis of the maximal matching heuristic J Cardinal, M Labbé, S Langerman, E Levy, H Mélot International Computing and Combinatorics Conference, 701-709, 2005 | 26 | 2005 |

Linear inequalities among graph invariants: Using *GraPHedron* to uncover optimal relationshipsJ Christophe, S Dewez, JP Doignon, G Fasbender, P Grégoire, ... Networks: An International Journal 52 (4), 287-298, 2008 | 23 | 2008 |

Integral complete split graphs P Hansen, H Mélot, D Stevanović Publikacije Elektrotehničkog fakulteta. Serija Matematika, 89-95, 2002 | 23 | 2002 |

Computers and discovery in algebraic graph theory P Hansen, H Mélot Linear algebra and its applications 356 (1-3), 211-230, 2002 | 20 | 2002 |

What forms do interesting conjectures have in graph theory? P Hansen, M Aouchiche, G Caporossi, H Mélot, D Stevanovic Dimacs series in discrete mathematics and theoretical computer science 69, 231, 2005 | 18 | 2005 |

Fibonacci index and stability number of graphs: a polyhedral study V Bruyère, H Mélot Journal of combinatorial optimization 18 (3), 207, 2009 | 8 | 2009 |

Counting the number of non-equivalent vertex colorings of a graph A Hertz, H Mélot Discrete Applied Mathematics 203, 62-71, 2016 | 7 | 2016 |

α-labelings and the structure of trees with nonzero α-deficit G Brinkmann, S Crevals, H Mélot, L Rylands, E Steffen Discrete Mathematics and Theoretical Computer Science 14 (1), 159-174, 2012 | 6 | 2012 |

Turán graphs, stability number, and Fibonacci index V Bruyere, H Mélot International Conference on Combinatorial Optimization and Applications, 127-138, 2008 | 5 | 2008 |

Digenes: genetic algorithms to discover conjectures about directed and undirected graphs R Absil, H Mélot arXiv preprint arXiv:1304.7993, 2013 | 4 | 2013 |

Trees with given stability number and minimum number of stable sets V Bruyère, G Joret, H Mélot Graphs and combinatorics 28 (2), 167-187, 2012 | 4 | 2012 |

On automated and computer aided conjectures in graph theory H Mélot Science (specialization Computer Science), 2006 | 4 | 2006 |

Variable neighborhood search for extremal graphs 28: Autographix after fifteen years M Aouchiche, G Caporossi, P Hansen, C Lucas GERAD, HEC Montréal, 2013 | 3 | 2013 |

Maximum eccentric connectivity index for graphs with given diameter P Hauweele, A Hertz, H Mélot, B Ries, G Devillez Discrete Applied Mathematics 268, 102-111, 2019 | 2 | 2019 |