AutoGraphiX: a survey

Aouchiche, M., J. M. Bonnefoy, A. Fidahoussen, G. Caporossi, P. Hansen, L. Hiesse, J. Lacheré, A. Monhait, Variable neighborhood search for extremal graphs 14: the AutoGraphiX 2 system, in L. Liberti and N. Maculan (editors) "Global optimization: from theory to implementation", Springer (2005), to appear

Aouchiche, M., G. Caporossi, P. Hansen, Automated comparison of graph invariants, submitted

Aouchiche, 2001, Variable neighborhood search for extremal graphs 8. Variations on graffiti 105, Congressus Numerantium, 148, 129

Aouchiche, M., P. Hansen, Automated results and conjectures on average distance in graphs, submitted

Aouchiche, M., P. Hansen, Recherche à voisinage variable de graphes extrémaux 13. À propos de la maille, submitted

Belhaiza, 2005, Variable neighborhood search for extremal graphs 11. Bounds on algebraic connectivity, 1

Caporossi, 1999, Variable neighborhood search for extremal graphs 2. Finding graphs with extremal energy, Journal of Chemical Information and Computer Sciences, 39, 984, 10.1021/ci9801419

Caporossi, 1999, Trees with palindromic Hosoya polynomials, 37, 10

Caporossi, 1999, Variable neighborhood search for extremal graphs 4. Chemical trees with extremal connectivity index, Computers and Chemistry, 23, 469, 10.1016/S0097-8485(99)00031-5

Caporossi, 2003, Graphs with maximum connectivity index, Computational Biology and Chemistry, 27, 85, 10.1016/S0097-8485(02)00016-5

Caporossi, 2000, Variable neighborhood search for extremal graphs 1. The AutoGraphiX system, Discrete Math, 212, 29, 10.1016/S0012-365X(99)00206-X

Caporossi, 2004, Variable neighborhood search for extremal graphs 5. Three ways to automate finding conjectures, Discrete Mathematics, 276, 81, 10.1016/S0012-365X(03)00311-X

Cvetković, 2001, Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees, Linear and Multilinear Algebra, 49, 143, 10.1080/03081080108818690

Fajtlowicz, 1988, On conjectures of graffiti, Discrete Mathematics, 72, 113, 10.1016/0012-365X(88)90199-9

Fajtlowicz, S., Written on the Wall, version 09-2000

Fajtlowicz, S., P. Fowler, P. Hansen, M. Janowitz, F. Roberts (editors), "Graphs and discovery", DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, forthcoming, 2005

Fowler, 2001, Variable neighborhood search for extremal graphs 7. Polyenes with maximum HOMO-LUMO gap, Chemical Physics Letters, 342, 105, 10.1016/S0009-2614(01)00570-X

Gutman, 2005, Variable neighborhood search for extremal graph 10. Comparison of irregularity indices for chemical trees, Journal of Chemical Information and Modelling, 45, 222, 10.1021/ci0342775

Gutman, 1999, Alkanes with small and large Randić connectivity indices, Chemical Physics Letters, 306, 366, 10.1016/S0009-2614(99)00472-8

Hansen, 2002, Computers in graph theory, 53, 20

Hansen, P., How far is, should and could be conjecture-making in graph theory an automated process?, in [16]

Hansen, P., M. Aouchiche, G. Caporossi, H. Mélot, D. Stevanović, What forms do interesting conjectures have in graph theory?, in [16]

Hansen, P., H. Mélot, Variable neighborhood search for extremal graphs 9. Bounding the irregularity of a graph, in [16]

Hansen, 2003, Variable neighborhood search for extremal graphs 6. Analyzing bounds for the connectivity index, Journal of Chemical Information and Computer Sciences, 43, 1, 10.1021/ci010133j

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

Hansen, 2001, Variable neighborhood search: Principles and applications, European Journal Operational Research, 130, 449, 10.1016/S0377-2217(00)00100-4

Hansen, P., D. Stevanović, Variable neighborhood search for extremal graphs 15. On bags and bugs, submitted

Mladenović, 1997, Variable neighborhood search, Computers and Operations Research, 24, 1097, 10.1016/S0305-0548(97)00031-2