{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:18:20Z","timestamp":1742912300779,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10801-4_2","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"21-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distance-Based Community Search (Invited Talk Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Bonchi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/1.9781611972832.5","volume-title":"Proceedings of the 2013 SIAM International Conference on Data Mining","author":"Leman Akoglu","year":"2013","unstructured":"Akoglu, L., et al.: Mining connection pathways for marked nodes in large graphs. In: SDM (2013)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Lang, K.J.: Communities from seed sets. In: WWW (2006)","DOI":"10.1145\/1135777.1135814"},{"issue":"5","key":"2_CR3","first-page":"1406","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. DAMI 29(5), 1406\u20131433 (2015)","journal-title":"DAMI"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.17730\/humo.7.3.f4033344851gl053","volume":"7","author":"A Bavelas","year":"1948","unstructured":"Bavelas, A.: A mathematical model of group structure. Hum. Organ. 7, 16\u201330 (1948)","journal-title":"Hum. Organ."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Burt, R.: Structural Holes: The Social Structure of Competition. Harvard University Press (1992)","DOI":"10.4159\/9780674029095"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: SIGMOD (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: KDD (2004)","DOI":"10.1145\/1014052.1014068"},{"issue":"12","key":"2_CR8","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS 99(12), 7821\u20137826 (2002)","journal-title":"PNAS"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD (2003)","DOI":"10.1145\/956750.956769"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kloumann, I.M., Kleinberg, J.M.: Community membership identification from small seed sets. In: KDD (2014)","DOI":"10.1145\/2623330.2623621"},{"issue":"5757","key":"2_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1126\/science.1116869","volume":"311","author":"G Kossinets","year":"2006","unstructured":"Kossinets, G., Watts, D.J.: Empirical analysis of an evolving social network. Science 311(5757), 88\u201390 (2006)","journal-title":"Science"},{"issue":"19","key":"2_CR12","doi-asserted-by":"publisher","first-page":"198701","DOI":"10.1103\/PhysRevLett.87.198701","volume":"87","author":"V Latora","year":"2001","unstructured":"Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Phys. Rev. Lett. 87(19), 198701 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"3\u20134","key":"2_CR13","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0378-4371(00)00311-3","volume":"285","author":"M Marchiori","year":"2000","unstructured":"Marchiori, M., Latora, V.: Harmony in the small-world. Phys. A: Stat. Mech. Appl. 285(3\u20134), 539\u2013546 (2000)","journal-title":"Phys. A: Stat. Mech. Appl."},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1093\/bib\/bbp057","volume":"11","author":"T Przytycka","year":"2010","unstructured":"Przytycka, T., Singh, M., Slonim, D.: Toward the dynamic interactome: it\u2019s about time. Brief. Bioinform. 11(1), 15\u201329 (2010). https:\/\/doi.org\/10.1093\/bib\/bbp057","journal-title":"Brief. Bioinform."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Ruchansky, N., Bonchi, F., Garc\u00eda-Soriano, D., Gullo, F., Kourtellis, N.: The minimum wiener connector problem. In: SIGMOD (2015)","DOI":"10.1145\/2723372.2749449"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Ruchansky, N., Bonchi, F., Garc\u00eda-Soriano, D., Gullo, F., Kourtellis, N.: To be connected, or not to be connected: that is the minimum inefficiency subgraph problem. In: CIKM (2017)","DOI":"10.1145\/3132847.3132991"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD, pp. 404\u2013413 (2006)","DOI":"10.1145\/1150402.1150448"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1021\/ja01193a005","volume":"69","author":"H Wiener","year":"1947","unstructured":"Wiener, H.: Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69(1), 17\u201320 (1947)","journal-title":"J. Am. Chem. Soc."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:15:20Z","timestamp":1709810120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}