C. Alegría, J. Dallant, P. Pérez-Lantero, and C. Seara. Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles. Journal of Global Optimization, 92, 227-251, 2025.
J. Fernández Goycoolea, L. H. Herrera, P. Pérez-Lantero, and C. Seara. Computing the coarseness measure of a bicolored point set over guillotine partitions. Results in Applied Mathematics, 24, 100503, 2024.
P. Pérez-Lantero, C. Seara, and J. Urrutia. Rectilinear convex hull of points in 3D and applications. Journal of Global Optimization, 90, 551-571, 2024.
P. Pérez-Lantero and C. Seara. Center of maximum-sum matchings of bichromatic points. Discrete Mathematics, 347(3), 113822, 2024.
J. Corujo, D. Flores-Peñaloza, C. Huemer, P. Pérez-Lantero, and C. Seara. Matching Random Colored Points with Rectangles. Journal of Combinatorial Optimization, 45(2):81, 2023.
S. Bereg, O. P. Chacón-Rivera, D. Flores-Peñaloza, C. Huemer, P. Pérez-Lantero, and C. Seara. On maximum-sum matchings of points. Journal of Global Optimization, 85, 111-128, 2023.
C. Huemer, D. Oliveros, P. Pérez-Lantero, F. Torra Clotet, and B. Vogtenhuber. On Weighted Sums of Numbers of Convex Polygons in Point Sets. Discrete & Computational Geometry, 68(2), 448-476, 2022.
L. E. Caraballo, P. Pérez-Lantero, C. Seara, and I. Ventura. Maximum Box Problem on Stochastic Points. Algorithmica, 83, 3741–3765, 2021.
J. Barbay, P. Pérez-Lantero, and J. Rojas-Ledesma. Computing the depth distribution of a set of boxes. Theoretical Computer Science, 883, 69-82, 2021.
F. Duque, R. Fabila-Monroy, C Hidalgo-Toscano, and Pablo Pérez-Lantero. Non-crossing monotone paths and binary trees in edge-labeled complete geometric graphs. Acta Mathematica Hungarica, 165, 28–39, 2021.
L. H. Herrera and P. Pérez-Lantero. On the intersection graph of the disks with diameters the sides of a convex n-gon. Applied Mathematics and Computation, 411, 126472, 2021.
H. González-Aguilar, D. Orden, P. Pérez-Lantero, D. Rappaport, C. Seara, J. Tejel, and J. Urrutia. Maximum Rectilinear Convex Subsets. SIAM Journal on Computing, 50(1), 145-170, 2021.
J. Barbay, P. Pérez-Lantero, and J. Rojas-Ledesma. Computing coverage kernels under restricted settings. Theoretical Computer Science, 815, 270-288, 2020.
C. Huemer and P. Pérez-Lantero. The intersection graph of the disks with diameters the sides of a convex n-gon. Discrete Mathematics, 343(2), 111669, 2020.
C. Huemer, P. Pérez-Lantero, C. Seara, and R. I. Silveira. Matching points with disks with a common intersection. Discrete Mathematics, 342(7), 1885-1893, 2019.
B. M. Ábrego, S. Fernández-Merchant, M. Kano, D. Orden, P. Pérez-Lantero, C. Seara, and J. Tejel. K_{1,3}-covering red and blue points in the plane. Discrete Mathematics and Theoretical Computer Science, 21(3), 2019.
O. Aichholzer, R. Fabila-Monroy, F. Hurtado, P. Pérez-Lantero, A. J. Ruiz-Vargas, J. Urrutia, and B. Vogtenhuber. Cross-sections of line configurations in R^3 and (d-2)-flat configurations in R^d. Computational Geometry: Theory and Applications, 77, 51-61, 2019.
J. Cardinal, S. Langerman, and P. Pérez-Lantero. On the Diameter of Tree Associahedra. The Electronic Journal of Combinatorics, 25(4): P4.18, 2018.
J. Barbay and P. Pérez-Lantero. Adaptive Computation of the Swap-Insert Correction Distance. ACM Transactions on Algorithms, 14(4): 49:1-49:16, 2018.
O. Aichholzer, N. Atienza, J. M. Díaz-Báñez, R. Fabila-Monroy, D. Flores-Peñaloza, P. Pérez-Lantero, J. Urrutia, and B. Vogtenhuber. Computing Balanced Islands in Two Colored Point Sets in the Plane. Information Processing Letters, 135, 28-32, 2018
R. Fabila-Monroy, A. Garcia, F. Hurtado, R. Jaume, P. Pérez-Lantero, M. Saumell, R. I. Silveira, J. Tejel, and J. Urrutia. Colored Ray Configurations. Computational Geometry: Theory and Applications, 68, 292-308, 2018.
C. Torres, P. Pérez-Lantero, and G. Gutiérrez. Linear separability in spatial databases. Knowledge and Information Systems, 54(2), 287-314, 2018.
S. Cabello and P. Pérez-Lantero. Interval Selection in the Streaming Model. Theoretical Computer Science, 702, 77-96, 2017.
F. Duque, R. Fabila-Monroy, C. Hidalgo-Toscano, and P. Pérez-Lantero. Drawing the almost convex set in an integer grid of minimum size. Computational Geometry: Theory and Applications, 65, 1-11, 2017.
J. M. Díaz-Báñez, M. A. Lopez, C. Ochoa, and P. Pérez-Lantero. Computing the coarseness with strips or boxes. Discrete Applied Mathematics, 224, 80-90, 2017.
J. M. Díaz-Báñez, R. Fabila-Monroy, P. Pérez-Lantero, and I. Ventura. New results on the coarseness of bicolored point sets. Information Processing Letters, 123, 1-7, 2017.
L. E. Caraballo, C. Ochoa, P. Pérez-Lantero, and J. Rojas-Ledesma. Matching colored points with rectangles. Journal of Combinatorial Optimization, 33(2), 403-421, 2017.
P. Pérez-Lantero. Area and Perimeter of the Convex Hull of Stochastic Points, Computer Journal, 59(8): 1144-1154, 2016.
S. Bereg, J. M. Díaz-Báñez, D. Flores-Peñaloza, S. Langerman, P. Pérez-Lantero, and J. Urrutia. Optimizing some constructions with bars: new geometric knapsack problems. Journal of Combinatorial Optimization, 31(3), 1160-1173, 2016.
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura. The 1-Center and 1-Highway problem revisited. Annals of Operations Research, 246(1): 167-179, 2016.
J. Correa, L. Feuilloley, P. Pérez-Lantero, and J. Soto. Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity. Discrete & Computational Geometry, 53(2): 344-365, 2015.
S. Bereg, J. M. Díaz-Báñez, R. Fabila-Monroy, P. Pérez-Lantero, A. Ramírez-Vigueras, T. Sakai, J. Urrutia, and I. Ventura. On balanced 4-holes in bichromatic point sets. Computational Geometry: Theory and Applications, 48:169-179, 2015.
E. M. Arkin, J. M. Díaz-Báñez, F. Hurtado, P. Kumar, J. S. B. Mitchell, B. Palop, P. Pérez-Lantero, M. Saumell, and R. I. Silveira. Bichromatic 2-center of pairs of points. Computational Geometry: Theory and Applications, 48(2): 94-107, 2015.
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, A. Pilz, C. Seara and R. I. Silveira. New results on stabbing segments with a polygon. Computational Geometry: Theory and Applications, 48(1): 14-29, 2015.
S. Bereg, J. M. Díaz-Báñez, M. Fort, M. A. López, P. Pérez-Lantero, and J. Urrutia. Continuous surveillance of points by rotating floodlights. International Journal of Computational Geometry and Applications, 24(3): 183–196, 2014.
S. Bereg, R. Fabila-Monroy, D. Flores-Peñaloza, M. A. López, and P. Pérez-Lantero. Embedding the double circle in a square grid of minimum size. International Journal of Computational Geometry and Applications, 24(3): 247–258, 2014.
J. Barbay, T. M. Chan, G. Navarro, and P. Pérez-Lantero. Maximum-Weight Planar Boxes in O(n^2) Time (and Better). Information Processing Letters, 114:437-445, 2014.
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura. Locating a Single Facility and a High-Speed Line. European Journal of Operational Research, 236(1): 69-77, 2014.
J. M. Díaz-Báñez, R. Fabila-Monroy, and P. Pérez-Lantero. On the number of radial orderings of colored planar point sets. Discrete Mathematics and Theoretical Computer Science, 16(3): 291-304, 2014.
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura. The 1-Median and 1-Highway problem. European Journal of Operational Research, 225(3): 552-557, 2013.
D. Alejo, J. M. Díaz-Báñez, J. A. Cobano, P. Pérez-Lantero, and A. Ollero. The velocity assignment problem for conflict resolution with multiple aerial vehicles sharing airspace. Journal of Intelligent and Robotic Systems, 69(1-4): 331-346, 2013.
S. Cabello, J. M. Díaz-Bánez, and P. Pérez-Lantero. Covering a bichromatic point set with two disjoint monochromatic disks. Computational Geometry: Theory and Applications, 46(3): 203-212, 2013.
S. Bereg, J. M. Díaz-Báñez, D. Lara, P. Pérez-Lantero, C. Seara, and J. Urrutia. On the Coarseness of Bicolored Point Sets. Computational Geometry: Theory and Applications, 46(1): 65-77, 2013.
M. Abellanas, J. M. Díaz-Báñez, P. Pérez-Lantero, and I. Ventura. Locating a Communication Path in a Competitive Scenario. Computer Journal, 56(7): 819-826, 2013.
S. Bereg, S. Cabello, J. M. Díaz-Báñez, P. Pérez-Lantero, C. Seara, and I. Ventura. The Class Cover Problem with Boxes. Computational Geometry: Theory and Applications, 45(7): 294-304, 2012.
C. Bautista, J. M. Díaz-Báñez, D. Lara, P. Pérez-Lantero, J. Urrutia, and I. Ventura. Computing Optimal Islands. Operations Research Letters, 39(4): 246-251, 2011.
J. M. Díaz-Báñez, M. Heredia, B. Pelegrín, P. Pérez-Lantero, and I. Ventura. Finding all pure strategy Nash Equilibria in a Planar Location Game. European Journal of Operational Research, 214(1): 91-98, 2011.
S. Bereg, J. M. Díaz-Báñez, P. Pérez-Lantero, and I. Ventura. The Maximum Box Problem for moving points in the plane. Journal of Combinatorial Optimization, 22(4): 517-530, 2011.
C. Cortés, J. M. Díaz-Báñez, P. Pérez-Lantero, C. Seara, J. Urrutia, and I. Ventura. Bichromatic separability with two boxes: a general approach. Journal of Algorithms: Cognition, Informatics and Logic, 64(2-3): 79-88, 2009.