Linear MIM-Width of Trees. - Svein Høgemo; Jan Arne Telle; Erlend Raa Vågset (WG, 2019)

Hierarchical Clusterings of Unweighted Graphs. - Svein Høgemo; Christophe Paul; Jan Arne Telle (MFCS, 2020)

On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. - Svein Høgemo; Benjamin Bergougnoux; Ulrik Brandes; Christophe Paul; Jan Arne Telle (FCT, 2021)

On Alternative Models for Leaf Powers. - Benjamin Bergougnoux; Svein Høgemo; Jan Arne Telle; Martin Vatshelle (CoRR, 2021)

Recognition of Linear and Star Variants of Leaf Powers is in P. - Benjamin Bergougnoux; Svein Høgemo; Jan Arne Telle; Martin Vatshelle (WG, 2022)

Linear MIM-width of the Square of Trees. - Svein Høgemo (CoRR, 2023)

Lower Bounds for Leaf Rank of Leaf Powers. - Svein Høgemo (IWOCA, 2024)

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees. - Svein Høgemo (WAOA, 2024)