9 citations · 22 across the 20 of their papers we have counts for
3 papers · 1 filter
Computing Coverage Kernels Under Restricted Settings
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
We consider the Minimum Coverage Kernel problem: given a set of -dimensional boxes, find a subset of of minimum size covering the same region as . This problem is $\m…
On the Diameter of Tree Associahedra
Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero
We consider a natural notion of search trees on graphs, which we show is ubiquitous in various areas of discrete mathematics and computer science. Search trees on graphs can be mod…
Colored ray configurations
Ruy Fabila-Monroy, Alfredo García, Ferran Hurtado +6
We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays a…