{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T19:11:08Z","timestamp":1751483468475,"version":"3.40.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030461492"},{"type":"electronic","value":"9783030461508"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-46150-8_23","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T01:02:40Z","timestamp":1588294960000},"page":"378-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries"],"prefix":"10.1007","author":[{"given":"Charalampos E.","family":"Tsourakakis","sequence":"first","affiliation":[]},{"given":"Tianyi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Naonori","family":"Kakimura","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Pachocki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"23_CR1","unstructured":"Max-cut with negative weight edges by Peter Shor. https:\/\/cstheory.stackexchange.com\/questions\/2312\/max-cut-with-negative-weight-edges"},{"key":"23_CR2","unstructured":"http:\/\/www.paccanarolab.org\/static_content\/clusterone\/cl1_datasets.zip"},{"key":"23_CR3","unstructured":"Submitted to ECML-PKDD 2019. https:\/\/lastinggems.files.wordpress.com\/2019\/04\/neg-dsd.pdf"},{"key":"23_CR4","unstructured":"TMDB uncertain graph. https:\/\/drive.google.com\/open?id=1C69MndtfSoUflPkeBa0mbiC9FZD6xbpN"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/rsa.20168","volume":"31","author":"B Bollob\u00e1s","year":"2007","unstructured":"Bollob\u00e1s, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1), 3\u2013122 (2007)","journal-title":"Random Struct. Algorithms"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gullo, F., Kaltenbrunner, A., Volkovich, Y.: Core decomposition of uncertain graphs. In: Proceedings of the 20th ACM SIGKDD Conference, pp. 1316\u20131325. ACM (2014)","DOI":"10.1145\/2623330.2623655"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Cadena, J., Vullikanti, A.K., Aggarwal, C.C.: On dense subgraphs in signed network streams. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 51\u201360. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0016"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Collins, S.R., et al.: Toward a comprehensive atlas of the physical interactome of Saccharomyces cerevisiae. Mol. Cell. Proteomics 6(3), 439\u2013450 (2007)","DOI":"10.1074\/mcp.M600381-MCP200"},{"issue":"4","key":"23_CR10","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"NN Dalvi","year":"2007","unstructured":"Dalvi, N.N., Suciu, D.: Efficient query evaluation on probabilistic databases. VLDB J. 16(4), 523\u2013544 (2007)","journal-title":"VLDB J."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Galimberti, E., Bonchi, F., Gullo, F.: Core decomposition and densest subgraph in multilayer networks. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 1807\u20131816. ACM (2017)","DOI":"10.1145\/3132847.3132993"},{"key":"23_CR12","unstructured":"Galimberti, E., Bonchi, F., Gullo, F., Lanciano, T.: Core decomposition in multilayer networks: theory, algorithms, and applications. arXiv preprint arXiv:1812.08712 (2018)"},{"issue":"1","key":"23_CR13","first-page":"30","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. J. Comput. 18(1), 30\u201355 (1989)","journal-title":"J. Comput."},{"issue":"7084","key":"23_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1038\/nature04532","volume":"440","author":"A-C Gavin","year":"2006","unstructured":"Gavin, A.-C., et al.: Proteome survey reveals modularity of the yeast cell machinery. Nature 440(7084), 631 (2006)","journal-title":"Nature"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Gionis, A., Tsourakakis, C.E.: Dense subgraph discovery: KDD 2015 tutorial. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 2313\u20132314. ACM (2015)","DOI":"10.1145\/2783258.2789987"},{"key":"23_CR16","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. Technical report, University of California at Berkeley (1984)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"He, X., Kempe, D.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2016, pp. 885\u2013894. ACM, New York (2016)","DOI":"10.1145\/2939672.2939760"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Jin, R., Liu, L., Aggarwal, C.C.: Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of KDD 2011, pp. 992\u20131000 (2011)","DOI":"10.1145\/2020408.2020569"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of KDD 2003, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-02927-1_50","volume-title":"Automata, Languages and Programming","author":"S Khuller","year":"2009","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 597\u2013608. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_50"},{"key":"23_CR21","unstructured":"Krogan, N.J., et al.: Global landscape of protein complexes in the yeast Saccharomyces cerevisiae. Nature 440(7084), 637 (2006)"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Liu, L., Jin, R., Aggarwal, C., Shen, Y.: Reliable clustering on uncertain graphs. In: Proceedings of ICDM 2012, pp. 459\u2013468. IEEE (2012)","DOI":"10.1109\/ICDM.2012.11"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Miyauchi, A., Takeda, A.: Robust densest subgraph discovery. In: 2018 IEEE International Conference on Data Mining (ICDM), pp. 1188\u20131193. IEEE (2018)","DOI":"10.1109\/ICDM.2018.00157"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Parchas, P., Gullo, F., Papadias, D., Bonchi, F.: The pursuit of a good possible world: extracting representative instances of uncertain graphs. In: Proceedings SIGMOD 2014, pp. 967\u2013978 (2014)","DOI":"10.1145\/2588555.2593668"},{"key":"23_CR25","unstructured":"Pratikakis, P.: twAwler: a lightweight Twitter crawler. arXiv preprint arXiv:1804.07748 (2018)"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-61422-2_121","volume-title":"Algorithm Theory \u2014 SWAT\u201996","author":"R Ravi","year":"1996","unstructured":"Ravi, R., Goemans, M.X.: The constrained minimum spanning tree problem. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 66\u201375. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61422-2_121"},{"issue":"2","key":"23_CR27","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"AE Roth","year":"2004","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Kidney exchange. Q. J. Econ. 119(2), 457\u2013488 (2004)","journal-title":"Q. J. Econ."},{"key":"23_CR28","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.knosys.2014.04.035","volume":"67","author":"J Serra","year":"2014","unstructured":"Serra, J., Arcos, J.L.: An empirical evaluation of similarity measures for time series classification. Knowl.-Based Syst. 67, 305\u2013314 (2014)","journal-title":"Knowl.-Based Syst."},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: The k-clique densest subgraph problem. In: 24th International World Wide Web Conference (WWW) (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2013)","DOI":"10.1145\/2487575.2487645"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Sekar, S., Lam, J., Yang, L.: Risk-averse matchings over uncertain graph databases. arXiv preprint arXiv:1801.03190 (2018)","DOI":"10.1007\/978-3-030-10928-8_5"},{"key":"23_CR32","unstructured":"Zou, Z.: Polynomial-time algorithm for finding densest subgraphs in uncertain graphs. In: Proceedings of MLG Workshop (2013)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46150-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T09:25:44Z","timestamp":1746523544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46150-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461492","9783030461508"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46150-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.org\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"733","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":"130","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":"0","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":"18% - 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.04","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":"5.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)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}