Pablo Pérez-Lantero

According to our database1, Pablo Pérez-Lantero authored at least 72 papers between 2009 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Adaptive Computation of the Swap-Insert Correction Distance.
ACM Trans. Algorithms, 2018

Linear separability in spatial databases.
Knowl. Inf. Syst., 2018

Computing balanced islands in two colored point sets in the plane.
Inf. Process. Lett., 2018

On the intersection graph of the disks with diameters the sides of a convex n-gon.
CoRR, 2018

Computing Coverage Kernels Under Restricted Settings.
CoRR, 2018

On the Diameter of Tree Associahedra.
CoRR, 2018

Colored ray configurations.
CoRR, 2018

Colored ray configurations.
Comput. Geom., 2018

On the Diameter of Tree Associahedra.
Electr. J. Comb., 2018

Maximum Box Problem on Stochastic Points.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Computing Coverage Kernels Under Restricted Settings.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Interval selection in the streaming model.
Theor. Comput. Sci., 2017

Matching colored points with rectangles.
J. Comb. Optim., 2017

New results on the coarseness of bicolored point sets.
Inf. Process. Lett., 2017

Computing the coarseness with strips or boxes.
Discrete Applied Mathematics, 2017

On balanced 4-holes in bichromatic point sets.
CoRR, 2017

Depth Distribution in High Dimensions.
CoRR, 2017

$K_{1, 3}$-covering red and blue points in the plane.
CoRR, 2017

Drawing the almost convex set in an integer grid of minimum size.
Comput. Geom., 2017

Depth Distribution in High Dimensions.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Optimizing some constructions with bars: new geometric knapsack problems.
J. Comb. Optim., 2016

Linear Separability in Spatial Databases.
CoRR, 2016

Drawing the Almost Convex Set in an Integer Grid of Minimum Size.
CoRR, 2016

Area and Perimeter of the Convex Hull of Stochastic Points.
Comput. J., 2016

The 1-Center and 1-Highway problem revisited.
Annals OR, 2016

2015
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity.
Discrete & Computational Geometry, 2015

Interval Selection in the Streaming Model.
CoRR, 2015

Adaptive Computation of the Klee's Measure in High Dimensions.
CoRR, 2015

Adaptive Computation of the Swap-Insert Edition Distance.
CoRR, 2015

Refining the Analysis of Divide and Conquer: How and When.
CoRR, 2015

Balanced Islands in Two Colored Point Sets in the Plane.
CoRR, 2015

New results on stabbing segments with a polygon.
Comput. Geom., 2015

On balanced 4-holes in bichromatic point sets.
Comput. Geom., 2015

Bichromatic 2-center of pairs of points.
Comput. Geom., 2015

Interval Selection in the Streaming Model.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Adaptive Computation of the Swap-Insert Correction Distance.
Proceedings of the String Processing and Information Retrieval, 2015

On Guillotine Cutting Sequences.
Proceedings of the Approximation, 2015

2014
Maximum-weight planar boxes in O(n2) time (and better).
Inf. Process. Lett., 2014

Embedding the double Circle in a Square Grid of Minimum Size.
Int. J. Comput. Geometry Appl., 2014

Continuous Surveillance of Points by rotating Floodlights.
Int. J. Comput. Geometry Appl., 2014

Locating a single facility and a high-speed line.
European Journal of Operational Research, 2014

On the number of radial orderings of planar point sets.
Discrete Mathematics & Theoretical Computer Science, 2014

Area and Perimeter of the Convex Hull of Stochastic Points.
CoRR, 2014

The intersection graph of the disks with diameters the sides of a convex $n$-gon.
CoRR, 2014

Colored Ray Configurations.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Order types and cross-sections of line arrangements in R^3.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
The Velocity Assignment Problem for Conflict Resolution with Multiple Aerial Vehicles Sharing Airspace.
Journal of Intelligent and Robotic Systems, 2013

The 1-median and 1-highway problem.
European Journal of Operational Research, 2013

Drawing the double circle on a grid of minimum size
CoRR, 2013

Matching colored points with rectangles.
CoRR, 2013

Covering a bichromatic point set with two disjoint monochromatic disks.
Comput. Geom., 2013

On the coarseness of bicolored point sets.
Comput. Geom., 2013

Locating a Communication Path in a Competitive Scenario.
Comput. J., 2013

New Results on Stabbing Segments with a Polygon.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Maximum-Weight Planar Boxes in O(n2) Time (and Better).
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
An upper bound on the coarseness of point sets
CoRR, 2012

New results on stabbing segments with a polygon
CoRR, 2012

The 1-Center and 1-Highway problem
CoRR, 2012

Locating a single facility and a high-speed line
CoRR, 2012

Adaptive Techniques to find Optimal Planar Boxes
CoRR, 2012

On the number of radial orderings of planar point sets
CoRR, 2012

The class cover problem with boxes.
Comput. Geom., 2012

Bichromatic 2-Center of Pairs of Points.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Adaptive Techniques to find Optimal Planar Boxes.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Computing optimal islands.
Oper. Res. Lett., 2011

The Maximum Box Problem for moving points in the plane.
J. Comb. Optim., 2011

Finding all pure strategy Nash equilibria in a planar location game.
European Journal of Operational Research, 2011

Locating a service facility and a rapid transit line
CoRR, 2011

On the Number of Radial Orderings of Colored Planar Point Sets.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

The 1-Center and 1-Highway Problem.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Locating a Service Facility and a Rapid Transit Line.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2009
Bichromatic separability with two boxes: A general approach.
J. Algorithms, 2009


  Loading...