Bichromatic separability with two boxes: A general approach. - Carmen Cortés; José Miguel Díaz-Báñez; Pablo Pérez-Lantero; Carlos Seara; Jorge Urrutia; Inmaculada Ventura (J. Algorithms, 2009)

Locating a Service Facility and a Rapid Transit Line. - José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Inmaculada Ventura (EGC, 2011)

The 1-Center and 1-Highway Problem. - José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Inmaculada Ventura (EGC, 2011)

On the Number of Radial Orderings of Colored Planar Point Sets. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero (EGC, 2011)

Finding all pure strategy Nash equilibria in a planar location game. - José Miguel Díaz-Báñez; Marco A. Heredia; Blas Pelegrín; Pablo Pérez-Lantero; Inmaculada Ventura (Eur. J. Oper. Res., 2011)

The Maximum Box Problem for moving points in the plane. - Sergey Bereg; José Miguel Díaz-Báñez; Pablo Pérez-Lantero; Inmaculada Ventura (J. Comb. Optim., 2011)

Computing optimal islands. - Crevel Bautista-Santiago; José Miguel Díaz-Báñez; Dolores Lara; Pablo Pérez-Lantero; Jorge Urrutia; Inmaculada Ventura (Oper. Res. Lett., 2011)

Adaptive Techniques to find Optimal Planar Boxes. - Jérémy Barbay; Gonzalo Navarro 001; Pablo Pérez-Lantero (CCCG, 2012)

The class cover problem with boxes. - Sergey Bereg; Sergio Cabello; José Miguel Díaz-Báñez; Pablo Pérez-Lantero; Carlos Seara; Inmaculada Ventura (Comput. Geom., 2012)

An upper bound on the coarseness of point sets - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero; Inmaculada Ventura (CoRR, 2012)

Locating a Communication Path in a Competitive Scenario. - Manuel Abellanas; José Miguel Díaz-Báñez; Pablo Pérez-Lantero; Inmaculada Ventura (Comput. J., 2013)

On the coarseness of bicolored point sets. - Sergey Bereg; José Miguel Díaz-Báñez; Dolores Lara; Pablo Pérez-Lantero; Carlos Seara; Jorge Urrutia (Comput. Geom., 2013)

Covering a bichromatic point set with two disjoint monochromatic disks. - Sergio Cabello; José Miguel Díaz-Báñez; Pablo Pérez-Lantero (Comput. Geom., 2013)

Matching colored points with rectangles. - Luis Evaristo Caraballo; Carlos Ochoa; Pablo Pérez-Lantero (CoRR, 2013)

Drawing the double circle on a grid of minimum size - Sergey Bereg; Ruy Fabila Monroy; David Flores-Peñaloza; Mario Alberto López; Pablo Pérez-Lantero (CoRR, 2013)

The 1-median and 1-highway problem. - José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Inmaculada Ventura (Eur. J. Oper. Res., 2013)

The Velocity Assignment Problem for Conflict Resolution with Multiple Aerial Vehicles Sharing Airspace. - David Alejo; José Miguel Díaz-Báñez; Jose A. Cobano; Pablo Pérez-Lantero; Aníbal Ollero (J. Intell. Robotic Syst., 2013)

Order types and cross-sections of line arrangements in R^3. - Oswin Aichholzer; Ruy Fabila Monroy; Ferran Hurtado; Pablo Pérez-Lantero; Andres J. Ruiz-Vargas; Jorge Urrutia; Birgit Vogtenhuber (CCCG, 2014)

On the number of radial orderings of planar point sets. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero (Discret. Math. Theor. Comput. Sci., 2014)

Locating a single facility and a high-speed line. - José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Inmaculada Ventura (Eur. J. Oper. Res., 2014)

Continuous Surveillance of Points by rotating Floodlights. - Sergey Bereg; José Miguel Díaz-Báñez; Marta Fort; Mario Alberto López; Pablo Pérez-Lantero; Jorge Urrutia (Int. J. Comput. Geom. Appl., 2014)

Embedding the double Circle in a Square Grid of Minimum Size. - Sergey Bereg; Ruy Fabila Monroy; David Flores-Peñaloza; Mario Alberto López; Pablo Pérez-Lantero (Int. J. Comput. Geom. Appl., 2014)

Maximum-weight planar boxes in O(n2) time (and better). - Jérémy Barbay; Timothy M. Chan; Gonzalo Navarro 001; Pablo Pérez-Lantero (Inf. Process. Lett., 2014)

