{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T20:39:49Z","timestamp":1776112789914,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T00:00:00Z","timestamp":1288051200000},"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":[[2010,10,26]]},"DOI":"10.1145\/1871437.1871515","type":"proceedings-article","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T12:36:11Z","timestamp":1288096571000},"page":"599-608","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":94,"title":["Power in unity"],"prefix":"10.1145","author":[{"given":"Aris","family":"Anagnostopoulos","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}]},{"given":"Luca","family":"Becchetti","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}]},{"given":"Carlos","family":"Castillo","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona, Spain"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona, Spain"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2010,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of WWW","author":"Abrol M.","year":"2002","unstructured":"M. Abrol , U. Mahadevan , K. McCracken , R. Mukherjee , and P. Raghavan . Social networks for enterprise webs . In Proc. of WWW , 2002 . M. Abrol, U. Mahadevan, K. McCracken, R. Mukherjee, and P. Raghavan. Social networks for enterprise webs. In Proc. of WWW, 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"e_1_3_2_1_3_1","volume-title":"Theoret. Comp. Sci","author":"Azar Y.","year":"1992","unstructured":"Y. Azar . On-line load balancing . In Theoret. Comp. Sci . Springer , 1992 . Y. Azar. On-line load balancing. In Theoret. Comp. Sci. Springer, 1992."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of SODA","author":"Azar Y.","year":"1992","unstructured":"Y. Azar , J. Naor , and R. Rom . The competitiveness of on-line assignments . In Proc. of SODA , 1992 . Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. In Proc. of SODA, 1992."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148181"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. of IJCAI","author":"Balog K.","year":"2007","unstructured":"K. Balog and M. De Rijke . Determining expert profiles (with an application to expert finding) . In Proc. of IJCAI , San Francisco, CA, USA , 2007 . Morgan Kaufmann . K. Balog and M. De Rijke. Determining expert profiles (with an application to expert finding). In Proc. of IJCAI, San Francisco, CA, USA, 2007. Morgan Kaufmann."},{"key":"e_1_3_2_1_7_1","volume-title":"Online computation and competitive analysis","author":"Borodin A.","year":"1998","unstructured":"A. Borodin and R. El-Yaniv . Online computation and competitive analysis . Cambridge University Press , 1998 . A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998."},{"key":"e_1_3_2_1_8_1","volume-title":"The Mythical Man-Month: Essays on Software Engineering","author":"Brooks F. P.","year":"1995","unstructured":"F. P. Brooks . The Mythical Man-Month: Essays on Software Engineering . Addison-Wesley Professional , 1995 . F. P. Brooks. The Mythical Man-Month: Essays on Software Engineering. Addison-Wesley Professional, 1995."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956965"},{"key":"e_1_3_2_1_10_1","volume-title":"A greedy heuristic for the set-covering problem. Math. of Operations Research, 4(3)","author":"Chvatal V.","year":"1979","unstructured":"V. Chvatal . A greedy heuristic for the set-covering problem. Math. of Operations Research, 4(3) , 1979 . V. Chvatal. A greedy heuristic for the set-covering problem. Math. of Operations Research, 4(3), 1979."},{"key":"e_1_3_2_1_11_1","series-title":"Inf","volume-title":"of 14th TREC","author":"Craswell N.","year":"2005","unstructured":"N. Craswell , A. P. de Vries , and I. Soboroff , editors. Proc . of 14th TREC , volume 500- 266 of Inf . Tech. Lab. NIST Special Pubs. NIST , 2005 . N. Craswell, A. P. de Vries, and I. Soboroff, editors. Proc. of 14th TREC, volume 500-266 of Inf. Tech. Lab. NIST Special Pubs. NIST, 2005."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of AusWeb","author":"Craswell N.","year":"2001","unstructured":"N. Craswell , D. Hawking , A. marie Vercoustre , and P. Wilkins . P@noptic expert: Searching for experts not just for documents . In Proc. of AusWeb , 2001 . N. Craswell, D. Hawking, A. marie Vercoustre, and P. Wilkins. P@noptic expert: Searching for experts not just for documents. In Proc. of AusWeb, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.29"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1568639"},{"key":"e_1_3_2_1_15_1","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029561","volume-title":"Online algorithms","author":"Fiat A.","year":"1998","unstructured":"A. Fiat and G. J. Woeginger , editors . Online algorithms , volume 1442 of LNCS . Springer , 1998 . A. Fiat and G. J. Woeginger, editors. Online algorithms, volume 1442 of LNCS. Springer, 1998."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1478873.1478901"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_1_18_1","volume-title":"Online algorithms","author":"Leonardi S.","year":"1998","unstructured":"S. Leonardi . On-line network routing . In A. Fiat and G. J. Woeginger, editors, Online algorithms . Springer , 1998 . S. Leonardi. On-line network routing. In A. Fiat and G. J. Woeginger, editors, Online algorithms. Springer, 1998."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_1"},{"key":"e_1_3_2_1_20_1","volume-title":"An analysis of the approximations for maximizing submodular set functions. Math. Programming, (14)","author":"Nemhauser G.","year":"1978","unstructured":"G. Nemhauser , L. Wolsey , and M. Fisher . An analysis of the approximations for maximizing submodular set functions. Math. Programming, (14) , 1978 . G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Math. Programming, (14), 1978."},{"key":"e_1_3_2_1_21_1","volume-title":"The Power of Organizing Without Organizations","author":"Shirky C.","year":"2008","unstructured":"C. Shirky . Here Comes Everybody : The Power of Organizing Without Organizations . Penguin Press , 2008 . C. Shirky. Here Comes Everybody: The Power of Organizing Without Organizations. Penguin Press, 2008."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_23_1","volume-title":"Approximation algorithms","author":"Vazirani V. V.","year":"2001","unstructured":"V. V. Vazirani . Approximation algorithms . Springer , 2001 . V. V. Vazirani. Approximation algorithms. Springer, 2001."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242603"}],"event":{"name":"CIKM '10: International Conference on Information and Knowledge Management","location":"Toronto ON Canada","acronym":"CIKM '10","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 19th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871515","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1871437.1871515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:48Z","timestamp":1750244388000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871515"}},"subtitle":["forming teams in large-scale community systems"],"short-title":[],"issued":{"date-parts":[[2010,10,26]]},"references-count":24,"alternative-id":["10.1145\/1871437.1871515","10.1145\/1871437"],"URL":"https:\/\/doi.org\/10.1145\/1871437.1871515","relation":{},"subject":[],"published":{"date-parts":[[2010,10,26]]},"assertion":[{"value":"2010-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}