{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T23:27:18Z","timestamp":1783466838715,"version":"3.55.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319905297","type":"print"},{"value":"9783319905303","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-90530-3_8","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"78-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Can We Create Large k-Cores by Adding Few Edges?"],"prefix":"10.1007","author":[{"given":"Rajesh","family":"Chitnis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"key":"8_CR1","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the $$k$$-core decomposition. In: NIPS 2005, pp. 41\u201350 (2005)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-46648-7_9","volume-title":"Graph Drawing","author":"V Batagelj","year":"1999","unstructured":"Batagelj, V., Mrvar, A., Zaver\u0161nik, M.: Partitioning approach to visualization of large graphs. In: Kratochv\u00edyl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 90\u201397. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46648-7_9"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-31843-9_6","volume-title":"Graph Drawing","author":"M Baur","year":"2005","unstructured":"Baur, M., Brandes, U., Gaertler, M., Wagner, D.: Drawing the AS graph in 2.5 dimensions. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 43\u201348. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_6"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1137\/14097032X","volume":"29","author":"K Bhawalkar","year":"2015","unstructured":"Bhawalkar, K., Kleinberg, J.M., Lewi, K., Roughgarden, T., Sharma, A.: Preventing unraveling in social networks: the anchored $$k$$-core problem. SIAM J. Discret. Math. 29(3), 1452\u20131475 (2015)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ic.2015.11.002","volume":"247","author":"R Chitnis","year":"2016","unstructured":"Chitnis, R., Fomin, F.V., Golovach, P.A.: Parameterized complexity of the anchored $$k$$-core problem for directed graphs. Inf. Comput. 247, 11\u201322 (2016)","journal-title":"Inf. Comput."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Chitnis, R.H., Fomin, F.V., Golovach, P.A.: Preventing unraveling in social networks gets harder. In: Proceedings of AAAI 2013 (2013)","DOI":"10.1609\/aaai.v27i1.8462"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1086\/210269","volume":"105","author":"M Chwe","year":"1999","unstructured":"Chwe, M.: Structure and strategy in collective action 1. Am. J. Sociol. 105(1), 128\u2013156 (1999)","journal-title":"Am. J. Sociol."},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/1467-937X.00118","volume":"67","author":"M Chwe","year":"2000","unstructured":"Chwe, M.: Communication and coordination in social networks. Rev. Econ. Stud. 67(1), 1\u201316 (2000)","journal-title":"Rev. Econ. Stud."},{"issue":"5","key":"8_CR10","doi-asserted-by":"publisher","first-page":"055103","DOI":"10.1103\/PhysRevE.65.055103","volume":"65","author":"Z Dezs\u0151","year":"2002","unstructured":"Dezs\u0151, Z., Barab\u00e1si, A.: Halting viruses in scale-free networks. Phys. Rev. E 65(5), 055103 (2002)","journal-title":"Phys. Rev. E"},{"key":"8_CR11","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Du, N., Wu, B., Pei, X., Wang, B., Xu, L.: Community detection in large-scale social networks. In: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, pp. 16\u201325. ACM (2007)","DOI":"10.1145\/1348549.1348552"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez-Bunster, T., Stege, U., Thomo, A., Taylor, J.: How do biological networks differ from social networks? (an experimental study). In: ASONAM, pp. 744\u2013751 (2014)","DOI":"10.1109\/ASONAM.2014.6921669"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth, Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s13278-013-0122-z","volume":"3","author":"N Korovaiko","year":"2013","unstructured":"Korovaiko, N., Thomo, A.: Trust prediction from user-item ratings. Soc. Netw. Anal. Min. 3(3), 749\u2013759 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.socnet.2007.09.002","volume":"30","author":"RT Mikolajczyk","year":"2008","unstructured":"Mikolajczyk, R.T., Kretzschmar, M.: Collecting social contact data in the context of disease transmission: prospective and retrospective study designs. Soc. Netw. 30(2), 127\u2013135 (2008)","journal-title":"Soc. Netw."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Pandit, S., Chau, D.H., Wang, S., Faloutsos, C.: NetProbe: a fast and scalable system for fraud detection in online auction networks. In: Proceedings of the 16th International Conference on World Wide Web, pp. 201\u2013210. ACM (2007)","DOI":"10.1145\/1242572.1242600"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media. Data Min. Knowl. Discov. 24(3), 515\u2013554 (2012)","journal-title":"Data Min. Knowl. Discov."},{"issue":"14","key":"8_CR20","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras, R., Vespignani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86(14), 3200\u20133203 (2001)","journal-title":"Phys. Rev. Lett."},{"key":"8_CR21","unstructured":"S\u00e4\u00e4skilahti, P.: Monopoly pricing of social goods. Technical report. University Librray of Munich (2007)"},{"key":"8_CR22","volume-title":"Micromotives and Macrobehavior","author":"T Schelling","year":"1978","unstructured":"Schelling, T.: Micromotives and Macrobehavior. W. W. Norton, New York City (1978)"},{"issue":"3","key":"8_CR23","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S Seidman","year":"1983","unstructured":"Seidman, S.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"3","key":"8_CR24","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1016\/j.eswa.2007.02.028","volume":"34","author":"W-S Yang","year":"2008","unstructured":"Yang, W.-S., Dia, J.-B.: Discovering cohesive subgroups from social networks for targeted advertising. Expert Syst. Appl. 34(3), 2029\u20132038 (2008)","journal-title":"Expert Syst. Appl."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90530-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:29:38Z","timestamp":1710242978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}