1 citations · 1 across the 3 of their papers we have counts for
4 papers
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 . A \emph{bad pair} in is a pair of non-adjacent vertices of whose Euclidean distance in is smaller than t…
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 is a pair of sets of Bo…
Reconfigurations of Plane Caterpillars and Paths
Todor Antić, Guillermo Gamboa Quintero, Jelena Glišić
Let be a point set in the plane, and sets of all plane spanning paths and caterpillars on . We study reconfiguration operations on $\mathca…
Star-Forest Decompositions of Complete Graphs
Todor Antić, Jelena Glišić, Milan Milivojčević
We deal with the problem of decomposing a complete geometric graph into plane star-forests. In particular, we disprove a recent conjecture by Pach, Saghafian and Schnider by constr…