{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:34:10Z","timestamp":1790750050318,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":67,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"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":[[2019,6,25]]},"DOI":"10.1145\/3299869.3324962","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"1006-1023","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":62,"title":["Distance-generalized Core Decomposition"],"prefix":"10.1145","author":[{"given":"Francesco","family":"Bonchi","sequence":"first","affiliation":[{"name":"ISI Foundation & Eurecat, Turin, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arijit","family":"Khan","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Severini","sequence":"additional","affiliation":[{"name":"ISI Foundation, Turin, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1973.9989826"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21455"},{"key":"e_1_3_2_1_4_1","volume-title":"NIPS","author":"J.","year":"2005","unstructured":"J. I. Alvarez-Hamelin et al. Large Scale Networks Fingerprinting and Visualization using the k-core Decomposition . In NIPS , 2005 . J. I. Alvarez-Hamelin et al. Large Scale Networks Fingerprinting and Visualization using the k-core Decomposition. In NIPS, 2005."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1062"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2380718.2380723"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-4-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-005-1857-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-010-0079-y"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623655"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00047-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0605034"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-012-0263-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557142"},{"key":"e_1_3_2_1_21_1","volume-title":"ISAAC","author":"Eppstein D.","year":"2010","unstructured":"D. Eppstein , M. L\u00f6ffler , and D. Strash . Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time . In ISAAC , 2010 . D. Eppstein, M. L\u00f6ffler, and D. Strash. Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. In ISAAC, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0482-5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271767"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132993"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/14\/8\/083030"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512946"},{"key":"e_1_3_2_1_28_1","volume-title":"D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy. KAIS, 35(2)","author":"Giatsidis C.","year":"2013","unstructured":"C. Giatsidis , D. M. Thilikos , and M. Vazirgiannis . D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy. KAIS, 35(2) , 2013 . C. Giatsidis, D. M. Thilikos, and M. Vazirgiannis. D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy. KAIS, 35(2), 2013."},{"key":"e_1_3_2_1_29_1","volume-title":"VLDB","author":"Gibson D.","year":"2005","unstructured":"D. Gibson , R. Kumar , and A. Tomkins . Discovering Large Dense Subgraphs in Massive graphs . In VLDB , 2005 . D. Gibson, R. Kumar, and A. Tomkins. Discovering Large Dense Subgraphs in Massive graphs. In VLDB, 2005."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/894477"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052635"},{"key":"e_1_3_2_1_32_1","volume-title":"WAW","author":"Healy J.","year":"2006","unstructured":"J. Healy , J. Janssen , E. E. Milios , and W. Aiello . Characterization of Graphs Using Degree Cores . In WAW , 2006 . J. Healy, J. Janssen, E. E. Milios, and W. Aiello. Characterization of Graphs Using Degree Cores. In WAW, 2006."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099626"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.211"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"e_1_3_2_1_37_1","first-page":"888","volume":"6","author":"Kitsak M.","year":"2010","unstructured":"M. Kitsak , L. K. Gallos , S. Havlin , F. Liljeros , L. Muchnik , H. E. Stanley , and H. A. Makse . Identifying Influential Spreaders in Complex Networks. Nature Physics 6 , 888 , 2010 . M. Kitsak, L. K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. E. Stanley, and H. A. Makse. Identifying Influential Spreaders in Complex Networks. Nature Physics 6, 888, 2010.","journal-title":"Identifying Influential Spreaders in Complex Networks. Nature Physics"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1032"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289199"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592052"},{"issue":"2","key":"e_1_3_2_1_43_1","first-page":"161","volume":"13","author":"Mokken R.","year":"1979","unstructured":"R. Mokken . Cliques, Clubs and Clans. Quality and Quantity : International Journal of Methodology , 13 ( 2 ): 161 -- 173 , 1979 . R. Mokken. Cliques, Clubs and Clans. Quality and Quantity: International Journal of Methodology, 13(2):161--173, 1979.","journal-title":"International Journal of Methodology"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.124"},{"key":"e_1_3_2_1_45_1","volume-title":"Optimization Letters","author":"Moradi E.","year":"2015","unstructured":"E. Moradi and B. Balasundaram . Finding a Maximum k-Club using the k-Clique Formulation and Canonical Hypercube Cuts . Optimization Letters , 2015 . E. Moradi and B. Balasundaram. Finding a Maximum k-Club using the k-Clique Formulation and Canonical Hypercube Cuts. Optimization Letters, 2015."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2012.02.002"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SERVICES.2014.16"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749449"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021927"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"issue":"5","key":"e_1_3_2_1_53_1","first-page":"883","article-title":"afer, C. Komusiewicz, H. Moser, and R","volume":"6","author":"Sch A.","year":"2012","unstructured":"A. Sch \" afer, C. Komusiewicz, H. Moser, and R . Niedermeier. Parameterized Computational Complexity of Finding Small-Diameter Subgraphs. Optimization Letters , 6 ( 5 ): 883 -- 891 , 2012 . A. Sch\"afer, C. Komusiewicz, H. Moser, and R. Niedermeier. Parameterized Computational Complexity of Finding Small-Diameter Subgraphs. Optimization Letters, 6(5):883--891, 2012.","journal-title":"Niedermeier. Parameterized Computational Complexity of Finding Small-Diameter Subgraphs. Optimization Letters"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"issue":"3","key":"e_1_3_2_1_55_1","first-page":"520","volume":"26","author":"Shahinpour S.","year":"2013","unstructured":"S. Shahinpour and S. Butenko . Algorithms for the Maximum K-Club Problem in Graphs. J. Comb. Optim. , 26 ( 3 ): 520 -- 554 , 2013 . S. Shahinpour and S. Butenko. Algorithms for the Maximum K-Club Problem in Graphs. J. Comb. Optim., 26(3):520--554, 2013.","journal-title":"Algorithms for the Maximum K-Club Problem in Graphs. J. Comb. Optim."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(68)80081-X"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741119"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.10.027"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21622"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_3_2_1_63_1","volume-title":"Peeling the Yeast Protein Network. Proteomics, 5(2)","author":"Wuchty S.","year":"2005","unstructured":"S. Wuchty and E. Almaas . Peeling the Yeast Protein Network. Proteomics, 5(2) , 2005 . S. Wuchty and E. Almaas. Peeling the Yeast Protein Network. Proteomics, 5(2), 2005."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.14778\/3115404.3115406"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0299-0"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.35"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448942"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3324962","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3324962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:23Z","timestamp":1750207403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3324962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":67,"alternative-id":["10.1145\/3299869.3324962","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3324962","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}