Author of the publication

On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters.

, , , , and . FCT, volume 12867 of Lecture Notes in Computer Science, page 287-300. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Recognition of Linear and Star Variants of Leaf Powers is in P., , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 70-83. Springer, (2022)On Alternative Models for Leaf Powers., , , and . CoRR, (2021)Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees.. CoRR, (2024)Hierarchical Clusterings of Unweighted Graphs., , and . MFCS, volume 170 of LIPIcs, page 47:1-47:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Linear MIM-Width of Trees., , and . WG, volume 11789 of Lecture Notes in Computer Science, page 218-231. Springer, (2019)Lower Bounds for Leaf Rank of Leaf Powers.. CoRR, (2024)Linear MIM-width of the Square of Trees.. CoRR, (2023)On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters., , , , and . FCT, volume 12867 of Lecture Notes in Computer Science, page 287-300. Springer, (2021)