{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:42:12Z","timestamp":1773895332181,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366423.3380264","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:11:44Z","timestamp":1588579904000},"page":"1966-1976","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Provably and Efficiently Approximating Near-cliques using the Tur\u00e1n Shadow: PEANUTS"],"prefix":"10.1145","author":[{"given":"Shweta","family":"Jain","sequence":"first","affiliation":[{"name":"University of California Santa Cruz"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[{"name":"University of California Santa Cruz"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Cycles and Other Small Subgraphs Within Large Graphs. In Symposium on the Theory of Computing (STOC)(Montreal","author":"Alon Noga","year":"1994"},{"key":"e_1_3_2_1_2_1","unstructured":"J\u00a0Ignacio Alvarez-Hamelin Luca Dall\u2019Asta Alain Barrat and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in neural information processing systems. 41\u201350.  J\u00a0Ignacio Alvarez-Hamelin Luca Dall\u2019Asta Alain Barrat and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in neural information processing systems. 41\u201350."},{"key":"e_1_3_2_1_3_1","volume-title":"Finding Dense Subgraphs with Size Bounds. In Workshop on Algorithms and Models for the Web-Graph (WAW). 25\u201337","author":"Andersen R."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"L. Becchetti P. Boldi C. Castillo and A. Gionis. 2008. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In KDD\u201908. 16\u201324. https:\/\/doi.org\/10.1145\/1401890.1401898  L. Becchetti P. Boldi C. Castillo and A. Gionis. 2008. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In KDD\u201908. 16\u201324. https:\/\/doi.org\/10.1145\/1401890.1401898","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.87"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of International Conference on Data Mining. 737\u2013742","author":"Bordino I."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Marco Bressan Flavio Chierichetti Ravi Kumar Stefano Leucci and Alessandro Panconesi. 2018. Motif Counting Beyond Five Nodes. ACM Transactions on Knowledge Discovery from Data (TKDD) 12 4(2018) 48.  Marco Bressan Flavio Chierichetti Ravi Kumar Stefano Leucci and Alessandro Panconesi. 2018. Motif Counting Beyond Five Nodes. ACM Transactions on Knowledge Discovery from Data (TKDD) 12 4(2018) 48.","DOI":"10.1145\/3186586"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055502"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"Dubhashi Devdatt","DOI":"10.1017\/CBO9780511581274"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883082"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2794080"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0029"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0171428"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1086\/224954"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052636"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_21_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Kane M"},{"key":"e_1_3_2_1_22_1","volume-title":"Trawling the Web for emerging cyber-communities. Computer networks 31, 11-16","author":"Kumar Ravi","year":"1999"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87481-2_3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"R. Milo S. Shen-Orr S. Itzkovitz N. Kashtan D. Chklovskii and U. Alon. 2002. Network motifs: Simple building blocks of complex networks. Science 298 5594 (2002) 824\u2013827.  R. Milo S. Shen-Orr S. Itzkovitz N. Kashtan D. Chklovskii and U. Alon. 2002. Network motifs: Simple building blocks of complex networks. Science 298 5594 (2002) 824\u2013827.","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_27_1","volume-title":"Handbook of Optimization in Complex Networks","author":"Pattillo Jeffrey"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/14100018X"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Ahmet\u00a0Erdem Sariy\u00fcce C. Seshadhri Ali Pinar and \u00dcmit\u00a0V. \u00c7ataly\u00fcrek. 2015. Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. (2015) 927\u2013937.  Ahmet\u00a0Erdem Sariy\u00fcce C. Seshadhri Ali Pinar and \u00dcmit\u00a0V. \u00c7ataly\u00fcrek. 2015. Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. (2015) 927\u2013937.","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056109"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54241-6_2"},{"key":"e_1_3_2_1_35_1","volume-title":"Classification of weighted networks through mesoscale homological features. Journal of Complex Networks 10.1093","author":"Sizemore Ann","year":"2016"},{"key":"e_1_3_2_1_36_1","unstructured":"SNAP [n.d.]. Stanford Network Analysis Project (SNAP). Available at http:\/\/snap.stanford.edu\/.  SNAP [n.d.]. Stanford Network Analysis Project (SNAP). Available at http:\/\/snap.stanford.edu\/."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. ArnetMiner: Extraction and Mining of Academic Social Networks. In KDD\u201908. 990\u2013998.  Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. ArnetMiner: Extraction and Mining of Academic Social Networks. In KDD\u201908. 990\u2013998.","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_1_38_1","volume-title":"Densest Subgraph: Extracting Optimal Quasi-cliques with Quality Guarantees. In Knowledge Data and Discovery (KDD).","author":"Tsourakakis C.","year":"2013"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_40_1","unstructured":"Charalampos\u00a0E. Tsourakakis Jakub\u00a0W. Pachocki and Michael Mitzenmacher. 2016. Scalable motif-aware graph clustering. CoRR abs\/1606.06235(2016). http:\/\/arxiv.org\/abs\/1606.06235  Charalampos\u00a0E. Tsourakakis Jakub\u00a0W. Pachocki and Michael Mitzenmacher. 2016. Scalable motif-aware graph clustering. CoRR abs\/1606.06235(2016). http:\/\/arxiv.org\/abs\/1606.06235"},{"key":"e_1_3_2_1_41_1","volume-title":"WWW, Daniel Schwabe, Virg\u00edlio A.\u00a0F","author":"Ugander Johan"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Pinghui Wang John Lui Bruno Ribeiro Don Towsley Junzhou Zhao and Xiaohong Guan. 2014. Efficiently estimating motif statistics of large networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 9 2(2014) 8.  Pinghui Wang John Lui Bruno Ribeiro Don Towsley Junzhou Zhao and Xiaohong Guan. 2014. Efficiently estimating motif statistics of large networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 9 2(2014) 8.","DOI":"10.1145\/2629564"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.51"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl014"}],"event":{"name":"WWW '20: The Web Conference 2020","location":"Taipei Taiwan","acronym":"WWW '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of The Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380264","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:10Z","timestamp":1750199590000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":46,"alternative-id":["10.1145\/3366423.3380264","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380264","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}