{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:49Z","timestamp":1779174829011,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3736839","type":"proceedings-article","created":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T21:05:41Z","timestamp":1754255141000},"page":"2315-2325","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["<scp>Alpine:<\/scp>\n                    Partial Unlabeled Graph Alignment"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3524-6073","authenticated-orcid":false,"given":"Petros","family":"Petsinis","sequence":"first","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5078-6468","authenticated-orcid":false,"given":"Konstantinos","family":"Skitsas","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4147-9372","authenticated-orcid":false,"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[{"name":"IIT Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8256-2258","authenticated-orcid":false,"given":"Davide","family":"Mottin","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0509-9129","authenticated-orcid":false,"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"U. of Copenhagen, Copenhagen, Denmark and Aarhus U., Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"147","article-title":"Three observations on linear algebra","volume":"5","author":"Birkhoff Garrett","year":"1946","unstructured":"Garrett Birkhoff. 1946. Three observations on linear algebra. Univ. Nac. Tacuman, Rev. Ser. A, Vol. 5 (1946), 147-151.","journal-title":"Univ. Nac. Tacuman, Rev. Ser. A"},{"key":"e_1_3_2_2_2_1","first-page":"19523","article-title":"FUGAL: Feature-fortified Unrestricted Graph Alignment","volume":"37","author":"Bommakanti Aditya","year":"2024","unstructured":"Aditya Bommakanti, Harshith Vonteri, Konstantinos Skitsas, Sayan Ranu, Davide Mottin, and Panagiotis Karras. 2024. FUGAL: Feature-fortified Unrestricted Graph Alignment. In NeurIPS, Vol. 37. 19523-19546.","journal-title":"NeurIPS"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Suvarna Bothe Alfredo Cuzzocrea Panagiotis Karras and Akrivi Vlachou. 2014. Skyline Query Processing over Encrypted Data: An Attribute-Order-Preserving-Free Approach. In PSBD@CIKM. 37-43.","DOI":"10.1145\/2663715.2669613"},{"key":"e_1_3_2_2_4_1","volume-title":"Pitsoulis","author":"Burkard Rainer E.","year":"1998","unstructured":"Rainer E. Burkard, Eranda Cela, Panos M. Pardalos, and Leonidas S. Pitsoulis. 1998. The Quadratic Assignment Problem. In Handbook of Combinatorial Optimization. Springer, 1713-1809."},{"key":"e_1_3_2_2_5_1","first-page":"459","article-title":"BASS","volume":"2016","author":"Cao Xuezhi","year":"2016","unstructured":"Xuezhi Cao and Yong Yu. 2016. BASS: A Bootstrapping Approach for Aligning Heterogenous Social Networks. In ECML PKDD 2016. 459-475.","journal-title":"A Bootstrapping Approach for Aligning Heterogenous Social Networks. In ECML PKDD"},{"key":"e_1_3_2_2_6_1","first-page":"1985","article-title":"CONE-Align","author":"Chen Xiyuan","year":"2020","unstructured":"Xiyuan Chen, Mark Heimann, Fatemeh Vahedian, and Danai Koutra. 2020. CONE-Align: Consistent Network Alignment with Proximity-Preserving Node Embedding. In CIKM. 1985-1988.","journal-title":"Consistent Network Alignment with Proximity-Preserving Node Embedding. In CIKM."},{"key":"e_1_3_2_2_7_1","volume-title":"Cross-Network Embedding for Multi-Network Alignment. In World Wide Web Conference. 273-284","author":"Chu Xiaokai","year":"2019","unstructured":"Xiaokai Chu, Xinxin Fan, Di Yao, Zhihua Zhu, Jianhui Huang, and Jingping Bi. 2019. Cross-Network Embedding for Multi-Network Alignment. In World Wide Web Conference. 273-284."},{"key":"e_1_3_2_2_8_1","first-page":"21","article-title":"Graph matching applications in pattern recognition and image processing","author":"Conte Donatello","year":"2003","unstructured":"Donatello Conte, Pasquale Foggia, Carlo Sansone, and Mario Vento. 2003. Graph matching applications in pattern recognition and image processing. In ICIP. 21-24.","journal-title":"ICIP."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_2_10_1","first-page":"2292","article-title":"Sinkhorn Distances","author":"Cuturi Marco","year":"2013","unstructured":"Marco Cuturi. 2013. Sinkhorn Distances: Lightspeed Computation of Optimal Transport. In NeurIPS. 2292-2300.","journal-title":"Lightspeed Computation of Optimal Transport. In NeurIPS."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2014.1004"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130800.3130826"},{"key":"e_1_3_2_2_13_1","first-page":"2985","article-title":"Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory","author":"Fan Zhou","year":"2020","unstructured":"Zhou Fan, Cheng Mao, Yihong Wu, and Jiaming Xu. 2020. Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory. In ICML. 2985-2995.","journal-title":"ICML."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Julie Fournet and Alain Barrat. 2014. Contact patterns among high school students. PloS one(2014).","DOI":"10.1371\/journal.pone.0107878"},{"key":"e_1_3_2_2_15_1","volume-title":"An algorithm for quadratic programming. Naval research logistics quarterly","author":"Frank Marguerite","year":"1956","unstructured":"Marguerite Frank and Philip Wolfe. 1956. An algorithm for quadratic programming. Naval research logistics quarterly, Vol. 3, 1-2 (1956), 95-110."},{"key":"e_1_3_2_2_16_1","first-page":"117","article-title":"REGAL","author":"Heimann Mark","year":"2018","unstructured":"Mark Heimann, Haoming Shen, Tara Safavi, and Danai Koutra. 2018. REGAL: Representation Learning-based Graph Alignment. In CIKM. 117-126.","journal-title":"Representation Learning-based Graph Alignment. In CIKM."},{"key":"e_1_3_2_2_17_1","first-page":"44","article-title":"GRASP","author":"Hermanns Judith","year":"2021","unstructured":"Judith Hermanns, Anton Tsitsulin, Marina Munkhoeva, Alexander M. Bronstein, Davide Mottin, and Panagiotis Karras. 2021. GRASP: Graph Alignment Through Spectral Signatures. In APWeb-WAIM. 44-52.","journal-title":"Graph Alignment Through Spectral Signatures. In APWeb-WAIM."},{"key":"e_1_3_2_2_18_1","first-page":"4402","article-title":"Binary constraint preserving graph matching","author":"Jiang Bo","year":"2017","unstructured":"Bo Jiang, Jin Tang, Chris Ding, and Bin Luo. 2017. Binary constraint preserving graph matching. In CVPR. 4402-4409.","journal-title":"CVPR."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794371"},{"key":"e_1_3_2_2_20_1","first-page":"33","article-title":"When can two unlabeled networks be aligned under partial overlap?","author":"Kazemi Ehsan","year":"2015","unstructured":"Ehsan Kazemi, Lyudmila Yartseva, and Matthias Grossglauser. 2015b. When can two unlabeled networks be aligned under partial overlap?. In Allerton. 33-42.","journal-title":"Allerton."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Tjalling C Koopmans and Martin Beckmann. 1957. Assignment problems and the location of economic activities. Econometrica: Journal of the Econometric Society(1957) 53-76.","DOI":"10.2307\/1907742"},{"key":"e_1_3_2_2_22_1","first-page":"389","article-title":"Big-align: Fast bipartite graph alignment","author":"Koutra Danai","year":"2013","unstructured":"Danai Koutra, Hanghang Tong, and David Lubensky. 2013. Big-align: Fast bipartite graph alignment. In ICDM. 389-398.","journal-title":"ICDM."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_2_25_1","first-page":"586","article-title":"The Quadratic Assignment Problem. Manage","volume":"9","author":"Lawler Eugene L","year":"1963","unstructured":"Eugene L Lawler. 1963. The Quadratic Assignment Problem. Manage. Sci., Vol. 9, 4 (1963), 586--599.","journal-title":"Sci."},{"key":"e_1_3_2_2_26_1","first-page":"1258","volume-title":"IEEE TPAMI","volume":"36","author":"Liu Zhiyong","year":"2014","unstructured":"Zhiyong Liu and Hong Qiao. 2014. GNCCP - Graduated Non-Convexity and Concavity Procedure. IEEE TPAMI, Vol. 36, 6 (2014), 1258-1267."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.45"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629672"},{"key":"e_1_3_2_2_29_1","first-page":"406","article-title":"(Probably) Concave Graph Matching","author":"Maron Haggai","year":"2018","unstructured":"Haggai Maron and Yaron Lipman. 2018. (Probably) Concave Graph Matching. In NeurIPS. 406-416.","journal-title":"NeurIPS."},{"key":"e_1_3_2_2_30_1","first-page":"548","article-title":"Learning to Discover Social Circles in Ego Networks","author":"McAuley Julian J.","year":"2012","unstructured":"Julian J. McAuley and Jure Leskovec. 2012. Learning to Discover Social Circles in Ego Networks. In NeurIPS. 548-556.","journal-title":"NeurIPS."},{"key":"e_1_3_2_2_31_1","first-page":"117","article-title":"Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching","author":"Melnik Sergey","year":"2002","unstructured":"Sergey Melnik, Hector Garcia-Molina, and Erhard Rahm. 2002. Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching. In ICDE. 117-128.","journal-title":"ICDE."},{"key":"e_1_3_2_2_32_1","volume-title":"De-anonymizing Social Networks. In 30th IEEE Symposium on Security and Privacy (SP). 173-187","author":"Narayanan Arvind","year":"2009","unstructured":"Arvind Narayanan and Vitaly Shmatikov. 2009. De-anonymizing Social Networks. In 30th IEEE Symposium on Security and Privacy (SP). 173-187."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.157"},{"key":"e_1_3_2_2_35_1","first-page":"4374","article-title":"GradAlign","author":"Park Jin-Duk","year":"2022","unstructured":"Jin-Duk Park, Cong Tran, Won-Yong Shin, and Xin Cao. 2022. GradAlign: Empowering Gradual Network Alignment Using Attribute Augmentation. In CIKM. 4374-4378.","journal-title":"Empowering Gradual Network Alignment Using Attribute Augmentation. In CIKM."},{"key":"e_1_3_2_2_36_1","first-page":"459","article-title":"Network embedding as matrix factorization: Unifying DeepWalk, LINE, PTE, and node2vec","author":"Qiu Jiezhong","year":"2018","unstructured":"Jiezhong Qiu, Yuxiao Dong, Hao Ma, Jian Li, Kuansan Wang, and Jie Tang. 2018. Network embedding as matrix factorization: Unifying DeepWalk, LINE, PTE, and node2vec. In WSDM. 459-467.","journal-title":"WSDM."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450703"},{"key":"e_1_3_2_2_38_1","first-page":"620","article-title":"A Convergence Proof for the Softassign Quadratic Assignment Algorithm","author":"Rangarajan Anand","year":"1996","unstructured":"Anand Rangarajan, Alan L. Yuille, Steven Gold, and Eric Mjolsness. 1996. A Convergence Proof for the Softassign Quadratic Assignment Algorithm. In NeurIPS. 620-626.","journal-title":"NeurIPS."},{"key":"e_1_3_2_2_39_1","volume-title":"Vogelstein","author":"Saad-Eldin Ali","year":"2021","unstructured":"Ali Saad-Eldin, Benjamin D. Pedigo, Carey E. Priebe, and Joshua T. Vogelstein. 2021. Graph Matching via Optimal Transport. arxiv:2111.05366 [stat.ML]"},{"key":"e_1_3_2_2_40_1","first-page":"2931","article-title":"MAGNA","volume":"30","author":"Saraph Vikram","year":"2014","unstructured":"Vikram Saraph and Tijana Milenkovic. 2014. MAGNA: Maximizing Accuracy in Global Network Alignment. Bioinformatics, Vol. 30, 20 (2014), 2931-2940.","journal-title":"Maximizing Accuracy in Global Network Alignment. Bioinformatics"},{"key":"e_1_3_2_2_41_1","volume-title":"Modeling cellular machinery through biological network comparison. Nature biotechnology","author":"Sharan Roded","year":"2006","unstructured":"Roded Sharan and Trey Ideker. 2006. Modeling cellular machinery through biological network comparison. Nature biotechnology, Vol. 24 (05 2006), 427-33."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1991.3.2.268"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Uriel Singer Ido Guy and Kira Radinsky. 2019. Node embedding over temporal graphs. arXiv preprint arXiv:1903.08889(2019).","DOI":"10.24963\/ijcai.2019\/640"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1967.21.343"},{"key":"e_1_3_2_2_47_1","first-page":"260","article-title":"Comprehensive evaluation of algorithms for unrestricted graph alignment","author":"Skitsas Konstantinos","year":"2023","unstructured":"Konstantinos Skitsas, Karol Orlowski, Judith Hermanns, Davide Mottin, and Panagiotis Karras. 2023. Comprehensive evaluation of algorithms for unrestricted graph alignment. In EDBT. 260-272.","journal-title":"EDBT."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925903"},{"key":"e_1_3_2_2_49_1","first-page":"1083","article-title":"In-memory subgraph matching: An in-depth study","author":"Sun Shixuan","year":"2020","unstructured":"Shixuan Sun and Qiong Luo. 2020. In-memory subgraph matching: An in-depth study. In SIGMOD. 1083-1098.","journal-title":"SIGMOD."},{"key":"e_1_3_2_2_50_1","first-page":"963","article-title":"Multi-order Matched Neighborhood Consistent Graph Alignment in a Union Vector Space","author":"Tang Wei","year":"2023","unstructured":"Wei Tang, Haifeng Sun, Jingyu Wang, Qi Qi, Jing Wang, Hao Yang, and Shimin Tao. 2023. Multi-order Matched Neighborhood Consistent Graph Alignment in a Union Vector Space. In SIGIR. 963-972.","journal-title":"SIGIR."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2017.2740381"},{"key":"e_1_3_2_2_52_1","first-page":"3046","article-title":"Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching","author":"Xu Hongteng","year":"2019","unstructured":"Hongteng Xu, Dixin Luo, and Lawrence Carin. 2019a. Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching. In NeurIPS. 3046-3056.","journal-title":"NeurIPS."},{"key":"e_1_3_2_2_53_1","first-page":"6932","article-title":"Gromov-Wasserstein Learning for Graph Matching and Node Embedding","author":"Xu Hongteng","year":"2019","unstructured":"Hongteng Xu, Dixin Luo, Hongyuan Zha, and Lawrence Carin. 2019b. Gromov-Wasserstein Learning for Graph Matching and Node Embedding. In ICML. 6932-6941.","journal-title":"ICML."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.0076"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908925"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"e_1_3_2_2_57_1","first-page":"1345","article-title":"FINAL","author":"Zhang Si","year":"2016","unstructured":"Si Zhang and Hanghang Tong. 2016. FINAL: Fast Attributed Network Alignment. In ACM SIGKDD. 1345-1354.","journal-title":"Fast Attributed Network Alignment. In ACM SIGKDD."},{"key":"e_1_3_2_2_58_1","first-page":"1680","article-title":"Attributed Network Alignment: Problem Definitions and Fast Solutions","volume":"31","author":"Zhang Si","year":"2019","unstructured":"Si Zhang and Hanghang Tong. 2019. Attributed Network Alignment: Problem Definitions and Fast Solutions. IEEE TKDE, Vol. 31, 9 (2019), 1680-1692.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_59_1","first-page":"3330","article-title":"KerGM","author":"Zhang Zhen","year":"2019","unstructured":"Zhen Zhang, Yijian Xiang, Lingfei Wu, Bing Xue, and Arye Nehorai. 2019. KerGM: Kernelized Graph Matching. In NeurIPS. 3330-3341.","journal-title":"Kernelized Graph Matching. In NeurIPS."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2501802"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3736839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:14:20Z","timestamp":1777572860000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3736839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":60,"alternative-id":["10.1145\/3711896.3736839","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3736839","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}