http://publicationslist.org/data/hadrien.melot/atom.xmlHadrien Mélot's Publications List
Hadrien Mélothttp://publicationslist.org/hadrien.melot$basepathfavicon.icoRecent additions to Hadrien Mélot's PublicationsList.org pagehttp://publicationslist.org/publications.png2008-03-14T10:50:11Z
http://publicationslist.org/hadrien.melot/refid8
2008-03-14T10:50:03Z
Linear inequalities among graph invariants : using GraPHedron to uncover optimal relationships
Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Sourour Elloumi, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Hadrien Mélot, Hande Yaman (2008) <i>Networks (Accepted for publication)</i> : <br/>
http://publicationslist.org/hadrien.melot/refid6
2007-10-24T15:21:36Z
Facet defining inequalities among graph invariants : the system GraPHedron
Hadrien Mélot (2007) <i>Discrete Applied Mathematics (Accepted for publication)</i> : <br/>
http://publicationslist.org/hadrien.melot/refid1
2007-09-02T09:23:23Z
On Automated and Computer Aided Conjectures in Graph Theory
Hadrien Mélot (2006) <br/>
http://publicationslist.org/hadrien.melot/refid2
2007-09-02T09:21:00Z
Variable Neighborhood Search for Extremal Graphs 10. Comparison of Irregularity Indices for Chemical Trees
Ivan Gutman, Pierre Hansen, Hadrien Mélot (2005) <i>J. Chem. Inf. Mod.</i> 45: 222-230<br/>
http://publicationslist.org/hadrien.melot/refid3
2007-09-02T09:21:15Z
Variable Neighborhood Search for Extremal Graphs 12. A Note on the Variance of Bounded Degrees in Graphs
Pierre Hansen, Hadrien Mélot, Ivan Gutman (2005) <i>MATCH Comm. Math. Comp. Chem.</i> 54: 221-232<br/>
http://publicationslist.org/hadrien.melot/refid5
2007-09-02T09:22:20Z
Variable Neighborhood Search for Extremal Graphs 9. Bounding the Irregularity of a Graph
Pierre Hansen, Hadrien Mélot (2005) <i>Graphs and Discovery</i> 253-264<br/>
http://publicationslist.org/hadrien.melot/refid7
2007-09-02T09:22:44Z
A Tight Analysis of the Maximal Matching Heuristic
Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot (2005) <i>Computing and Combinatorics : 11th Annual International Conference, COCOON 2005</i> 701-709<br/>
http://publicationslist.org/hadrien.melot/refid11
2007-09-02T09:23:09Z
What Forms Do Interesting Conjectures Have in Graph Theory?
Pierre Hansen, Mustapha Aouchiche, Gilles Caporossi, Hadrien Mélot, Dragan Stevanović (2005) <i>Graphs and Discovery</i> 231-252<br/>
http://publicationslist.org/hadrien.melot/refid4
2007-10-24T15:16:33Z
Variable Neighborhood Search for Extremal Graphs 6. Analysing Bounds for the Connectivity Index
Pierre Hansen, Hadrien Mélot (2003) <i>J. Chem. Inf. Comput. Sci.</i> 43: 1-14<br/>
http://publicationslist.org/hadrien.melot/refid10
2007-09-02T09:22:06Z
Computers and Discovery in Algebraic Graph Theory
Pierre Hansen, Hadrien Mélot (2002) <i>Linear Algebra and its Applications</i> 356: 211-230<br/>
http://publicationslist.org/hadrien.melot/refid9
2007-09-02T09:21:47Z
Integral Complete Split Graphs
Pierre Hansen, Hadrien Mélot, Dragan Stevanović (2002) <i>Univ. Beograd Publ. Elektrotehn. Fak. Ser. Mat.</i> 13: 89-95<br/>