N. Bansal, A. Blum, and S. Chawla, Correlation clustering, Machine Learning, pp.89-113, 2004.

A. Bar-noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir, On Chromatic Sums and Distributed Resource Allocation, Information and Computation, vol.140, issue.2, pp.183-202, 1998.
DOI : 10.1006/inco.1997.2677
URL : http://doi.org/10.1006/inco.1997.2677

S. Böcker and P. Damaschke, Even faster parameterized cluster deletion and cluster editing, Information Processing Letters, vol.111, issue.14, pp.717-721, 2011.
DOI : 10.1016/j.ipl.2011.05.003

F. Bonomo and M. Valencia-pabon, On the Minimum Sum Coloring of P 4-Sparse Graphs, Graphs and Combinatorics, vol.29, issue.1, pp.293-298, 2009.
DOI : 10.1007/s00373-012-1269-5

F. Bonomo and M. Valencia-pabon, On the Minimum Sum Coloring of P 4 -sparse graphs. Graphs and Combinatorics, pp.303-314, 2014.

Y. Gao, D. R. Hare, and J. Nastos, The cluster deletion problem for cographs, Discrete Mathematics, vol.313, issue.23, pp.2763-2771, 2013.
DOI : 10.1016/j.disc.2013.08.017

M. M. Halldórsson, G. Kortsarz, and H. Shachnai, Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs, Algorithmica, vol.37, issue.3, pp.187-209, 2003.
DOI : 10.1007/s00453-003-1031-8

K. Jansen, Approximation results for the optimum cost chromatic partition problem, Proc. 24th ICALP, pp.727-737, 1997.
DOI : 10.1007/3-540-63165-8_226

B. Jamison and S. Olariu, -Reducible Graphs-Class of Uniquely Tree-Representable Graphs, Studies in Applied Mathematics, vol.18, issue.1, pp.35-39, 1984.
DOI : 10.1002/sapm198981179
URL : https://hal.archives-ouvertes.fr/in2p3-00529133

B. Jamison and S. Olariu, Recognizing $P_4 $-Sparse Graphs in Linear Time, SIAM Journal on Computing, vol.21, issue.2, pp.381-406, 1992.
DOI : 10.1137/0221027

B. Jamison and S. Olariu, A tree representation for P4-sparse graphs, Discrete Applied Mathematics, vol.35, issue.2, pp.115-129, 1992.
DOI : 10.1016/0166-218X(92)90036-A

C. Komusiewicz and J. Uhlmann, Cluster editing with locally bounded modifications, Discrete Applied Mathematics, vol.160, issue.15, pp.2259-2270, 2012.
DOI : 10.1016/j.dam.2012.05.019

E. Kubicka and A. J. Schwenk, An introduction to chromatic sums, Proceedings of the seventeenth annual ACM conference on Computer science : Computing trends in the 1990's Computing trends in the 1990's, CSC '89, pp.39-45, 1989.
DOI : 10.1145/75427.75430

R. Shamir, R. Sharan, and D. Tsur, Cluster graph modification problems, Discrete Applied Mathematics, vol.144, issue.1-2, pp.173-182, 2004.
DOI : 10.1016/j.dam.2004.01.007
URL : http://doi.org/10.1016/j.dam.2004.01.007

T. Szkaliczki, Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete, SIAM Journal on Computing, vol.29, issue.1, pp.274-287, 1999.
DOI : 10.1137/S0097539796303123