Svein Høgemo

According to our database, Svein Høgemo authored at least 8 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees.

Svein Høgemo

CoRR, 2024

Lower Bounds for Leaf Rank of Leaf Powers.

Svein Høgemo

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023

Linear MIM-width of the Square of Trees.

Svein Høgemo

CoRR, 2023

2022

Recognition of Linear and Star Variants of Leaf Powers is in P.

Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021

On Alternative Models for Leaf Powers.

Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle

CoRR, 2021

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

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

Hierarchical Clusterings of Unweighted Graphs.

Svein Høgemo, Christophe Paul, Jan Arne Telle

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Linear MIM-Width of Trees.

Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019