L. A. Adamic and N. Glance, The political blogosphere and the 2004 US election: divided they blog, LinkKDD '05, pp.36-43, 2005.

L. Backstrom, C. Dwork, and J. Kleinberg, Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography In: WWW '07, pp.181-190, 2007.

S. Bhagat, G. Cormode, B. Krishnamurthy, and D. Srivastava, Class-based graph anonymization for social network data, VLDB '09, vol.2, pp.766-777, 2009.

R. Bredereck, V. Froese, M. Koseler, M. G. Millani, A. Nichterlein et al., A Parameterized algorithmics framework for degree sequence completion problems in directed graphs, Proceedings of the 11th international symposium on parameterized and exact computation (IPEC '16). Schloss Dagstuhl-Leibniz-Zentrum fr Informatik, vol.10, p.14, 2017.

R. Bredereck, V. Froese, M. Koseler, M. G. Millani, A. Nichterlein et al., A parameterized algorithmics framework for digraph degree sequence completion problems, 2018.

B. J. Cai, H. Y. Wang, H. R. Zheng, and H. Wang, Evaluation repeated random walks in community detection of social networks In: ICMLC'10, IEEE, pp.1849-1854, 2010.

J. Casas-roma, J. Herrera-joancomartí, and V. Torra, An algorithm for k-degree anonymity on large networks, ASONAM '13. IEEE, pp.671-675, 2013.

J. Casas-roma, J. Herrera-joancomartí, and V. Torra, Anonymizing graphs: measuring quality for clustering, Knowl Inf Syst, vol.44, issue.3, pp.507-528, 2015.

J. Casas-roma, An evaluation of edge modification techniques for privacy-preserving on graphs, MDAI '15, pp.180-191, 2015.

J. Casas-roma, J. Herrera-joancomartí, and V. Torra, ) k-Degree anonymity and edge selection: improving data utility in large networks, Knowl Inf Syst, vol.50, issue.2, pp.447-474, 2017.

S. Chester, B. M. Kapron, G. Ramesh, G. Srivastava, A. Thomo et al., Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes, Soc Netw Anal Min, vol.3, issue.3, pp.381-399, 2013.

K. L. Clarkson, K. Liu, and E. Terzi, Towards identity anonymization in social networks, Link mining: models, algorithms, and applications, pp.359-385, 2010.

G. Cormode, D. Srivastava, T. Yu, and Q. Zhang, Anonymizing bipartite graph data using safe groupings, VLDB J, vol.19, issue.1, pp.115-139, 2010.

S. Das, Ö. Egecioglu, and A. Abbadi, Anonymizing weighted social network graphs In: ICDE '10, pp.904-907, 2010.

J. Domingo-ferrer and V. Torra, Ordinal, continuous and heterogeneous k-anonymity through microaggregation, Data Min Knowl Discov, vol.11, issue.2, pp.195-212, 2005.

J. Domingo-ferrer, M. -. Sanz, and J. M. , Practical data-oriented microaggregation for statistical disclosure control, IEEE Trans Knowl Data Eng, vol.14, issue.1, pp.189-201, 2002.

F. Ferri, P. Grifoni, and T. Guzzo, New forms of social and professional digital relationships: the case of Facebook, Soc Netw Anal Min, vol.2, issue.2, pp.121-137, 2011.

S. Hanhijärvi, G. C. Garriga, and K. Puolamäki, Randomization techniques for graphs, SDM '09, pp.780-791, 2009.

S. L. Hansen and S. Mukherjee, A polynomial algorithm for optimal univariate microaggregation, IEEE Trans Knowl Data Eng, vol.15, issue.4, pp.1043-1044, 2003.

S. Hartung, C. Hoffmann, and A. Nichterlein, Improved upper and lower bound heuristics for degree anonymization in social networks, SEA'14, pp.376-387, 2014.

S. Hartung, A. Nichterlein, R. Niedermeier, and O. Suchý, A refined complexity analysis of degree anonymization in graphs, Inf Comput, vol.243, pp.249-262, 2015.

M. Hay, G. Miklau, D. Jensen, D. Towsley, and P. Weis, Resisting structural re-identification in anonymized social networks In: VLDB '08, vol.1, pp.102-114, 2008.

L. Liu, J. Wang, J. Liu, and J. Zhang, Privacy preservation in social networks with sensitive edge weights, SDM '09, pp.954-965, 2009.

K. Liu and E. Terzi, Towards identity anonymization on graphs, SIGMOD '08, pp.93-106, 2008.

M. Ley, The DBLP computer science bibliography: evolution, research issues, perspectives, SPIRE 2002, pp.1-10, 2002.

J. Leskovec, D. Huttenlocher, and J. Kleinberg, Predicting positive and negative links in online social networks, WWW '10, pp.641-650, 2010.

X. Lu, Y. Song, and S. Bressan, Fast identity anonymization on graphs, DEXA '12, pp.281-295, 2012.

T. Opsahl and P. Panzarasa, Clustering in weighted networks, Soc Netw, vol.31, issue.2, pp.155-163, 2009.

P. Pons and M. Latapy, Computing communities in large networks using random walks, Lecture notes in computer science, vol.3733, pp.284-293, 2005.

M. Richardson, R. Agrawal, and P. Domingos, Trust management for the semantic web, ISWC, pp.351-368, 2003.

L. Rossi, M. Musolesi, and A. Torsello, On the k-anonymization of time-varying and multi-layer social graphs, ICWSM, pp.377-386, 2015.

M. Rosvall and C. T. Bergstrom, Maps of random walks on complex networks reveal community structure, Proc Natl Acad Sci, vol.105, issue.4, pp.1118-1123, 2008.

J. Salas and V. Torra, Improving the characterization of P-stability for applications in network privacy, Discrete Appl Math, vol.206, pp.109-114, 2016.

J. Salas, Faster univariate microaggregation for power law distributions: k-degree-anonymity for big graphs In: ICDM workshop on privacy and discrimination in data mining, IEEE, 2016.

P. Samarati, Protecting respondents identities in microdata release, IEEE Trans Knowl Data Eng, vol.13, issue.6, pp.1010-1027, 2001.

L. Sweeney, 2002) k-anonymity: a model for protecting privacy, Int J Uncertain Fuzziness Knowl Based Syst, vol.10, issue.5, pp.557-570

L. Takac and M. Zabovsky, Data analysis in public social networks in international scientific conference and international workshop present day trends of innovations, pp.1-6, 2012.

B. Zhou and J. Pei, Preserving privacy in social networks against neighborhood attacks in ICDE '08, pp.506-515, 2008.

B. Zhou and J. Pei, The k-anonymity and-diversity approaches for privacy preservation in social networks against neighborhood attacks, Knowl Inf Syst, vol.28, issue.1, pp.47-77, 2011.

L. Zou, L. Chen, and M. T. Özsu, K-Automorphism: a general framework for privacy preserving network publication, VLDB '09, vol.2, pp.946-957, 2009.

, Multimedia and Telecommunications of the Universitat Oberta de Catalunya, director of the Master on Data Science, part-time associate professor at Universitat Autònoma de Barcelona and researcher at KISON group. He received his M.Sc. in Artificial Intelligence from Universidad Nacional de Educación a Distancia and his Ph.D. in Computer Science from the Universitat Autònoma de Barcelona. His current research interests are focused on data mining, machine learning and data privacy, Jordi Casas-Roma is currently a lecturer at the Faculty of Computer Science