{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:16:04Z","timestamp":1775229364205,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,24]],"date-time":"2011-10-24T00:00:00Z","timestamp":1319414400000},"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":[[2011,10,24]]},"DOI":"10.1145\/2063576.2063718","type":"proceedings-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T10:40:21Z","timestamp":1321440021000},"page":"985-994","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":152,"title":["Discovering top-k teams of experts with\/without a leader in social networks"],"prefix":"10.1145","author":[{"given":"Mehdi","family":"Kargar","sequence":"first","affiliation":[{"name":"York University, Toronto, ON, Canada"}]},{"given":"Aijun","family":"An","sequence":"additional","affiliation":[{"name":"York University, Toronto, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2011,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871515"},{"key":"e_1_3_2_1_2_1","first-page":"36","article-title":"Minimum-diameter covering problems","author":"Arkin E. M.","year":"2000","unstructured":"E. M. Arkin and R. Hassin . Minimum-diameter covering problems . Networks , 36 , 2000 . E. M. Arkin and R. Hassin. Minimum-diameter covering problems. Networks, 36, 2000.","journal-title":"Networks"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1080\/01969720601139041"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2004.12.014"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. of VLDB'98","author":"Goldman R.","year":"1998","unstructured":"R. Goldman , N. Shivakumar , S. Venkatasubramanian , and H. Garcia-Molina . Proximity search in databases . In Proc. of VLDB'98 , 1998 . R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Garcia-Molina. Proximity search in databases. In Proc. of VLDB'98, 1998."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376708"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1057\/978-1-349-95121-5_1984-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021025"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_1_11_1","first-page":"18","article-title":"A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem","author":"Lawler E.","year":"1972","unstructured":"E. Lawler . A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem . Management Science , 18 , 1972 . E. Lawler. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18, 1972.","journal-title":"Management Science"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.12"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.67"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.12.031"}],"event":{"name":"CIKM '11: International Conference on Information and Knowledge Management","location":"Glasgow Scotland, UK","acronym":"CIKM '11","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 20th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063718","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063576.2063718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:11Z","timestamp":1750240451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,24]]},"references-count":14,"alternative-id":["10.1145\/2063576.2063718","10.1145\/2063576"],"URL":"https:\/\/doi.org\/10.1145\/2063576.2063718","relation":{},"subject":[],"published":{"date-parts":[[2011,10,24]]},"assertion":[{"value":"2011-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}