On Guillotine Cutting Sequences. - Fidaa Abed; Parinya Chalermsook; José Correa 001; Andreas Karrenbauer; Pablo Pérez-Lantero; José A. Soto; Andreas Wiese (APPROX-RANDOM, 2015)

Bichromatic 2-center of pairs of points. - Esther M. Arkin; José Miguel Díaz-Báñez; Ferran Hurtado; Piyush Kumar; Joseph S. B. Mitchell; Belén Palop; Pablo Pérez-Lantero; Maria Saumell; Rodrigo I. Silveira (Comput. Geom., 2015)

On balanced 4-holes in bichromatic point sets. - Sergey Bereg; José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero; Adriana Ramírez-Vigueras; Toshinori Sakai; Jorge Urrutia; Inmaculada Ventura (Comput. Geom., 2015)

New results on stabbing segments with a polygon. - José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Alexander Pilz; Carlos Seara; Rodrigo I. Silveira (Comput. Geom., 2015)

Balanced Islands in Two Colored Point Sets in the Plane. - Oswin Aichholzer; Nieves Atienza; Ruy Fabila Monroy; Pablo Pérez-Lantero; José Miguel Díaz-Báñez; David Flores-Peñaloza; Birgit Vogtenhuber; Jorge Urrutia (CoRR, 2015)

Refining the Analysis of Divide and Conquer: How and When. - Jérémy Barbay; Carlos Ochoa; Pablo Pérez-Lantero (CoRR, 2015)

Adaptive Computation of the Swap-Insert Edition Distance. - Jérémy Barbay; Pablo Pérez-Lantero (CoRR, 2015)

Adaptive Computation of the Klee's Measure in High Dimensions. - Jérémy Barbay; Pablo Pérez-Lantero; Javiel Rojas-Ledesma (CoRR, 2015)

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity. - José Correa 001; Laurent Feuilloley; Pablo Pérez-Lantero; José A. Soto (Discret. Comput. Geom., 2015)

The 1-Center and 1-Highway problem revisited. - José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Inmaculada Ventura (Ann. Oper. Res., 2016)

Area and Perimeter of the Convex Hull of Stochastic Points. - Pablo Pérez-Lantero (Comput. J., 2016)

Optimizing some constructions with bars: new geometric knapsack problems. - Sergey Bereg; José Miguel Díaz-Báñez; David Flores-Peñaloza; Stefan Langerman; Pablo Pérez-Lantero; Jorge Urrutia (J. Comb. Optim., 2016)

Depth Distribution in High Dimensions. - Jérémy Barbay; Pablo Pérez-Lantero; Javiel Rojas-Ledesma (COCOON, 2017)

Drawing the almost convex set in an integer grid of minimum size. - Frank Duque; Ruy Fabila Monroy; Carlos Hidalgo-Toscano; Pablo Pérez-Lantero (Comput. Geom., 2017)

$K_{1, 3}$-covering red and blue points in the plane. - Bernardo M. Ábrego; Silvia Fernández-Merchant; Mikio Kano; David Orden; Pablo Pérez-Lantero; Carlos Seara; Javier Tejel (CoRR, 2017)

Computing the coarseness with strips or boxes. - José Miguel Díaz-Báñez; Mario Alberto López; Carlos Ochoa; Pablo Pérez-Lantero (Discret. Appl. Math., 2017)

New results on the coarseness of bicolored point sets. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; Pablo Pérez-Lantero; Inmaculada Ventura (Inf. Process. Lett., 2017)

Matching colored points with rectangles. - Luis Evaristo Caraballo; Carlos Ochoa; Pablo Pérez-Lantero; Javiel Rojas-Ledesma (J. Comb. Optim., 2017)

Interval selection in the streaming model. - Sergio Cabello; Pablo Pérez-Lantero (Theor. Comput. Sci., 2017)

On the Diameter of Tree Associahedra. - Jean Cardinal; Stefan Langerman; Pablo Pérez-Lantero (Electron. J. Comb., 2018)

Colored ray configurations. - Ruy Fabila Monroy; Alfredo García Olaverri; Ferran Hurtado; Rafel Jaume; Pablo Pérez-Lantero; Maria Saumell; Rodrigo I. Silveira; Javier Tejel; Jorge Urrutia (Comput. Geom., 2018)

