Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Hadrien Mélot
Observed names:
Hadrien Melot,
Melot, Hadrien,
Mélot, Hadrien
Institution:
University of Mons
Observed institutions:
HEC Montréal,
University of Mons,
Université Libre de Bruxelles,
University of Kragujevac,
Ghent University,
Group for Research in Decision Analysis
show all 6
ORCID:
0000-0003-4805-1352
Observed ORCID:
0000-0003-4805-1352
OpenAlex ID:
A5080198162
House of Graphs: A database of interesting graphs
2012
·
Gunnar Brinkmann
, Kris Coolsaet
, et al.
·
Discrete Applied Mathematics
·
219
Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees
2005
·
Ivan Gutman
, Pierre Hansen
, et al.
·
Journal of Chemical Information and Modeling
·
104
Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph
2007
·
Pierre Hansen
, Hadrien Mélot
·
DIMACS series in discrete mathematics and theoretical computer science
·
88
PDF
Variable Neighborhood Search for Extremal Graphs. 6. Analyzing Bounds for the Connectivity Index
2002
·
Pierre Hansen
, Hadrien Mélot
·
Journal of Chemical Information and Computer Sciences
·
62
Facet defining inequalities among graph invariants: The system GraPHedron
2007
·
Hadrien Mélot
·
Discrete Applied Mathematics
·
49
PDF
Integral complete split graphs
2002
·
Pierre Hansen
, Hadrien Melot
, et al.
·
Publikacija Elektrotehnickog fakulteta - serija matematika
·
23
PDF
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
2008
·
Julie Christophe
, Sophie Dewez
, et al.
·
Networks
·
20
PDF
A Tight Analysis of the Maximal Matching Heuristic
2005
·
Jean Cardinal
, Martine Labbé
, et al.
·
Lecture notes in computer science
·
20
PDF
Computers and discovery in algebraic graph theory
2002
·
Pierre Hansen
, Hadrien Mélot
·
Linear Algebra and its Applications
·
19
PDF
Maximum eccentric connectivity index for graphs with given diameter
2019
·
Pierre Hauweele
, Alain Hertz
, et al.
·
Discrete Applied Mathematics
·
16
PHOEG Helps to Obtain Extremal Graphsch:32
2019
·
Gauvain Devillez
, Pierre Hauweele
, et al.
·
Operations research proceedings
·
15
What forms do interesting conjectures have in graph theory?
2007
·
Pierre Hansen
, Mustapha Aouchiche
, et al.
·
DIMACS series in discrete mathematics and theoretical computer science
·
15
PDF
Counting the number of non-equivalent vertex colorings of a graph
2015
·
Alain Hertz
, Hadrien Mélot
·
Discrete Applied Mathematics
·
13
PDF
Fibonacci index and stability number of graphs: a polyhedral study
2009
·
Véronique Bruyère
, Hadrien Mélot
·
Journal of Combinatorial Optimization
·
12
PDF
Variable Neighborhood Search for Extremals Graphs 12. A Note on the Variance of Bounded Degrees in Graphs
2005
·
Hansen, P.
, Mélot, Hadrien
, et al.
·
ORBi UMONS
·
10
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices
2019
·
Gauvain Devillez
, Alain Hertz
, et al.
·
Yugoslav journal of operations research
·
9
PDF
A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n−3
2016
·
Romain Absil
, Eglantine Camby
, et al.
·
Discrete Applied Mathematics
·
7
PDF
Trees with Given Stability Number and Minimum Number of Stable Sets
2011
·
Véronique Bruyère
, Gwenaël Joret
, et al.
·
Graphs and Combinatorics
·
7
PDF
The average size of maximal matchings in graphs
2024
·
Alain Hertz
, Sébastien Bonte
, et al.
·
Journal of Combinatorial Optimization
·
5
PDF
Extremal Chemical Graphs for the Arithmetic-Geometric Index
2024
·
Alain Hertz
, Sébastien Bonte
, et al.
·
match Communications in Mathematical and in Computer Chemistry
·
5
PDF
Cognitive flexibility and attentional patterns among trauma survivors: preliminary evidence from an eye-tracking study
2022
·
Wivine Blekic
, Nellia Bellaert
, et al.
·
European Journal of Psychotraumatology
·
5
Using Graph Theory to Derive Inequalities for the Bell Numbers
2021
·
Hertz, Alain
, Hertz, Anaelle
, et al.
·
arXiv (Cornell University)
·
5
PDF
Digenes: genetic algorithms to discover conjectures about directed and undirected graphs
2013
·
Absil, Romain
, Mélot, Hadrien
·
arXiv (Cornell University)
·
5
PDF
Turán Graphs, Stability Number, and Fibonacci Index
2008
·
Véronique Bruyère
, Hadrien Mélot
·
Lecture notes in computer science
·
5
PDF
alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit
2012
·
Gunnar Brinkmann
, Simon Crevals
, et al.
·
Discrete Mathematics & Theoretical Computer Science
·
4
PDF
Show more works
View as search
Works count:
70
Citation count:
767
H-index:
13
I10-index:
15
Year
Topic
Type