[1] Mohamed R. Fouad, Khaled Elbassioni, ―A Supermodularity-Based Differential Privacy Preserving Algorithm for Data Anonymization‖, IEEE transaction on Knowledge and Data Engineering July 2014.
[2] M. R. Fouad, K. Elbassioni, and E. Bertino, ―Towards a differentially private data anonymization,‖ Purdue Univ., West Lafayette, IN, USA, Tech. Rep. CERIAS 2012-1, 2012. 
[3] N. Mohammed, R. Chen, B. C. Fung, and P. S. Yu, ―Differentially prívate data release for data mining,‖ in Proc. 17th ACM SIGKDD,New York,NY, USA, 2011, pp. 493–501. 
[4] M. R. Fouad, G. Lebanon, and E. Bertino, ―ARUBA: A risk-utility based algorithm for data disclosure,‖ in Proc. VLDB Workshop SDM, Auckland, New Zealand, 2008, pp. 32–49. 
[5] K. M. Elbassioni, ―Algorithms for dualization over products of partially ordered sets,‖ SIAM J. Discrete Math., vol. 23, no. 1,pp. 487–510, 2009. 
[6] C. Dwork, ―Differential privacy: A survey of results,‖ in Proc. Int.Conf. TAMC, Xiˇ San, China, 2008, pp. 1–19.
 [7] G. Lebanon, M. Scannapieco, M. R. Fouad, and E. Bertino,―Beyond kanonymity:A decision theoretic framework for assessing Privacy risk,‖ in Privacy in Statistical Databases. Springer LNCS 4302:217U 232, 2006. 
[8] C. Dwork, ―Differential privacy,‖ in Proc. ICALP, Venice, Italy,2006, pp.1–12. 
[9] C. C. Aggarwal, ―On k-anonymity and the curse of dimensionality,‖in Proc. Int. Conf. VLDB, Trondheim, Norway, 2005,pp. 901–909.
[10] C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor,―Our data, ourselves: Privacy via distributed noise generation,‖in Proc. 25th EUROCRYPT, Berlin, Germany, 2006, pp. 486–503,LNCS 4004. 
11] A. Frieze, R. Kannan, and N. Polson, ―Sampling from log-concave distributions,‖ Ann. Appl. Probab., vol. 4, no. 3, pp. 812–837, 1994. 
[12] B. C. M. Fung, K. Wang, and P. S. Yu, ―Top-down specialization for information and privacy preservation,‖ in Proc. IEEE ICDE, Washington, DC, USA, 2005, pp. 205–216. 
[13] G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis, ―Fast data anonymization with low information loss,‖ in Proc. Int. Conf.VLDB, Vienna, Austria, 2007, pp. 758– 769. 
[14] G. A. Gratzer, General Lattice Theory, 2nd ed. Basel, Switzerland:Birkh¨auser, 2003. 
[15] M. Grotschel, L. Lovasz, and A. Schrijver, ―Geometric algorithms and combinatorial optimization,‖ in Algorithms and Combinatorics, vol. 2, 2nd ed. Berlin, Germany: Springer, 1993.
[16] J. Cao, P. Karras, P. Kalnis, and K.-L. Tan, ―SABRE: A sensitive attribute bucketization and redistribution framework for t-closeness,‖ J. VLDB, vol. 20, no. 1, pp. 59–81, 2011. 
[17] C. M. Fung, K. Wang, and P. S. Yu, ―Top-down specialization for information and privacy preservation,‖ in Proc. IEEE ICDE, Washington, DC, USA, 2005, pp. 205–216.