{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:27:01Z","timestamp":1767706021666,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,3,8]]},"DOI":"10.1145\/3437963.3441778","type":"proceedings-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:34:28Z","timestamp":1615005268000},"page":"752-760","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Balance Maximization in Signed Networks via Edge Deletions"],"prefix":"10.1145","author":[{"given":"Kartik","family":"Sharma","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Delhi, New Delhi, India"}]},{"given":"Iqra Altaf","family":"Gillani","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Delhi, New Delhi, India"}]},{"given":"Sourav","family":"Medya","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}]},{"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Delhi, New Delhi, India"}]},{"given":"Amitabha","family":"Bagchi","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Delhi, New Delhi, India"}]}],"member":"320","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90001-9"},{"key":"e_1_3_2_1_2_1","volume-title":"Structural Balance Emerges and Explains Performance in Risky Decision-Making.","volume":"10","author":"Askarisichani O.","year":"2019","unstructured":"O. Askarisichani , J. Ng Lane , F. Bullo , N. E. Friedkin , A. K. Singh , and B. Uzzi . 2019 . Structural Balance Emerges and Explains Performance in Risky Decision-Making. , Vol. 10 , 2648 ( 2019 ). https:\/\/doi.org\/10.1038\/s41467-019--10548--8 10.1038\/s41467-019--10548--8 O. Askarisichani, J. Ng Lane, F. Bullo, N. E. Friedkin, A. K. Singh, and B. Uzzi. 2019. Structural Balance Emerges and Explains Performance in Risky Decision-Making., Vol. 10, 2648 (2019). https:\/\/doi.org\/10.1038\/s41467-019--10548--8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2014.01.001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Vineet Chaoji Sayan Ranu Rajeev Rastogi and Rushi Bhatt. 2012. Recommendations to boost content spread in social networks. In WWW. 529--538.  Vineet Chaoji Sayan Ranu Rajeev Rastogi and Rushi Bhatt. 2012. Recommendations to boost content spread in social networks. In WWW. 529--538.","DOI":"10.1145\/2187836.2187908"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.06.003"},{"volume-title":"Greedily Improving Our Own Centrality in A Network","author":"Crescenzi Pierluigi","key":"e_1_3_2_1_6_1","unstructured":"Pierluigi Crescenzi , Gianlorenzo D'Angelo , Lorenzo Severini , and Yllka Velaj . 2015. Greedily Improving Our Own Centrality in A Network . In SEA. Springer International Publishing , 43--55. Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, and Yllka Velaj. 2015. Greedily Improving Our Own Centrality in A Network. In SEA. Springer International Publishing, 43--55."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3291125.3291128"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2006.08.001"},{"key":"e_1_3_2_1_9_1","unstructured":"Palash Dey and Sourav Medya. 2020. Manipulating Node Similarity Measures in Network. In AAMAS.  Palash Dey and Sourav Medya. 2020. Manipulating Node Similarity Measures in Network. In AAMAS."},{"key":"e_1_3_2_1_10_1","volume-title":"Gomes","author":"Dilkina Bistra","year":"2011","unstructured":"Bistra Dilkina , Katherine J. Lai , and Carla P . Gomes . 2011 . Upgrading shortest paths in networks. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer , 76--91. Bistra Dilkina, Katherine J. Lai, and Carla P. Gomes. 2011. Upgrading shortest paths in networks. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer, 76--91."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.12.036"},{"key":"e_1_3_2_1_12_1","volume-title":"Eleventh International AAAI Conference on Web and Social Media.","author":"Kiran Garimella Venkata Rama","year":"2017","unstructured":"Venkata Rama Kiran Garimella and Ingmar Weber . 2017 . A long-term analysis of polarization on Twitter . In Eleventh International AAAI Conference on Web and Social Media. Venkata Rama Kiran Garimella and Ingmar Weber. 2017. A long-term analysis of polarization on Twitter. In Eleventh International AAAI Conference on Web and Social Media."},{"key":"e_1_3_2_1_13_1","volume-title":"Note: On the set-union knapsack problem. Naval Research Logistics (NRL)","author":"Goldschmidt Olivier","year":"1994","unstructured":"Olivier Goldschmidt , David Nehme , and Gang Yu . 1994 . Note: On the set-union knapsack problem. Naval Research Logistics (NRL) (1994). Olivier Goldschmidt, David Nehme, and Gang Yu. 1994. Note: On the set-union knapsack problem. Naval Research Logistics (NRL) (1994)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1028989917"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/0308108031000053611"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_23"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.37"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"David Kempe Jon Kleinberg and \u00c9va Tardos. 2003. Maximizing the spread of influence through a social network. In KDD.  David Kempe Jon Kleinberg and \u00c9va Tardos. 2003. Maximizing the spread of influence through a social network. In KDD.","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_19_1","unstructured":"Masahiro Kimura Kazumi Saito and Hiroshi Motoda. 2008. Minimizing the Spread of Contamination by Blocking Links in a Network.. In AAAI.  Masahiro Kimura Kazumi Saito and Hiroshi Motoda. 2008. Minimizing the Spread of Contamination by Blocking Links in a Network.. In AAAI."},{"key":"e_1_3_2_1_20_1","series-title":"SIAM journal on scientific computing","volume-title":"Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method","author":"Knyazev Andrew V","year":"2001","unstructured":"Andrew V Knyazev . 2001. Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method . SIAM journal on scientific computing , Vol. 23 , 2 ( 2001 ), 517--541. Andrew V Knyazev. 2001. Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. SIAM journal on scientific computing, Vol. 23, 2 (2001), 517--541."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2014.6734912"},{"key":"e_1_3_2_1_22_1","first-page":"153","article-title":"Note on the normalized Laplacian eigenvalues of signed graphs","volume":"44","author":"Li Li","year":"2009","unstructured":"Hong-hai Li and Jiong-sheng Li . 2009 . Note on the normalized Laplacian eigenvalues of signed graphs . Australasian J. Combinatorics , Vol. 44 (2009), 153 -- 162 . Hong-hai Li and Jiong-sheng Li. 2009. Note on the normalized Laplacian eigenvalues of signed graphs. Australasian J. Combinatorics, Vol. 44 (2009), 153--162.","journal-title":"Australasian J. Combinatorics"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-014-0219-1"},{"key":"e_1_3_2_1_24_1","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Manchanda Sahil","year":"2020","unstructured":"Sahil Manchanda , Akash Mittal , Anuj Dhawan , Sourav Medya , Sayan Ranu , and Ambuj Singh . 2020 . GCOMB: Learning Budget-constrained Combinatorial Algorithms over Billion-sized Graphs . Advances in Neural Information Processing Systems , Vol. 33 (2020). Sahil Manchanda, Akash Mittal, Anuj Dhawan, Sourav Medya, Sayan Ranu, and Ambuj Singh. 2020. GCOMB: Learning Budget-constrained Combinatorial Algorithms over Billion-sized Graphs. Advances in Neural Information Processing Systems, Vol. 33 (2020)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/480"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"S. Medya A. Silva and A. Singh. 2020. Approximate Algorithms for Data-driven Influence Limitation. IEEE Transactions on Knowledge and Data Engineering (2020).  S. Medya A. Silva and A. Singh. 2020. Approximate Algorithms for Data-driven Influence Limitation. IEEE Transactions on Knowledge and Data Engineering (2020).","DOI":"10.1109\/TKDE.2020.3016293"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975321.14"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213889"},{"volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX-RANDOM)","author":"Meyerson Adam","key":"e_1_3_2_1_29_1","unstructured":"Adam Meyerson and Brian Tagiku . 2009. Minimizing average shortest path distances via shortcut edge addition . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX-RANDOM) . Springer , 272--285. Adam Meyerson and Brian Tagiku. 2009. Minimizing average shortest path distances via shortcut edge addition. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX-RANDOM). Springer, 272--285."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218449"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218449"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297001.3297005"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.46"},{"key":"e_1_3_2_1_34_1","volume-title":"Best algorithms for approximating the maximum of a submodular set function. Mathematics of operations research","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser and Laurence A Wolsey . 1978. Best algorithms for approximating the maximum of a submodular set function. Mathematics of operations research , Vol. 3 , 3 ( 1978 ), 177--188. George L Nemhauser and Laurence A Wolsey. 1978. Best algorithms for approximating the maximum of a submodular set function. Mathematics of operations research, Vol. 3, 3 (1978), 177--188."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380212"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214080"},{"key":"e_1_3_2_1_37_1","volume-title":"Knowledge graph refinement: A survey of approaches and evaluation methods. Semantic web","author":"Paulheim Heiko","year":"2017","unstructured":"Heiko Paulheim . 2017. Knowledge graph refinement: A survey of approaches and evaluation methods. Semantic web , Vol. 8 , 3 ( 2017 ), 489--508. Heiko Paulheim. 2017. Knowledge graph refinement: A survey of approaches and evaluation methods. Semantic web, Vol. 8, 3 (2017), 489--508."},{"key":"e_1_3_2_1_38_1","volume-title":"Accelerating community detection by using k-core subgraphs. arXiv preprint arXiv:1403.2226","author":"Peng Chengbin","year":"2014","unstructured":"Chengbin Peng , Tamara G Kolda , and Ali Pinar . 2014. Accelerating community detection by using k-core subgraphs. arXiv preprint arXiv:1403.2226 ( 2014 ). Chengbin Peng, Tamara G Kolda, and Ali Pinar. 2014. Accelerating community detection by using k-core subgraphs. arXiv preprint arXiv:1403.2226 (2014)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(86)90192-5"},{"key":"e_1_3_2_1_40_1","volume-title":"Weakly Submodular Function Maximization Using Local Submodularity Ratio. arXiv preprint arXiv:2004.14650","author":"Santiago Richard","year":"2020","unstructured":"Richard Santiago and Yuichi Yoshida . 2020. Weakly Submodular Function Maximization Using Local Submodularity Ratio. arXiv preprint arXiv:2004.14650 ( 2020 ). Richard Santiago and Yuichi Yoshida. 2020. Weakly Submodular Function Maximization Using Local Submodularity Ratio. arXiv preprint arXiv:2004.14650 (2020)."},{"key":"e_1_3_2_1_41_1","volume-title":"Sourav Medya, Sayan Ranu, and Amitabha Bagchi.","author":"Sharma Kartik","year":"2020","unstructured":"Kartik Sharma , Iqra Altaf Gillani , Sourav Medya, Sayan Ranu, and Amitabha Bagchi. 2020 . Balance Maximization in Signed Networks via Edge Deletions . arxiv: 2010.10991 Kartik Sharma, Iqra Altaf Gillani, Sourav Medya, Sayan Ranu, and Amitabha Bagchi. 2020. Balance Maximization in Signed Networks via Edge Deletions. arxiv: 2010.10991"},{"volume-title":"Matrix Perturbation Theory","author":"Stewart G.W.","key":"e_1_3_2_1_42_1","unstructured":"G.W. Stewart and J-g Sun. 1990. Matrix Perturbation Theory . Academic Press, Inc. G.W. Stewart and J-g Sun. 1990. Matrix Perturbation Theory .Academic Press, Inc."},{"key":"e_1_3_2_1_43_1","volume-title":"Thirty-First AAAI Conference on Artificial Intelligence. 245--251","author":"Zhang Fan","year":"2017","unstructured":"Fan Zhang , Ying Zhang , Lu Qin , Wenjie Zhang , and Xuemin Lin . 2017 . Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem . In Thirty-First AAAI Conference on Artificial Intelligence. 245--251 . Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2017. Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem. In Thirty-First AAAI Conference on Artificial Intelligence. 245--251."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Zhongxin Zhou Fan Zhang Xuemin Lin Wenjie Zhang and Chen Chen. 2019. K-Core Maximization: An Edge Addition Approach.. In IJCAI. 4867--4873.  Zhongxin Zhou Fan Zhang Xuemin Lin Wenjie Zhang and Chen Chen. 2019. K-Core Maximization: An Edge Addition Approach.. In IJCAI. 4867--4873.","DOI":"10.24963\/ijcai.2019\/676"}],"event":{"name":"WSDM '21: The Fourteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Israel","acronym":"WSDM '21"},"container-title":["Proceedings of the 14th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441778","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:35Z","timestamp":1750193255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":44,"alternative-id":["10.1145\/3437963.3441778","10.1145\/3437963"],"URL":"https:\/\/doi.org\/10.1145\/3437963.3441778","relation":{},"subject":[],"published":{"date-parts":[[2021,3,8]]},"assertion":[{"value":"2021-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}