Author of the publication

Efficient Approximation Algorithms for Minimum Dominating Sets in Social Networks.

, , and . IJSSMET, 9 (2): 1-32 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

User-controlled generalization boundaries for p-sensitive k-anonymity., , and . SAC, page 1103-1104. ACM, (2010)Assessing global disclosure risk in masked microdata., , and . WPES, page 85-93. ACM, (2004)On-the-Fly Generalization Hierarchies for Numerical Attributes Revisited., , and . Secure Data Management, volume 6933 of Lecture Notes in Computer Science, page 18-32. Springer, (2011)Finding anomalies in windows event logs using standard deviation., and . CollaborateCom, page 563-570. ICST / IEEE, (2013)A privacy preserving efficient protocol for semantic similarity join using long string attributes., , and . PAIS, page 6. ACM, (2011)Disclosure risk measures for the sampling disclosure control method., , and . SAC, page 301-306. ACM, (2004)Generating Microdata with P -Sensitive K -Anonymity Property., , and . Secure Data Management, volume 4721 of Lecture Notes in Computer Science, page 124-141. Springer, (2007)Fighting fake news spread in online social networks: Actual trends and future research directions., , and . IEEE BigData, page 4453-4457. IEEE Computer Society, (2017)Efficient approximation algorithms to determine minimum partial dominating sets in social networks., , and . IEEE BigData, page 2390-2397. IEEE Computer Society, (2015)Community Detection in Anonymized Social Networks., , and . EDBT/ICDT Workshops, volume 1133 of CEUR Workshop Proceedings, page 396-405. CEUR-WS.org, (2014)