{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:21:17Z","timestamp":1783614077562,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"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":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671815","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T00:54:55Z","timestamp":1724547295000},"page":"2584-2595","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["NeuroCut: A Neural Approach for Robust Graph Partitioning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5842-5462","authenticated-orcid":false,"given":"Rishi","family":"Shah","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, IIT Delhi, New Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5342-3920","authenticated-orcid":false,"given":"Krishnanshu","family":"Jain","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, IIT Delhi, New Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7437-9891","authenticated-orcid":false,"given":"Sahil","family":"Manchanda","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, IIT Delhi, New Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0996-2807","authenticated-orcid":false,"given":"Sourav","family":"Medya","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, Chicago, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4147-9372","authenticated-orcid":false,"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, IIT Delhi, New Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3242034"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i10.28983"},{"key":"e_1_3_2_2_4_1","volume-title":"International conference on machine learning. PMLR, 874--883","author":"Bianchi Filippo Maria","year":"2020","unstructured":"Filippo Maria Bianchi, Daniele Grattarola, and Cesare Alippi. 2020. Spectral clustering with graph neural networks for graph pooling. In International conference on machine learning. PMLR, 874--883."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052934.1052938"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02776078"},{"key":"e_1_3_2_2_7_1","volume-title":"On the hardness of approximating multicut and sparsest-cut. computational complexity 15","author":"Chawla Shuchi","year":"2006","unstructured":"Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, and D Sivakumar. 2006. On the hardness of approximating multicut and sparsest-cut. computational complexity 15 (2006), 94--114."},{"key":"e_1_3_2_2_8_1","volume-title":"Proceedings of ICCM","volume":"2","author":"Chung Fan","year":"2007","unstructured":"Fan Chung. 2007. Four proofs for the Cheeger inequality and graph partition algorithms. In Proceedings of ICCM, Vol. 2. Citeseer, 378."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.109126"},{"key":"e_1_3_2_2_10_1","unstructured":"Martin Ester Hans-Peter Kriegel J\u00f6rg Sander Xiaowei Xu et al. 1996. A densitybased algorithm for discovering clusters in large spatial databases with noise. In kdd Vol. 96. 226--231."},{"key":"e_1_3_2_2_11_1","volume-title":"Exact combinatorial optimization with graph convolutional neural networks. Advances in neural information processing systems 32","author":"Gasse Maxime","year":"2019","unstructured":"Maxime Gasse, Didier Ch\u00e9telat, Nicola Ferroni, Laurent Charlin, and Andrea Lodi. 2019. Exact combinatorial optimization with graph convolutional neural networks. Advances in neural information processing systems 32 (2019)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3586589.3586892"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380201"},{"key":"e_1_3_2_2_15_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems 30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_3_2_2_16_1","volume-title":"An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227","author":"Joshi Chaitanya K","year":"2019","unstructured":"Chaitanya K Joshi, Thomas Laurent, and Xavier Bresson. 2019. An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227 (2019)."},{"key":"e_1_3_2_2_17_1","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 485--501","author":"Jung Steffen","year":"2022","unstructured":"Steffen Jung and Margret Keuper. 2022. Learning to solve minimum cost multicuts efficiently using edge-weighted graph convolutional neural networks. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 485--501."},{"key":"e_1_3_2_2_18_1","volume-title":"VLSI physical design: from graph partitioning to timing closure","author":"Kahng Andrew B","unstructured":"Andrew B Kahng, Jens Lienig, Igor L Markov, and Jin Hu. 2011. VLSI physical design: from graph partitioning to timing closure. Vol. 312. Springer."},{"key":"e_1_3_2_2_19_1","volume-title":"A survey on explainability of graph neural networks. arXiv preprint arXiv:2306.01958","author":"Kakkad Jaykumar","year":"2023","unstructured":"Jaykumar Kakkad, Jaspal Jannu, Kartik Sharma, Charu Aggarwal, and Sourav Medya. 2023. A survey on explainability of graph neural networks. arXiv preprint arXiv:2306.01958 (2023)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1997.597203"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/309847.309954"},{"key":"e_1_3_2_2_23_1","volume-title":"Learning combinatorial optimization algorithms over graphs. Advances in neural information processing systems 30","author":"Khalil Elias","year":"2017","unstructured":"Elias Khalil, Hanjun Dai, Yuyu Zhang, Bistra Dilkina, and Le Song. 2017. Learning combinatorial optimization algorithms over graphs. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_3_2_2_24_1","volume-title":"Herke Van Hoof, and Max Welling","author":"Kool Wouter","year":"2018","unstructured":"Wouter Kool, Herke Van Hoof, and Max Welling. 2018. Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)."},{"key":"e_1_3_2_2_25_1","volume-title":"Learning to discover social circles in ego networks. Advances in neural information processing systems 25","author":"Leskovec Jure","year":"2012","unstructured":"Jure Leskovec and Julian Mcauley. 2012. Learning to discover social circles in ego networks. Advances in neural information processing systems 25 (2012)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2005.847260"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313418"},{"key":"e_1_3_2_2_28_1","volume-title":"Proceedings of the fifth Berkeley symposium on mathematical statistics and probability","volume":"1","author":"James","unstructured":"James MacQueen et al. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, Vol. 1. Oakland, CA, USA, 281--297."},{"key":"e_1_3_2_2_29_1","volume-title":"Learning on Graphs Conference. PMLR, 32--1.","author":"Manchanda Sahil","year":"2024","unstructured":"Sahil Manchanda, Shubham Gupta, Sayan Ranu, and Srikanta J Bedathur. 2024. Generative modeling of labeled graphs under data scarcity. In Learning on Graphs Conference. PMLR, 32--1."},{"key":"e_1_3_2_2_30_1","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 426--442","author":"Manchanda Sahil","year":"2022","unstructured":"Sahil Manchanda, Sofia Michel, Darko Drakulic, and Jean-Marc Andreoli. 2022. On the generalization of neural combinatorial optimization heuristics. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 426--442."},{"key":"e_1_3_2_2_31_1","first-page":"20000","article-title":"Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs","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 33 (2020), 20000--20011.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.26086"},{"key":"e_1_3_2_2_33_1","unstructured":"Julian McAuley and Jure Leskovec. 2012. Learning to Discover Social Circles in Ego Networks. In Neural Information Processing Systems. https:\/\/api. semanticscholar.org\/CorpusID:2820103"},{"key":"e_1_3_2_2_34_1","volume-title":"Gap: Generalizable approximate graph partitioning framework. arXiv preprint arXiv:1903.00614","author":"Nazi Azade","year":"2019","unstructured":"Azade Nazi, Will Hang, Anna Goldie, Sujith Ravi, and Azalia Mirhoseini. 2019. Gap: Generalizable approximate graph partitioning framework. arXiv preprint arXiv:1903.00614 (2019)."},{"key":"e_1_3_2_2_35_1","volume-title":"On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems 14","author":"Jordan Michael","year":"2001","unstructured":"AndrewNg, Michael Jordan, and YairWeiss. 2001. On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems 14 (2001)."},{"key":"e_1_3_2_2_36_1","volume-title":"A critical look at the evaluation of GNNs under heterophily: are we really making progress? arXiv preprint arXiv:2302.11640","author":"Platonov Oleg","year":"2023","unstructured":"Oleg Platonov, Denis Kuznedelev, Michael Diskin, Artem Babenko, and Liudmila Prokhorenkova. 2023. A critical look at the evaluation of GNNs under heterophily: are we really making progress? arXiv preprint arXiv:2302.11640 (2023)."},{"key":"e_1_3_2_2_37_1","volume-title":"Divide and conquer: Partitioning online social networks. arXiv preprint arXiv:0905.4918","author":"Pujol Josep M","year":"2009","unstructured":"Josep M Pujol, Vijay Erramilli, and Pablo Rodriguez. 2009. Divide and conquer: Partitioning online social networks. arXiv preprint arXiv:0905.4918 (2009)."},{"key":"e_1_3_2_2_38_1","first-page":"22518","article-title":"Greed: A neural framework for learning graph distance functions","volume":"35","author":"Ranjan Rishabh","year":"2022","unstructured":"Rishabh Ranjan, Siddharth Grover, Sourav Medya, Venkatesan Chakaravarthy, Yogish Sabharwal, and Sayan Ranu. 2022. Greed: A neural framework for learning graph distance functions. Advances in Neural Information Processing Systems 35 (2022), 22518--22530.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792251730"},{"key":"e_1_3_2_2_40_1","volume-title":"Collective classification in network data. AI magazine 29, 3","author":"Sen Prithviraj","year":"2008","unstructured":"Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI magazine 29, 3 (2008), 93--93."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_2_42_1","volume-title":"Reinforcement learning: An introduction","author":"Sutton Richard S","unstructured":"Richard S Sutton and Andrew G Barto. 2018. Reinforcement learning: An introduction. MIT press."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2020.02.008"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i18.30070"},{"key":"e_1_3_2_2_45_1","first-page":"1","article-title":"Graph clustering with graph neural networks","volume":"24","author":"Tsitsulin Anton","year":"2023","unstructured":"Anton Tsitsulin, John Palowitch, Bryan Perozzi, and Emmanuel M\u00fcller. 2023. Graph clustering with graph neural networks. Journal of Machine Learning Research 24, 127 (2023), 1--21.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_46_1","first-page":"1","article-title":"Graph clustering with graph neural networks","volume":"24","author":"Tsitsulin Anton","year":"2023","unstructured":"Anton Tsitsulin, John Palowitch, Bryan Perozzi, and Emmanuel M\u00fcller. 2023. Graph clustering with graph neural networks. Journal of Machine Learning Research 24, 127 (2023), 1--21.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132967"},{"key":"e_1_3_2_2_48_1","volume-title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8","author":"Williams Ronald J","year":"1992","unstructured":"Ronald J Williams. 1992. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8 (1992), 229--256."},{"key":"e_1_3_2_2_49_1","volume-title":"Graph neural networks for graphs with heterophily: A survey. arXiv preprint arXiv:2202.07082","author":"Zheng Xin","year":"2022","unstructured":"Xin Zheng, Yi Wang, Yixin Liu, Ming Li, Miao Zhang, Di Jin, Philip S Yu, and Shirui Pan. 2022. Graph neural networks for graphs with heterophily: A survey. arXiv preprint arXiv:2202.07082 (2022)."}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Barcelona Spain","acronym":"KDD '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671815","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:46:22Z","timestamp":1755798382000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":49,"alternative-id":["10.1145\/3637528.3671815","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671815","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}