{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:08Z","timestamp":1750221008020,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"U.S. National Science Foundation","award":["IIS-1615612"],"award-info":[{"award-number":["IIS-1615612"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3341161.3342937","type":"proceedings-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T21:07:04Z","timestamp":1579122424000},"page":"448-451","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["OPTANE"],"prefix":"10.1145","author":[{"given":"Farzan","family":"Masrour","sequence":"first","affiliation":[{"name":"Michigan State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pang-Ning","family":"Tan","sequence":"additional","affiliation":[{"name":"Michigan State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdol-Hossein","family":"Esfahanian","sequence":"additional","affiliation":[{"name":"Michigan State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"433","volume-title":"ACM","author":"Zhang Y.","year":"2014","unstructured":"Y. Zhang , \"Browser-oriented universal cross-site recommendation and explanation based on user browsing logs,\" in Proceedings of the 8th ACM Conference on Recommender systems . ACM , 2014 , pp. 433 -- 436 . Y. Zhang, \"Browser-oriented universal cross-site recommendation and explanation based on user browsing logs,\" in Proceedings of the 8th ACM Conference on Recommender systems. ACM, 2014, pp. 433--436."},{"key":"e_1_3_2_1_2_1","first-page":"16","volume-title":"Pairwise global alignment of protein interaction networks by matching neighborhood topology,\" in Annual International Conference on Research in Computational Molecular Biology","author":"Singh R.","year":"2007","unstructured":"R. Singh , J. Xu , and B. Berger , \" Pairwise global alignment of protein interaction networks by matching neighborhood topology,\" in Annual International Conference on Research in Computational Molecular Biology . Springer , 2007 , pp. 16 -- 31 . R. Singh, J. Xu, and B. Berger, \"Pairwise global alignment of protein interaction networks by matching neighborhood topology,\" in Annual International Conference on Research in Computational Molecular Biology. Springer, 2007, pp. 16--31."},{"key":"e_1_3_2_1_3_1","first-page":"151","volume-title":"ACM","author":"Cook S. A.","year":"1971","unstructured":"S. A. Cook , \"The complexity of theorem-proving procedures,\" in Proceedings of the third annual ACM symposium on Theory of computing . ACM , 1971 , pp. 151 -- 158 . S. A. Cook, \"The complexity of theorem-proving procedures,\" in Proceedings of the third annual ACM symposium on Theory of computing. ACM, 1971, pp. 151--158."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"e_1_3_2_1_5_1","first-page":"1345","volume-title":"ACM","author":"Zhang S.","year":"2016","unstructured":"S. Zhang and H. Tong , \" Final: Fast attributed network alignment,\" in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . ACM , 2016 , pp. 1345 -- 1354 . S. Zhang and H. Tong, \"Final: Fast attributed network alignment,\" in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2016, pp. 1345--1354."},{"key":"e_1_3_2_1_6_1","unstructured":"G. Monge \"M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais \" Histoire de l'Acad\u00e9mie Royale des Sciences de Paris 1781.  G. Monge \"M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais \" Histoire de l'Acad\u00e9mie Royale des Sciences de Paris 1781."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment problems: Society for industrial and applied mathematics","author":"Burkard R.","year":"2009","unstructured":"R. Burkard , M. Dell'Amico , and S. Martello , \" Assignment problems: Society for industrial and applied mathematics ,\" 2009 . R. Burkard, M. Dell'Amico, and S. Martello, \"Assignment problems: Society for industrial and applied mathematics,\" 2009."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"e_1_3_2_1_10_1","first-page":"705","volume-title":"ICDM'09","author":"Bayati M.","year":"2009","unstructured":"M. Bayati , M. Gerritsen , D. F. Gleich , A. Saberi , and Y. Wang , \" Algorithms for large, sparse network alignment problems,\" in Data Mining, 2009 . ICDM'09 . Ninth IEEE International Conference on. IEEE , 2009 , pp. 705 -- 710 . M. Bayati, M. Gerritsen, D. F. Gleich, A. Saberi, and Y. Wang, \"Algorithms for large, sparse network alignment problems,\" in Data Mining, 2009. ICDM'09. Ninth IEEE International Conference on. IEEE, 2009, pp. 705--710."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-S1-S59"},{"key":"e_1_3_2_1_12_1","first-page":"389","volume-title":"IEEE","author":"Koutra D.","year":"2013","unstructured":"D. Koutra , H. Tong , and D. Lubensky , \" Big-align: Fast bipartite graph alignment,\" in 2013 IEEE 13th International Conference on Data Mining . IEEE , 2013 , pp. 389 -- 398 . D. Koutra, H. Tong, and D. Lubensky, \"Big-align: Fast bipartite graph alignment,\" in 2013 IEEE 13th International Conference on Data Mining. IEEE, 2013, pp. 389--398."},{"key":"e_1_3_2_1_13_1","volume-title":"Fast inexact graph matching with applications in statistical connectomics,\" CoRR, abs\/1112.5507","author":"Vogelstein J. T.","year":"2011","unstructured":"J. T. Vogelstein , J. M. Conroy , L. J. Podrazik , S. G. Kratzer , D. E. Fishkind , R. J. Vogelstein , and C. E. Priebe , \" Fast inexact graph matching with applications in statistical connectomics,\" CoRR, abs\/1112.5507 , 2011 . J. T. Vogelstein, J. M. Conroy, L. J. Podrazik, S. G. Kratzer, D. E. Fishkind, R. J. Vogelstein, and C. E. Priebe, \"Fast inexact graph matching with applications in statistical connectomics,\" CoRR, abs\/1112.5507, 2011."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.174"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp203"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2794549.3114257"},{"volume-title":"Emergence of scaling in random networks,\" science","author":"Barab\u00e1si A.-L.","key":"e_1_3_2_1_18_1","unstructured":"A.-L. Barab\u00e1si and R. Albert , \" Emergence of scaling in random networks,\" science , vol. 286 , no. 5439, pp. 509--512, 1999. A.-L. Barab\u00e1si and R. Albert, \"Emergence of scaling in random networks,\" science, vol. 286, no. 5439, pp. 509--512, 1999."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(02)00039-4"},{"key":"e_1_3_2_1_20_1","volume-title":"Gemsec: graph embedding with self clustering,\" arXiv preprint arXiv:1802.03997","author":"Rozemberczki B.","year":"2018","unstructured":"B. Rozemberczki , R. Davies , R. Sarkar , and C. Sutton , \" Gemsec: graph embedding with self clustering,\" arXiv preprint arXiv:1802.03997 , 2018 . B. Rozemberczki, R. Davies, R. Sarkar, and C. Sutton, \"Gemsec: graph embedding with self clustering,\" arXiv preprint arXiv:1802.03997, 2018."},{"key":"e_1_3_2_1_21_1","first-page":"539","volume-title":"Learning to discover social circles in ego networks,\" in Advances in neural information processing systems","author":"Leskovec J.","year":"2012","unstructured":"J. Leskovec and J. J. Mcauley , \" Learning to discover social circles in ego networks,\" in Advances in neural information processing systems , 2012 , pp. 539 -- 547 . J. Leskovec and J. J. Mcauley, \"Learning to discover social circles in ego networks,\" in Advances in neural information processing systems, 2012, pp. 539--547."},{"key":"e_1_3_2_1_22_1","first-page":"631","volume-title":"ACM","author":"Leskovec J.","year":"2006","unstructured":"J. Leskovec and C. Faloutsos , \" Sampling from large graphs,\" in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM , 2006 , pp. 631 -- 636 . J. Leskovec and C. Faloutsos, \"Sampling from large graphs,\" in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2006, pp. 631--636."}],"event":{"name":"ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Vancouver British Columbia Canada","acronym":"ASONAM '19"},"container-title":["Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342937","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341161.3342937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:58Z","timestamp":1750206358000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342937"}},"subtitle":["an OPtimal transport algorithm for NEtwork alignment"],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":21,"alternative-id":["10.1145\/3341161.3342937","10.1145\/3341161"],"URL":"https:\/\/doi.org\/10.1145\/3341161.3342937","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2020-01-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}