References
- Backstrom, L., Dwork, C., & Kleinberg, J. (2007, March). Wherefore art thou R3579x?: Anonymized social networks, hidden patterns, and structural steganography. In ACM WWW, Seoul, Korea.
- Bao, J., Zheng, Y., & Mokbel, M. F. (2012, November). Location-based and preference-aware recommendation using sparse geo-social networking data. In ACM SIGSPATIAL, Redondo Beach, CA.
- Bhagat, S., Cormode, G., Krishnamurthy, B., & Srivastava, D. (2009). Class-based graph anonymization for social network data. VLDB Endowment. doi:10.14778/1687627.1687714
- Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., & Hwang, D.-U. (2006). Complex networks: Structure and dynamics. Physics Reports, 424, 175–308. doi:10.1016/j.physrep.2005.10.009
- Boldi, P., Bonchi, F., Gionis, A., & Tassa, T. (2012). Injecting uncertainty in graphs for identity obfuscation. VLDB Endowment. doi:10.14778/2350229.2350254
- Cheng, J., Fu, A. W.-C., & Liu, J. (2010, June). K-isomorphism: Privacy preserving network publication against structural attacks. In ACM SIGMOD, Indianapolis, IN.
- Ding, X., Zhang, L., Wan, Z., & Gu, M. (2011, December). De-anonymizing dynamic social networks. In IEEE GLOBECOM, Houston, TX.
- Dyer, M. E., & Frieze, A. M. (1986). Planar 3DM is NP-complete. Journal of Algorithms, 7, 174–184. doi:10.1016/0196-6774(86)90002-7
- Gong, N. Z., & Talwalkar, A. Mackey, L., Huang, L., Shin, E. C. R., Stefanov, E., & Song, D. (2012, August). Jointly predicting links and inferring attributes using a social- attribute network (san). In SNA-KDD, Beijing, China.
- Hay, M., Miklau, G., Jensen, D., Weis, P., & Srivastava, S. (2007). Anonymizing social networks. Computer Science Department Faculty Publication Series, 180.
- Li, Y., & Shen, H. (2013). On identity disclosure control for hypergraph-based data publishing. Ieee Tifs, 8, 1384–1396.
- Liu, C., & Zhang, Z.-K. (2014). Information spreading on dynamic social networks. Cnsns, 19(4), 896–904.
- Liu, K., & Terzi, E. (2008, June). Towards identity anonymization on graphs. In ACM SIGMOD, Vancouver, Canada.
- Rossi, L., Musolesi, M., & Torsello, A. (2015, May). On the k-anonymization of time-varying and multi-layer social graphs. ICWSM, Oxford, UK.
- Skyrms, B., & Pemantle, R. (2009).A dynamic model of social network formation. In T. Gross & H. Sayama (Eds.), Adaptive networks (pp. 231–251). Springer Berlin Heidelberg.
- Tai, C.-H., Yu, P. S., Yang, D.-N., & Chen, M.-S. (2011, August). Privacy-preserving social network publication against friendship attacks. In ACM SIGKDD, San Diego, CA.
- Wang, G., Liu, Q., Li, F., Yang, S., & Wu, J. (2013, April). Outsourcing privacy-preserving social networks to a cloud. In IEEE INFOCOM, Turin, Italy.
- Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of small-worldnetworks. Nature, 393, 440–442.
- Wei, W., Xu, F., Tan, C. C., & Li, Q. (2012, March). Sybildefender: Defend against sybil attacks in large social networks. In IEEE INFOCOM, Orlando, FL.
- Zhang, A., Xie, X., Chang, K.-C.-C., Gunter, C. A., Han, J., & Wang, X. (2014, March). Privacy risk in anonymized heterogeneous information networks. In EDBT, Athens, Greece.
- Zhou, B., & Pei, J. (2008, April). Preserving privacy in social networks against neighborhood attacks. In IEEE ICDE, Cancun, Mexico.
- Zou, L., Chen, L., & Özsu, M. T. (2009). K-automorphism: A general framework for privacy preserving network publication. VLDB Endowment. doi:10.14778/1687627.1687734