9 citations · 22 across the 20 of their papers we have counts for
3 papers · 1 filter
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…
-covering red and blue points in the plane
Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano +4
We say that a finite set of red and blue points in the plane in general position can be -covered if the set can be partitioned into subsets of size , with points of…
New results on the coarseness of bicolored point sets
J. M. Díaz-Báñez, R. Fabila-Monroy, P. Pérez-Lantero +1
Let be a 2-colored (red and blue) set of points in the plane. A subset of is an island if there exits a convex set such that . The discrepancy of an…