[16] Cynthia Dwork, Aaron Roth, et al. The algorithmic foundations of differential privacy. Foundations and Trends® in Theoretical Computer Science, 9(3-4):211-407, 2014.
[17] Badih Ghazi, Ravi Kumar, and Pasin Manurangsi. Differentially private clustering: Tight approximation ratios. Advances in Neural Information Processing Systems, 33:4040-4054, 2020.
[18] Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, and Kunal Talwar. Differentially private combinatorial optimization. In Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms, pages 1106-1125. SIAM, 2010.
[19] Michael Hay, Chao Li, Gerome Miklau, and David Jensen. Accurate estimation of the degree distribution of private networks. In 2009 Ninth IEEE International Conference on Data Mining, pages 169-178. IEEE, 2009.
[20] Zhiyi Huang and Jinyan Liu. Optimal differentially private algorithms for k-means clustering. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 395-408, 2018.
[21] Vladimir Kolmogorov and Carsten Rother. Minimizing nonsubmodular functions with graph cuts-a review. IEEE transactions on pattern analysis and machine intelligence, 29(7):1274-1279, 2007.
[22] Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, June 2014.
[23] Meng Liu and David F Gleich. Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering. Advances in neural information processing systems, 33: 5023-5035, 2020.
[24] Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, and Roy Schwartz. Sdp gaps andUGC hardness for multiway cut, 0-extension, and metric labeling. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 11-20, 2008.
[25] Ishai Menache, Shie Mannor, and Nahum Shimkin. Q-cut—dynamic discovery of sub-goals in reinforcement learning. In Machine Learning: ECML 2002: 13th European Conference on Machine Learning Helsinki, Finland, August 19–23, 2002 Proceedings 13, pages 295–306. Springer, 2002.
[26] Ketan Mulmuley, Umesh V Vazirani, and Vijay V Vazirani. Matching is as easy as matrix inversion. In Proceedings of the nineteenth annual ACM symposium on Theory of computing, pages 345-354, 1987.
[27] Bo Peng, Lei Zhang, David Zhang, and Jian Yang. Image segmentation by iterated region merging with localized graph cuts. Pattern Recognition, 44(10-11):2527-2538, 2011.
[28] Ankit Sharma and Jan Vondrak. Multiway cut, pairwise realizable distributions, and descending thresholds. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, pages 724-733, 2014.
[29] Hyungsik Shin, Jeryang Park, and Dongwoo Kang. A graph-cut-based approach to community detection in networks. Applied Sciences, 12(12):6218, 2022.
[30] Apoorva Singh, Sriparna Saha, Mohammed Hasanuzzaman, and Anubhav Jangra. Identifying complaints based on semi-supervised mincuts. Expert Systems with Applications, 186:115668, 2021.
[31] Dong Su, Jianneng Cao, Ninghui Li, Elisa Bertino, and Hongxia Jin. Differentially private k-means clustering. In Proceedings of the sixth ACM conference on data and application security and privacy, pages 26-37, 2016.
[32] Wenbing Tao, Feng Chang, Liman Liu, Hai Jin, and Tianjiang Wang. Interactively multiphase image segmentation based on variational formulation and graph cuts. Pattern Recognition, 43 (10):3208-3218, 2010.