3 papers
math.MG2026
Shortest paths in planar domains with hyperbolic type metrics
Shuliang Gao, Anni Hakanen, Antti Rasila +1
We study planar domains equipped with a hyperbolic type metric and approximate geodesics that join two points and their lengths. We present an algorithm that enable…
math.CO2026
Algorithms and hardness for Metric Dimension on digraphs
Antoine Dailly, Florent Foucaud, Anni Hakanen
In the Metric Dimension problem, one asks for a minimum-size set of vertices such that for any pair of vertices of the graph, there is a vertex from whose two distances to…
cs.DM2025
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to…