2 papers
cs.DS2026
New Greedy Spanners and Applications
Elizaveta Popova, Elad Tzalik
We present a simple greedy procedure to compute an -spanner for a graph . We then show that this procedure is useful for building fault-tolerant spanners, as well as sp…
math.CO2025
Satisfying sequences for rainbow partite matchings
Andrey Kupavskii, Elizaveta Popova
Let be a collection of families. In this paper, we address the following question: for which sequences the co…