Computing balanced islands in two colored point sets in the plane. - Oswin Aichholzer; Nieves Atienza; José Miguel Díaz-Báñez; Ruy Fabila Monroy; David Flores-Peñaloza; Pablo Pérez-Lantero; Birgit Vogtenhuber; Jorge Urrutia (Inf. Process. Lett., 2018)

Linear separability in spatial databases. - Claudio Torres; Pablo Pérez-Lantero; Gilberto Gutiérrez 001 (Knowl. Inf. Syst., 2018)

Adaptive Computation of the Swap-Insert Correction Distance. - Jérémy Barbay; Pablo Pérez-Lantero (ACM Trans. Algorithms, 2018)

Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd. - Oswin Aichholzer; Ruy Fabila Monroy; Ferran Hurtado; Pablo Pérez-Lantero; Andres J. Ruiz-Vargas; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2019)

Matching points with disks with a common intersection. - Clemens Huemer; Pablo Pérez-Lantero; Carlos Seara; Rodrigo I. Silveira (Discret. Math., 2019)

K1,3-covering red and blue points in the plane. - Bernardo M. Ábrego; Silvia Fernández-Merchant; Mikio Kano; David Orden; Pablo Pérez-Lantero; Carlos Seara; Javier Tejel (Discret. Math. Theor. Comput. Sci., 2019)

Rectilinear Convex Hull of Points in 3D. - Pablo Pérez-Lantero; Carlos Seara; Jorge Urrutia (LATIN, 2020)

The intersection graph of the disks with diameters the sides of a convex n-gon. - Clemens Huemer; Pablo Pérez-Lantero (Discret. Math., 2020)

Computing coverage kernels under restricted settings. - Jérémy Barbay; Pablo Pérez-Lantero; Javiel Rojas-Ledesma (Theor. Comput. Sci., 2020)

Maximum Box Problem on Stochastic Points. - Luis Evaristo Caraballo; Pablo Pérez-Lantero; Carlos Seara; Inmaculada Ventura (Algorithmica, 2021)

On the intersection graph of the disks with diameters the sides of a convex n-gon. - Luis H. Herrera; Pablo Pérez-Lantero (Appl. Math. Comput., 2021)

Maximum Rectilinear Convex Subsets. - Hernán González-Aguilar; David Orden; Pablo Pérez-Lantero; David Rappaport; Carlos Seara; Javier Tejel; Jorge Urrutia (SIAM J. Comput., 2021)

Computing the depth distribution of a set of boxes. - Jérémy Barbay; Pablo Pérez-Lantero; Javiel Rojas-Ledesma (Theor. Comput. Sci., 2021)

On Weighted Sums of Numbers of Convex Polygons in Point Sets. - Clemens Huemer; Déborah Oliveros; Pablo Pérez-Lantero; Ferran Torra Clotet; Birgit Vogtenhuber (Discret. Comput. Geom., 2022)

The Rectilinear Convex Hull of Line Segments. - Carlos Alegría; Justin Dallant; Pablo Pérez-Lantero; Carlos Seara (FCT, 2023)

On maximum-sum matchings of points. - Sergey Bereg; Oscar Chacón-Rivera; David Flores-Peñaloza; Clemens Huemer; Pablo Pérez-Lantero; Carlos Seara (J. Glob. Optim., 2023)

Matching random colored points with rectangles. - Josué Corujo; David Flores-Peñaloza; Clemens Huemer; Pablo Pérez-Lantero; Carlos Seara (J. Comb. Optim., 2023)

On maximum-sum matchings of bichromatic points. - Oscar Chacón-Rivera; Pablo Pérez-Lantero (CoRR, 2024)

Center of maximum-sum matchings of bichromatic points. - Pablo Pérez-Lantero; Carlos Seara (Discret. Math., 2024)

Rectilinear convex hull of points in 3D and applications. - Pablo Pérez-Lantero; Carlos Seara; Jorge Urrutia (J. Glob. Optim., 2024)

The Euclidean 3-Matching Problem is NP-hard. - José Miguel Díaz-Báñez; Ruy Fabila Monroy; José-Manuel Higes-López; Nestaly Marín; Miguel Angel Pérez-Cutiño; Pablo Pérez-Lantero (CoRR, 2025)

Matching random colored points with rectangles (Corrigendum). - Josué Corujo; Paul Horn; Pablo Pérez-Lantero (CoRR, 2025)

Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles. - Carlos Alegría; Justin Dallant; Pablo Pérez-Lantero; Carlos Seara (J. Glob. Optim., 2025)