C. J. Alpert, J. Huang, and A. B. Kahng, Multilevel circuit partitioning, Proceedings of the ACM/IEEE Design Automation Conference, pp.530-533, 1997.
DOI : 10.1109/dac.1997.597204
URL : http://ballade.cs.ucla.edu:8080/~cheese/papers/multilevelDAC.ps

[. Bichot and J. Alliot, A theoretical approach to defining the European Core Area, Ecole Nationale de l'Aviation Civile / Centre d' ´ Etude de la Navigation Arienne, 2005.

S. Inderjit, Y. Dhillon, B. Guan, and . Kullis, Kernel k-means, Spectral Clustering, and Normalized Cuts, Proceedings of the 10th ACM International Conference on Knowledge Discovery and Data Mining, pp.551-556, 2004.

B. [. Diekmann, R. Monien, and . Preis, Using helpful sets to improve graph bisections, Proceedings of the DIMACS Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, pp.57-73, 1995.

[. Faa, Air Traffic ControL : FAA Order 7110, 65K . Federal Aviation Administration (U.S. Department of Transportation, 1997.

R. [. Fiduccia and . Mattheyses, A linear-time heuristic for improving network partitions, Proceedings of 19th ACM/IEEE Design Automation Conference, pp.175-181, 1982.

M. Garey, D. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, issue.3, pp.237-267, 1976.
DOI : 10.1016/0304-3975(76)90059-1

A. William and . Greene, Genetic algorithms for partitioning sets, International Journal on Artificial Intelligence Tools, vol.10, issue.12, pp.225-241, 2001.

A. Hallgren, Restructuring european airspace: functional airspace blocks. Skyway, pp.20-22, 2005.

B. Hendrickson and R. Leland, The Chaco User's Guide . Sandia National Laboratories, 1995.

B. Hendrickson and R. W. Leland, A multilevel algorithm for partitioning graphs, Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '95, 1995.
DOI : 10.1145/224170.224228

D. S. Johnson, C. R. Aragon, L. A. Mcgeoch, and C. Schevon, Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning, Operations Research, vol.37, issue.6, pp.865-892, 1989.
DOI : 10.1287/opre.37.6.865

C. [. Kirkpatrick, M. P. Gelatt, and . Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

G. Karypis and V. Kumar, METIS : A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill- Reducing Orderings of Sparse Matrices, 1998.

G. Karypis and V. Kumar, Multilevel Algorithms for Multi-Constraint Graph Partitioning, Proceedings of the IEEE/ACM SC98 Conference, pp.1-13, 1998.
DOI : 10.1109/SC.1998.10018

S. [. Kernighan and . Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

P. Kuntz, P. Layzell, and D. Snyers, A colony of ant-like agents for partitioning in vlsi technology, Proceedings of the European Conference on Artificial Life, pp.417-424, 1997.

P. [. Langham and . Grant, A Multilevel k-way Partitioning Algorithm for Finite Element Meshes using Competing Ant Colonies, Proceedings of the ACM Genetic and Evolutionary Computation Conference, pp.1602-1608, 1999.
DOI : 10.1007/3-540-48304-7_82
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.912

J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.22, issue.8, pp.888-905, 2000.

C. [. Soper, M. Walshaw, and . Cross, A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning, Journal of Global Optimization, vol.29, issue.2, pp.225-241, 2004.
DOI : 10.1023/B:JOGO.0000042115.44455.f3

P. [. Talbi and . Bessiere, A parallel genetic algorithm for the graph partitioning problem, Proceedings of the 5th international conference on Supercomputing , ICS '91, pp.312-320, 1991.
DOI : 10.1145/109025.109102
URL : https://hal.archives-ouvertes.fr/hal-00089203

C. Walshaw, The serial JOSTLE library user guide, 2002.