{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:43Z","timestamp":1773481843287,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Sandia National Laboratories"},{"name":"NSF","award":["CCF-1919021"],"award-info":[{"award-number":["CCF-1919021"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3534540.3534694","type":"proceedings-article","created":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T22:31:35Z","timestamp":1653345095000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Batch dynamic algorithm to find\n            <i>k<\/i>\n            -core hierarchies"],"prefix":"10.1145","author":[{"given":"Kasimir","family":"Gabert","sequence":"first","affiliation":[{"name":"Sandia National Laboratories"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00dcmit V.","family":"\u00c7ataly\u00fcrek","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297918"},{"key":"e_1_3_2_1_2_1","volume-title":"k-core decomposition: a tool for the analysis of large scale internet graphs. arXiv preprint cs.NI\/0511007","author":"Alvarez-Hamelin I.","year":"2005","unstructured":"I. Alvarez-Hamelin , L. Dall'Asta , A. Barrat , and A. Vespignani . k-core decomposition: a tool for the analysis of large scale internet graphs. arXiv preprint cs.NI\/0511007 , 2005 . I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani. k-core decomposition: a tool for the analysis of large scale internet graphs. arXiv preprint cs.NI\/0511007, 2005."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933267.2933299"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59416-9_42"},{"key":"e_1_3_2_1_5_1","volume-title":"Efficient and effective community search. Data mining and knowledge discovery, 29(5):1406--1433","author":"Barbieri N.","year":"2015","unstructured":"N. Barbieri , F. Bonchi , E. Galimberti , and F. Gullo . Efficient and effective community search. Data mining and knowledge discovery, 29(5):1406--1433 , 2015 . N. Barbieri, F. Bonchi, E. Galimberti, and F. Gullo. Efficient and effective community search. Data mining and knowledge discovery, 29(5):1406--1433, 2015."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_8_1","volume-title":"Cohesive subgraphs for social network analysis. National security agency technical report, 16:3--1","author":"Cohen J.","year":"2008","unstructured":"J. Cohen . Trusses : Cohesive subgraphs for social network analysis. National security agency technical report, 16:3--1 , 2008 . J. Cohen. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, 16:3--1, 2008."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.79"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.062819"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0482-5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380756"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0195843"},{"key":"e_1_3_2_1_17_1","volume-title":"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Workshop on Parallel and Distributed Processing for Computational Social Systems (ParSocial). IEEE","author":"Gabert K.","year":"2021","unstructured":"K. Gabert , A. Pinar , and U. V. \u00c7ataly\u00fcrek . Shared-memory scalable k-core maintenance on dynamic graphs and hypergraphs . In 2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Workshop on Parallel and Distributed Processing for Computational Social Systems (ParSocial). IEEE , May 2021 . K. Gabert, A. Pinar, and U. V. \u00c7ataly\u00fcrek. Shared-memory scalable k-core maintenance on dynamic graphs and hypergraphs. In 2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Workshop on Parallel and Distributed Processing for Computational Social Systems (ParSocial). IEEE, May 2021."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441790"},{"key":"e_1_3_2_1_19_1","volume-title":"Core decomposition in multilayer networks: theory, algorithms, and applications. ACM Transactions on Knowledge Discovery from Data (TKDD), 14(1):1--40","author":"Galimberti E.","year":"2020","unstructured":"E. Galimberti , F. Bonchi , F. Gullo , and T. Lanciano . Core decomposition in multilayer networks: theory, algorithms, and applications. ACM Transactions on Knowledge Discovery from Data (TKDD), 14(1):1--40 , 2020 . E. Galimberti, F. Bonchi, F. Gullo, and T. Lanciano. Core decomposition in multilayer networks: theory, algorithms, and applications. ACM Transactions on Knowledge Discovery from Data (TKDD), 14(1):1--40, 2020."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.7717\/peerj.3321"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0060159"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2960226"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2835441"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2019.10.004"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335170"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_28_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3446095.3446099"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389744"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313522"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2020.3026574"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"e_1_3_2_1_36_1","volume-title":"Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM (JACM), 30(3):417--427","author":"Matula D. W.","year":"1983","unstructured":"D. W. Matula and L. L. Beck . Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM (JACM), 30(3):417--427 , 1983 . D. W. Matula and L. L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM (JACM), 30(3):417--427, 1983."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021927"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612692"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_1_43_1","volume-title":"International scientific conference and international workshop present day trends of innovations","author":"Takac L.","year":"2012","unstructured":"L. Takac and M. Zabovsky . Data analysis in public social networks . In International scientific conference and international workshop present day trends of innovations , volume 1 , 2012 . L. Takac and M. Zabovsky. Data analysis in public social networks. In International scientific conference and international workshop present day trends of innovations, volume 1, 2012."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1523\/JNEUROSCI.3539-11.2011"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00023"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300082"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.93"},{"key":"e_1_3_2_1_49_1","first-page":"1","volume-title":"World Wide Web","author":"Zhou W.","year":"2020","unstructured":"W. Zhou , H. Huang , Q.-S. Hua , D. Yu , H. Jin , and X. Fu . Core decomposition and maintenance in weighted graph . World Wide Web , pages 1 -- 21 , 2020 . W. Zhou, H. Huang, Q.-S. Hua, D. Yu, H. Jin, and X. Fu. Core decomposition and maintenance in weighted graph. World Wide Web, pages 1--21, 2020."}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia Pennsylvania","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences &amp; Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534540.3534694","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3534540.3534694","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534540.3534694","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534540.3534694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:10Z","timestamp":1750186810000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534540.3534694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":49,"alternative-id":["10.1145\/3534540.3534694","10.1145\/3534540"],"URL":"https:\/\/doi.org\/10.1145\/3534540.3534694","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}