M. Saghafian

activity

20112026

most citedOn a Bounded Budget Network Creation Game

24 citations · 37 across the 21 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.CG2026

Lunar Generalizations of the Euclidean Minimum Spanning Tree in the Plane and their Expected Costs

Ondřej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier +1

Motivated by the recent introduction of chromatic persistent homology, we generalize the Euclidean minimum spanning tree (EMST) for $n$ points in $R^{2}$ to the lunar EMST f…

cs.CG2026

How Close is a Tree to a Euclidean Minimum Spanning Tree?

Todor Antić, Jiří Fiala, Jelena Glišić +8

Let $Γ$ be a straight-line crossing-free drawing of a tree $T$ . A \emph{bad pair} in $Γ$ is a pair of non-adjacent vertices of $T$ whose Euclidean distance in $Γ$ is smaller than t…

cs.CG2026

How many times can two minimum spanning trees cross?

Todor Antić, Morteza Saghafian, Maria Saumell +3

Let $P$ be a generic set of $n$ points in the plane, and let $P = R \cup B$ be a coloring of $P$ in two colors. We are interested in the number of crossings between the minimum spanni…