{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:43Z","timestamp":1750307083592,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"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":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339768","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"1512-1515","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Visual exploration of collaboration networks based on graph degeneracy"],"prefix":"10.1145","author":[{"given":"Christos","family":"Giatsidis","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Berberich","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[{"name":"National & Kapodistrian University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michalis","family":"Vazirgiannis","sequence":"additional","affiliation":[{"name":"Athens University of Economics, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049","author":"Batagelj V.","year":"2003","unstructured":"V. Batagelj and M. Zaversnik . An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049 , 2003 . V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049, 2003."},{"key":"e_1_3_2_1_2_1","first-page":"35","volume-title":"Graph theory and combinatorics","author":"Bollob\u00e1s B.","year":"1983","unstructured":"B. Bollob\u00e1s . The evolution of sparse graphs . In Graph theory and combinatorics (Cambridge, 1983 ), pages 35 -- 57 . Academic Press , London, 1984. B. Bollob\u00e1s. The evolution of sparse graphs. In Graph theory and combinatorics (Cambridge, 1983), pages 35--57. Academic Press, London, 1984."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-006-0144-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02759702"},{"key":"e_1_3_2_1_5_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s P.","year":"1960","unstructured":"P. Erd\u0151s and A. R\u00e9nyi . On the evolution of random graphs . Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. , 5 : 17 -- 61 , 1960 . P. Erd\u0151s and A. R\u00e9nyi. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl., 5:17--61, 1960.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.65"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0507655102"},{"key":"e_1_3_2_1_8_1","first-page":"481","article-title":"A min--max theorem for graphs with application to graph coloring","volume":"10","author":"Matula D. W.","year":"1968","unstructured":"D. W. Matula . A min--max theorem for graphs with application to graph coloring . SIAM Reviews , 10 : 481 -- 482 , 1968 . D. W. Matula. A min--max theorem for graphs with application to graph coloring. SIAM Reviews, 10:481--482, 1968.","journal-title":"SIAM Reviews"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1996.0036"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(68)80081-X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90162-U"}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Beijing China","acronym":"KDD '12"},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339768","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:18Z","timestamp":1750239258000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":11,"alternative-id":["10.1145\/2339530.2339768","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339768","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}