Hadrien Mélot
Hadrien Mélot
Dirección de correo verificada de umons.ac.be
Título
Citado por
Citado por
Año
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
1762013
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
1242005
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
882003
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
852002
Facet defining inequalities among graph invariants: the system GraPHedron
H Mélot
Discrete Applied Mathematics 156 (10), 1875-1891, 2008
432008
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 Commun. Math. Comput. Chem 54, 221-232, 2005
352005
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
262005
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
J Christophe, S Dewez, JP Doignon, G Fasbender, P Grégoire, ...
Networks: An International Journal 52 (4), 287-298, 2008
232008
Integral complete split graphs
P Hansen, H Mélot, D Stevanović
Publikacije Elektrotehničkog fakulteta. Serija Matematika, 89-95, 2002
222002
Computers and discovery in algebraic graph theory
P Hansen, H Mélot
Linear algebra and its applications 356 (1-3), 211-230, 2002
212002
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
202005
Counting the number of non-equivalent vertex colorings of a graph
A Hertz, H Mélot
Discrete Applied Mathematics 203, 62-71, 2016
82016
Fibonacci index and stability number of graphs: a polyhedral study
V Bruyère, H Mélot
Journal of combinatorial optimization 18 (3), 207, 2009
82009
α-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
62012
Turán graphs, stability number, and Fibonacci index
V Bruyere, H Mélot
International Conference on Combinatorial Optimization and Applications, 127-138, 2008
52008
Digenes: genetic algorithms to discover conjectures about directed and undirected graphs
R Absil, H Mélot
arXiv preprint arXiv:1304.7993, 2013
42013
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
42012
On automated and computer aided conjectures in graph theory
H Mélot
Science (specialization Computer Science), 2006
42006
A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n− 3
R Absil, E Camby, A Hertz, H Melot
Discrete applied mathematics 234, 3-11, 2018
32018
Variable neighborhood search for extremal graphs 28: Autographix after fifteen years
M Aouchiche, G Caporossi, P Hansen, C Lucas
GERAD, HEC Montréal, 2013
32013
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20