J. Glisic

collaborators

3 papers

cs.CG2026

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

Todor AntiÄ, JiÅÃ Fiala, Jelena GliÅ¡iÄ +8

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

cs.AI2024

Boolean Nearest Neighbor Language in the Knowledge Compilation Map

OndÅej Äepek, Jelena GliÅ¡iÄ

The Boolean Nearest Neighbor (BNN) representation of Boolean functions was recently introduced by Hajnal, Liu and Turan. A BNN representation of $f$ is a pair $(P, N)$ of sets of Bo…

math.CO2024

Reconfigurations of Plane Caterpillars and Paths

Todor AntiÄ, Guillermo Gamboa Quintero, Jelena GliÅ¡iÄ

Let $S$ be a point set in the plane, $P (S)$ and $C (S)$ sets of all plane spanning paths and caterpillars on $S$ . We study reconfiguration operations on $\mathca…