{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:57:05Z","timestamp":1743026225149,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030865924"},{"type":"electronic","value":"9783030865931"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86593-1_20","type":"book-chapter","created":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:26:28Z","timestamp":1631391988000},"page":"287-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Dasgupta\u2019s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters"],"prefix":"10.1007","author":[{"given":"Svein","family":"H\u00f8gemo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Bergougnoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrik","family":"Brandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Abboud, A., Cohen-Addad, V., Klein, P.N.: New hardness results for planar graph problems in p and an algorithm for sparsest cut. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pp. 996\u20131009. ACM (2020). https:\/\/doi.org\/10.1145\/3357713.3384310","DOI":"10.1145\/3357713.3384310"},{"key":"20_CR2","unstructured":"Berendsohn, B.A., Kozma, L.: Splay trees on trees. CoRR, abs\/2010.00931 (2020). arXiv:2010.00931"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"11","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., et al.: Rankings of graphs. SIAM J. Discret. Math. 11(1), 168\u2013181 (1998). https:\/\/doi.org\/10.1137\/S0895480195282550","journal-title":"SIAM J. Discret. Math."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chatziafratis, V.: Approximate hierarchical clustering via sparsest cut and spreading metrics. In: Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841\u2013854 (2017)","DOI":"10.1137\/1.9781611974782.53"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chatziafratis, V., Niazadeh, R.: Hierarchical clustering better than average-linkage. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2291\u20132304 (2019)","DOI":"10.1137\/1.9781611975482.139"},{"issue":"50","key":"20_CR6","doi-asserted-by":"publisher","first-page":"6879","DOI":"10.1016\/j.tcs.2011.08.042","volume":"412","author":"F Cicalese","year":"2011","unstructured":"Cicalese, F., Jacobs, T., Laber, E., Molinaro, M.: On the complexity of searching in trees and partially ordered structures. Theoret. Comput. Sci. 412(50), 6879\u20136896 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1007\/s00453-012-9715-6","volume":"68","author":"F Cicalese","year":"2014","unstructured":"Cicalese, F., Jacobs, T., Laber, E., Molinaro, M.: Improved approximation algorithms for the average-case tree searching problem. Algorithmica 68(4), 1045\u20131074 (2014)","journal-title":"Algorithmica"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Kanade, V., Mallmann-Trenn, F., Mathieu, C.: Hierarchical clustering: objective functions and algorithms. J. ACM 66(4), 26:1\u201326-42 (2019)","DOI":"10.1145\/3321386"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Dasgupta, S.: A cost function for similarity-based hierarchical clustering. In: Annual ACM symposium on Theory of Computing (STOC), pp. 118\u2013127 (2016)","DOI":"10.1145\/2897518.2897527"},{"issue":"6","key":"20_CR10","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/BF01189071","volume":"13","author":"P de la Torre","year":"1995","unstructured":"de la Torre, P., Greenlaw, R., Sch\u00e4ffer, A.A.: Optimal edge ranking of trees in polynomial time. Algorithmica 13(6), 592\u2013618 (1995)","journal-title":"Algorithmica"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/3-540-57785-8_187","volume-title":"STACS 94","author":"JS Deogun","year":"1994","unstructured":"Deogun, J.S., Kloks, T., Kratsch, D., M\u00fcller, H.: On vertex ranking for permutation and other graphs. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 747\u2013758. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57785-8_187"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(99)00179-1","volume":"98","author":"JS Deogun","year":"1999","unstructured":"Deogun, J.S., Kloks, T., Kratsch, D., M\u00fcller, H.: On the vertex ranking problem for trapezoid, circular-arc and other graphs. Discret. Appl. Math. 98(1), 39\u201363 (1999). https:\/\/doi.org\/10.1016\/S0166-218X(99)00179-1","journal-title":"Discret. Appl. Math."},{"key":"20_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory, 5th edn. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","edition":"5"},{"issue":"157","key":"20_CR14","doi-asserted-by":"publisher","first-page":"20190149","DOI":"10.1098\/rsif.2019.0149","volume":"16","author":"S Dong","year":"2019","unstructured":"Dong, S., Wang, H., Mostafavi, A., Gao, J.: Robust component: a robustness measure that incorporates access to critical facilities under disruptions. J. R. Soc. Interface 16(157), 20190149 (2019)","journal-title":"J. R. Soc. Interface"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"H\u00f8gemo, S., Paul, C., Telle, J.A.: Hierarchical clusterings of unweighted graphs. In: International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), vol. 170, pp. 47:1\u201347:13 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.47","DOI":"10.4230\/LIPIcs.MFCS.2020.47"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"H\u00f8gemo, S., Bergougnoux, B., Brandes, U., Paul, C., Telle, J.A.: On dasgupta\u2019s hierarchical clustering objective and its relation to other graph parameters. arXiv preprint arXiv:2105.12093 (2021)","DOI":"10.1007\/978-3-030-86593-1_20"},{"issue":"5","key":"20_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","volume":"28","author":"AV Iyer","year":"1988","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: Optimal node ranking of trees. Inf. Process. Lett. 28(5), 225\u2013229 (1988). https:\/\/doi.org\/10.1016\/0020-0190(88)90194-9","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","volume":"30","author":"AV Iyer","year":"1991","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: On an edge ranking problem of trees and graphs. Discret. Appl. Math. 30(1), 43\u201352 (1991). https:\/\/doi.org\/10.1016\/0166-218X(91)90012-L","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"20_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0166-218X(96)00094-7","volume":"69","author":"Y Jing-Ho","year":"1996","unstructured":"Jing-Ho, Y., Jer-Jeong, C., Chang, G.J.: Quasi-threshold graphs. Discret. Appl. Math. 69(3), 247\u2013255 (1996). https:\/\/doi.org\/10.1016\/0166-218X(96)00094-7","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0166-218X(98)00029-8","volume":"85","author":"TW Lam","year":"1998","unstructured":"Lam, T.W., Yue, F.L.: Edge ranking of graphs is hard. Discret. Appl. Math. 85(1), 71\u201386 (1998). https:\/\/doi.org\/10.1016\/S0166-218X(98)00029-8","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s004530010076","volume":"30","author":"TW Lam","year":"2001","unstructured":"Lam, T.W., Yue, F.L.: Optimal edge ranking of trees in linear time. Algorithmica 30(1), 12\u201333 (2001)","journal-title":"Algorithmica"},{"issue":"3","key":"20_CR22","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.socnet.2013.05.001","volume":"35","author":"J Nastos","year":"2013","unstructured":"Nastos, J., Gao, Y.: Familial groups in social networks. Soc. Netw. 35(3), 439\u2013450 (2013). https:\/\/doi.org\/10.1016\/j.socnet.2013.05.001","journal-title":"Soc. Netw."},{"issue":"6","key":"20_CR23","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1007\/s00373-015-1569-7","volume":"31","author":"J Ne\u0161et\u0159il","year":"2015","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: On low tree-depth decompositions. Graph. Combin. 31(6), 1941\u20131963 (2015)","journal-title":"Graph. Combin."},{"issue":"6","key":"20_CR24","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","volume":"27","author":"J Ne\u0161et\u0159il","year":"2006","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Combin. 27(6), 1022\u20131041 (2006). https:\/\/doi.org\/10.1016\/j.ejc.2005.01.010","journal-title":"Eur. J. Combin."},{"key":"20_CR25","unstructured":"Pothen, A.: The complexity of optimal elimination trees. Technical report (1988)"},{"key":"20_CR26","unstructured":"Roy, A., Pokutta, S.: Hierarchical clustering via spreading metrics. In: Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS 2016, pp. 2324\u20132332 (2016)"},{"issue":"2","key":"20_CR27","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"AA Sch\u00e4ffer","year":"1989","unstructured":"Sch\u00e4ffer, A.A.: Optimal node ranking of trees in linear time. Inf. Process. Lett. 33(2), 91\u201396 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90161-0","journal-title":"Inf. Process. Lett."},{"key":"20_CR28","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discret. Methods 2, 77\u201379 (1981)","journal-title":"SIAM J. Algebraic Discret. Methods"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86593-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:39:14Z","timestamp":1673224754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86593-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865924","9783030865931"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86593-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/fct2021\/","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":"94","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":"30","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":"32% - 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":"8.54","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":"The conference was held virtually due to the COVID-19 pandemic. There are papers of 2 invited talks also included.","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)"}}]}}