R. G. Downey, V. Estivill-castro, M. R. Fellows, E. Prieto, and F. A. , Cutting Up Is Hard To Do, Electronic Notes in Theoretical Computer Science, vol.78, pp.205-218, 2003.
DOI : 10.1016/S1571-0661(04)81014-4

T. Feder and P. Hell, List Homomorphisms to Reflexive Graphs, Journal of Combinatorial Theory, Series B, vol.72, issue.2, pp.236-250, 1998.
DOI : 10.1006/jctb.1997.1812
URL : http://doi.org/10.1006/jctb.1997.1812

T. Feder, P. Hell, S. Klein, and R. Motwani, Complexity of graph partition problems, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.464-472, 1999.
DOI : 10.1145/301250.301373

J. Flum and M. Grohe, Parameterized Complexity Theory, 2006.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

O. Goldschmidt and D. S. Hochbaum, Polynomial algorithm for the k-cut problem, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.444-451, 1988.
DOI : 10.1109/SFCS.1988.21960

T. Gonzalez, On the computational complexity of clustering and related problems, System Modeling and Optimization, pp.174-182, 1982.
DOI : 10.1007/BFb0006133

M. Hansen and P. Delattre, Complete-Link Cluster Analysis by Graph Coloring, Journal of the American Statistical Association, vol.20, issue.362, pp.397-403, 1978.
DOI : 10.1080/01621459.1969.10500990

M. Koivisto, An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.583-590, 2006.
DOI : 10.1109/FOCS.2006.11

J. Li, L. Behjat, and B. Schiffner, A structure based clustering algorithm with applications to vlsi physical design, Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications, IWSOC '05, pp.270-274, 2005.

S. B. Patkar and H. Narayanan, An efficient practical heuristic for good ratio-cut partitioning, 16th International Conference on VLSI Design, 2003. Proceedings., p.64, 2003.
DOI : 10.1109/ICVD.2003.1183116

H. Saran and V. V. Vazirani, Cuts within Twice the Optimal, SIAM Journal on Computing, vol.24, issue.1, pp.101-108, 1995.
DOI : 10.1137/S0097539792251730

S. E. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.
DOI : 10.1016/j.cosrev.2007.05.001

R. Watrigant, M. Bougeret, R. Giroudeau, and J. König, Sum-max graph partitioning problem, 2012.
DOI : 10.1007/978-3-642-32147-4_27
URL : https://hal.archives-ouvertes.fr/lirmm-00738554

T. A. Wiggerts, Using clustering algorithms in legacy systems remodularization, Proceedings of the Fourth Working Conference on Reverse Engineering, p.33, 1997.
DOI : 10.1109/WCRE.1997.624574