The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Designing matched transmit and receive filters such that their combination satisfies the Nyquist condition is a classical problem in digital communication systems. In this paper, ...