Z. , Extraction et partitionnement pour la recherche de régularités : Applicationà l'analyse de dialogues, 2014.

Z. Ales and A. Knippel, An extended edge-representative formulation for the k-partitioning problem, Electron. Notes Discr. Math, vol.52, pp.333-342, 2016.

Z. Ales, A. Knippel, and A. Pauchet, On the polyhedron of the k-partitioning problem with representative variables, 2014.

Z. Ales, A. Knippel, and A. Pauchet, Polyhedral combinatorics of the kpartitioning problem with representative variables, Discr. Appl. Math, vol.211, pp.1-14, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01759687

Z. Ales, A. Pauchet, and A. Knippel, Extraction de motifs dialogiques bidimensionnels, vol.29, pp.655-684, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00989237

Z. Ales, A. Pauchet, and A. Knippel, Extraction and clustering of twodimensional dialogue patterns, Int. J. Artificial Intelligence Tools, vol.27, p.1850001, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01944000

F. Barahona and A. Mahjoub, On the cut polytope, Math. Program, vol.36, pp.157-173, 1986.

P. Berkhin, A survey of clustering data mining techniques, Springer, Pavel Berkhin, Accrue Software, 1045 Forest Knoll Dr, pp.25-71, 2006.

P. Bonami, V. Nguyen, M. Klein, and M. Minoux, On the solution of a graph partitioning problem under capacity constraints, Lecture Notes in Computer Science, vol.7422, pp.285-296, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01272895

M. Boulle, Compact mathematical formulation for graph partitioning, Optim. Eng, vol.5, pp.315-333, 2004.

M. Campêlo, V. Campos, and R. Corrêa, On the asymmetric representatives formulation for the vertex coloring problem, Discr. Appl. Math, vol.156, pp.1097-1111, 2008.

S. Chopra and M. Rao, The partition problem, Math. Program, vol.59, pp.87-115, 1993.

S. Chopra and M. Rao, Facets of the k-partition polytope, Discr. Appl. Math, vol.61, pp.27-48, 1995.

G. Dahl and T. Flatberg, An Integer Programming Approach to Image Segmentation and Reconstruction Problems pp, pp.475-496, 2007.

M. Deza, M. Grötschel, and M. Laurent, Clique-web facets for multicut polytopes, Math. Oper. Res, vol.17, pp.981-1000, 1992.

N. Fan and P. Pardalos, Linear and quadratic programming approaches for the general graph partitioning problem, J. Global Optim, vol.48, pp.57-71, 2010.

N. Fan, Q. Zheng, and P. Pardalos, Robust optimization of graph partitioning involving interval uncertainty, Theor. Comput. Sci, vol.447, pp.53-61, 2012.

C. Ferreira, A. Martin, C. Souza, R. Weismantel, and L. Wolsey, Formulations and valid inequalities for the node capacitated graph partitioning problem, Math. Program, vol.74, pp.247-266, 1996.

C. Ferreira, A. Martin, C. Souza, R. Weismantel, and L. Wolsey, The node capacitated graph partitioning problem: A computational study, Math. Program, vol.81, pp.229-256, 1998.

M. Garey, D. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci, vol.1, pp.237-267, 1976.

O. Goldschmidt and D. Hochbaum, A polynomial algorithm for the k-cut problem for fixed k, Math. Oper. Res, vol.19, pp.24-37, 1994.

M. Grötschel and Y. Wakabayashi, A cutting plane algorithm for a clustering problem, Math. Program, vol.45, pp.59-96, 1989.

M. Grötschel and Y. Wakabayashi, Facets of the clique partitioning polytope, Math. Program, vol.47, pp.367-387, 1990.

P. Hansen and B. Jaumard, Cluster analysis and mathematical programming, Math. Program, vol.79, pp.191-215, 1997.

B. Hendrickson and R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput, vol.16, pp.452-469, 1995.

A. Jain, Data clustering: 50 years beyond k-means, Pattern Recognition Lett, vol.31, pp.651-666, 2010.

E. Johnson, A. Mehrotra, and G. Nemhauser, Min-cut clustering, Math. Program, vol.62, pp.133-151, 1993.

V. Kaibel, M. Peinhardt, and M. Pfetsch, Orbitopal fixing, Discr. Optim, vol.8, pp.595-610, 2011.

B. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell System Tech, J, vol.49, pp.291-307, 1970.

S. Khuller and B. Saha, On finding dense subgraphs, Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I, pp.597-608, 2009.

M. Labbé and F. Özsoy, Size-constrained graph partitioning polytopes, Discr. Math, vol.310, pp.3473-3493, 2010.

H. Li and C. Shen, Interactive color image segmentation with linear programming, Machine Vision Appl, vol.21, pp.403-412, 2010.

F. Liers, Contributions to determining exact ground-states of Ising spin-glasses and to their physics, 2004.

F. Liers, M. Jünger, G. Reinelt, and G. Rinaldi, Computing exact ground states of hard Ising spin glass problems by branch-and-cut, New Optimization Algorithms in Physics, pp.47-69, 2004.

A. Lisser and F. Rendl, Graph partitioning using linear and semidefinite programming, Math. Program, vol.95, pp.91-101, 2003.

J. Mitchell, Branch-and-cut for the k-way equipartition problem, Mathematical Sciences, 2001.

M. Oosten, J. Rutten, and F. Spieksma, The clique partitioning problem: Facets and patching facets, Networks, vol.38, pp.209-226, 2001.

G. Reinelt, TSPLIB -A traveling salesman problem library, pp.376-384, 1991.

M. Sørensen, b-tree facets for the simple graph partitioning polytope, J. Combinatorial Optim, vol.8, pp.151-170, 2004.

M. Sørensen, Facet-defining inequalities for the simple graph partitioning polytope, Discr. Optim, vol.4, pp.221-231, 2007.

C. Walshaw, M. Cross, and M. Everett, Parallel dynamic graph partitioning for adaptive unstructured meshes, J. Parallel Distrib. Comput, vol.47, pp.102-108, 1997.