Publications in Conferences
C. Alegría , J. Dallant, P. Pérez-Lantero, and C. Seara. The Rectilinear Convex Hull of Line Segments. Fundamentals of Computation Theory: FCT 2023, LNCS Vol. 14292, 2023, pp 32–45. (24th Symposium on Fundamentals of Computation Theory - FCT 2023)
M. Claverol, L. H. Herrera, P. Pérez-Lantero and C. Seara. On (alpha,k)-sets and (alpha,k)-hulls in the plane. XIX Spanish Meeting on Computational Geometry, Madrid, Spain, 2021.
P. Pérez-Lantero and C. Seara. On guillotine cuts of boundary rectangles. XIX Spanish Meeting on Computational Geometry, Madrid, Spain, 2021.
P. Pérez-Lantero, C. Seara, and J. Urrutia. Rectilinear Convex Hull of Points in 3D. LATIN 2020: Theoretical Informatics, LNCS, Vol. 12118, 2020, pp 296-307. (14th Latin American Theoretical Informatics Symposium - LATIN 2020)
J. Corujo, D. Flores-Peñaloza, C. Huemer, P. Pérez-Lantero, and C. Seara. Matching Random Colored Points with Rectangles. Algorithms and Computation: WALCOM 2020, LNCS Vol. 12049, 2020, pp 261-272. (14th International Workshop on Algorithms and Computation - WALCOM 2020)
H. González-Aguilar, D. Orden, P. Pérez-Lantero, D. Rappaport, C. Seara, J. Tejel, and J. Urrutia. Maximum Rectilinear Convex Subsets. Fundamentals of Computation Theory: FCT 2019, LNCS Vol. 11651, 2019, pp 274–291. (22nd Symposium on Fundamentals of Computation Theory - FCT 2019)
J. Barbay, P. Pérez-Lantero, and J. Rojas-Ledesma. Computing Coverage Kernels Under Restricted Settings. Computing and Combinatorics: COCOON 2018, LNCS Vol. 10976, 2018, pp 180–191. (24th Computing and Combinatorics Conference - COCOON 2018)
L. E. Caraballo, P. Pérez-Lantero, C. Seara, and I. Ventura. Maximum Box Problem on Stochastic Points. LATIN 2018: Theoretical Informatics, LNCS, Vol. 10807, 2018, pp 231-244. (13th Latin American Theoretical Informatics Symposium - LATIN 2018) (extended version)
J. Barbay, P. Pérez-Lantero, and J. Rojas-Ledesma. Depth Distribution in High Dimensions. Computing and Combinatorics: COCOON 2017, LNCS Vol. 10392, 2017, pp 38-48. (23rd Computing and Combinatorics Conference - COCOON 2017)
P. Pérez-Lantero and C. Seara. Maximum Box Problem on Probabilistic Points. XVII Spanish Meeting on Computational Geometry, Alicante, Spain, 2017.
C. Huemer, P. Pérez-Lantero, C. Seara, and R. I. Silveira. Matching points with diametral disks. XVII Spanish Meeting on Computational Geometry, Alicante, Spain, 2017.
L. E. Caraballo, P. Pérez-Lantero, and I. Ventura. Maximum Partial Sums of Random Sequences. XVII Spanish Meeting on Computational Geometry, Alicante, Spain, 2017.
F. Abed, P. Chalermsook, J. Correa, A. Karrenbauer, P. Pérez-Lantero, J. Soto, and A. Wiese. On guillotine cutting sequences. LIPIcs Vol. 40, 2015, pp 1-19. (Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2015)
S. Cabello and P. Pérez-Lantero. Interval Selection in the Streaming Model. Algorithms and Data Structures, LNCS Vol. 9214, 2015, pp 127-139. (14th Algorithms and Data Structures Symposium WADS 2015)
J. Barbay and P. Pérez-Lantero. Adaptive Computation of the Swap-Insert Correction Distance. String Processing and Information Retrieval, LNCS Vol. 9309, 2015, pp 21-32. (22nd International Symposium SPIRE 2015)
C. Huemer and P. Pérez-Lantero. On the disks with diameters the sides of a convex 5-gon, XVI Spanish Meeting on Computational Geometry, Barcelona, Spain, 2015.
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. XVI Spanish Meeting on Computational Geometry, Barcelona, Spain, 2015.
J. Barbay, P. Pérez-Lantero, and J. Rojas-Ledesma. Adaptive Computation of the Klee’s Measure in High Dimensions. International Conference of the SCCC (JCC 2014), Talca, Chile, November 2014.
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. 26th Canadian Conference on Computational Geometry (CCCG'14), 2014.
O. Aichholzer, R. Fabila-Monroy, F. Hurtado, P. Pérez-Lantero, A. J. Ruiz-Vargas, J. Urrutia, and B. Vogtenhuber. Order types and cross sections of line arrangements in R^3. 26th Canadian Conference on Computational Geometry (CCCG'14), 2014.
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. Mexican Conference on Discrete Mathematics and Computational Geometry, Oaxaca, Mexico, November 11-15, 2013.
J. Barbay, T. M. Chan, G. Navarro, and P. Pérez-Lantero. Maximum-Weight Planar Boxes in O(n^2) Time (and Better). 25th Canadian Conference on Computational Geometry (CCCG'13), 2013.
S. Bereg, R. Fabila-Monroy, D. Flores-Peñaloza, M. A. López, and P. Pérez-Lantero. Drawing the double circle on a grid of minimum size. XV Spanish Meeting on Computational Geometry, June 26-28, Seville, 2013.
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. Algorithms and Complexity, LNCS Vol. 7878, 2013, pp 146-157. (8th International Conference on Algorithms and Complexity CIAC 2013)
J. Barbay, G. Navarro, and P. Pérez-Lantero. Adaptive Techniques to find Optimal Planar Boxes. 24th Canadian Conference on Computational Geometry (CCCG'12), 2012.
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. LATIN 2012: Theoretical Informatics, LNCS Vol. 7256, 2012, pp 25-36.
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. Computational Geometry, LNCS Vol. 7579, 2012, pp 109-118. (XIV Spanish Meeting on Computational Geometry 2011)
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura. Locating a service facility and a rapid transit line. Computational Geometry, LNCS Vol. 7579, 2012, pp 126-137. (XIV Spanish Meeting on Computational Geometry 2011)
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura. The 1-Center and 1-Highway problem. Computational Geometry, LNCS Vol. 7579, 2012, pp 155-165. (XIV Spanish Meeting on Computational Geometry 2011)
S. Bereg, J. M. Díaz-Báñez, D. Flores-Peñaloza, S. Langerman, P. Pérez-Lantero, and J. Urrutia. Optimizing some constructios with bars - fences and umbrellas. International Conference of the SCCC (JCC 2011), Curicó, Chile, November 2011.
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura. Locating a service facility and a rapid transit line of variable length, Encuentro Chileno de Computación (JCC 2011), Curicó, Chile, November 2011.
S. Bereg, J. M. Díaz-Báñez, D. Lara, P. Pérez-Lantero, C. Seara, and J. Urrutia. Bichromatic Discrepancy Via Convex Partitions. XIII Spanish Meeting on Computational Geometry, Zaragoza, Spain, 2009.