87 citations · 137 across the 23 of their papers we have counts for
4 papers · 1 filter
Space-Time Trade-offs for Stack-Based Algorithms
Luis Barba, Matias Korman, Stefan Langerman +2
In memory-constrained algorithms we have read-only access to the input, and the number of additional variables is limited. In this paper we introduce the compressed stack technique…
The Erdős-Sós Conjecture for Geometric Graphs
Luis F. Barba, Ruy Fabila-Monroy, Dolores Lara +4
Let be the minimum number of edges that must be removed from some complete geometric graph on points, so that there exists a tree on vertices that is no longer…
Bichromatic compatible matchings
Greg Aloupis, Luis Barba, Stefan Langerman +1
For a set of red points and a set of blue points, a -matching is a non-crossing geometric perfect matching where each segment has one endpoint in and one in…
Circle separability queries in logarithmic time
Greg Aloupis, Luis Barba, Stefan Langerman
Let be a set of points in the plane. In this paper we study a new variant of the circular separability problem in which a point set is preprocessed so that one can quic…