2024
Rectilinear convex hull of points in 3D and applications.
J. Glob. Optim., October, 2024
Center of maximum-sum matchings of bichromatic points.
Discret. Math., March, 2024
On maximum-sum matchings of bichromatic points.
CoRR, 2024
2023
Matching random colored points with rectangles.
J. Comb. Optim., March, 2023
On maximum-sum matchings of points.
J. Glob. Optim., 2023
The Rectilinear Convex Hull of Line Segments.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023
2022
On Weighted Sums of Numbers of Convex Polygons in Point Sets.
Discret. Comput. Geom., 2022
2021
Computing the depth distribution of a set of boxes.
Theor. Comput. Sci., 2021
Maximum Rectilinear Convex Subsets.
SIAM J. Comput., 2021
On the intersection graph of the disks with diameters the sides of a convex n-gon.
Appl. Math. Comput., 2021
Maximum Box Problem on Stochastic Points.
Algorithmica, 2021
2020
Computing coverage kernels under restricted settings.
Theor. Comput. Sci., 2020
The intersection graph of the disks with diameters the sides of a convex n-gon.
Discret. Math., 2020
Rectilinear Convex Hull of Points in 3D.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
2019
K<sub>1,3</sub>-covering red and blue points in the plane.
Discret. Math. Theor. Comput. Sci., 2019
Matching points with disks with a common intersection.
Discret. Math., 2019
Cross-sections of line configurations in R3 and (<i>d</i> - 2)-flat configurations in Rd.
Comput. Geom., 2019
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
Colored ray configurations.
Comput. Geom., 2018
On the Diameter of Tree Associahedra.
Electron. J. Comb., 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.
Discret. Appl. Math., 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
Area and Perimeter of the Convex Hull of Stochastic Points.
Comput. J., 2016
The 1-Center and 1-Highway problem revisited.
Ann. Oper. Res., 2016
2015
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity.
Discret. Comput. Geom., 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
On Guillotine Cutting Sequences.
Proceedings of the Approximation, 2015
2014
Maximum-weight planar boxes in O(n<sup>2</sup>) time (and better).
Inf. Process. Lett., 2014
Embedding the double Circle in a Square Grid of Minimum Size.
Int. J. Comput. Geom. Appl., 2014
Continuous Surveillance of Points by rotating Floodlights.
Int. J. Comput. Geom. Appl., 2014
Locating a single facility and a high-speed line.
Eur. J. Oper. Res., 2014
On the number of radial orderings of planar point sets.
Discret. Math. Theor. Comput. Sci., 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.
J. Intell. Robotic Syst., 2013
The 1-median and 1-highway problem.
Eur. J. Oper. Res., 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
2012
An upper bound on the coarseness of point sets
CoRR, 2012
The class cover problem with boxes.
Comput. Geom., 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.
Eur. J. Oper. Res., 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