Pablo Pérez-Lantero

J. Glob. Optim., October, 2024

Center of maximum-sum matchings of bichromatic points.

[BibT_eX]

[DOI]

Discret. Math., March, 2024

On maximum-sum matchings of bichromatic points.

[BibT_eX]

[DOI]

Oscar Chacón-Rivera

CoRR, 2024

2023

Matching random colored points with rectangles.

[BibT_eX]

[DOI]

Josué Corujo

Clemens Huemer

J. Comb. Optim., March, 2023

On maximum-sum matchings of points.

[BibT_eX]

[DOI]

Oscar Chacón-Rivera

Clemens Huemer

J. Glob. Optim., 2023

The Rectilinear Convex Hull of Line Segments.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

On Weighted Sums of Numbers of Convex Polygons in Point Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

2021

Computing the depth distribution of a set of boxes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Maximum Rectilinear Convex Subsets.

[BibT_eX]

[DOI]

Hernán González-Aguilar

SIAM J. Comput., 2021

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

[BibT_eX]

[DOI]

Luis H. Herrera

Appl. Math. Comput., 2021

Maximum Box Problem on Stochastic Points.

[BibT_eX]

[DOI]

Luis Evaristo Caraballo

Algorithmica, 2021

2020

Computing coverage kernels under restricted settings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

The intersection graph of the disks with diameters the sides of a convex n-gon.

[BibT_eX]

[DOI]

Clemens Huemer

Discret. Math., 2020

Rectilinear Convex Hull of Points in 3D.

[BibT_eX]

[DOI]

Silvia Fernández-Merchant

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

K1,3-covering red and blue points in the plane.

[BibT_eX]

[DOI]

Bernardo M. Ábrego

Discret. Math. Theor. Comput. Sci., 2019

Matching points with disks with a common intersection.

[BibT_eX]

[DOI]

Discret. Math., 2019

Cross-sections of line configurations in R3 and (d - 2)-flat configurations in Rd.

[BibT_eX]

[DOI]

Andres J. Ruiz-Vargas

Comput. Geom., 2019

2018

Adaptive Computation of the Swap-Insert Correction Distance.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Linear separability in spatial databases.

[BibT_eX]

[DOI]

Claudio Torres

Gilberto Gutiérrez

Knowl. Inf. Syst., 2018

Computing balanced islands in two colored point sets in the plane.

[BibT_eX]

[DOI]

Oswin Aichholzer

Nieves Atienza

Inf. Process. Lett., 2018

Colored ray configurations.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Comput. Geom., 2018

On the Diameter of Tree Associahedra.

[BibT_eX]

[DOI]

Jean Cardinal

Stefan Langerman

Electron. J. Comb., 2018

2017

Interval selection in the streaming model.

[BibT_eX]

[DOI]

Sergio Cabello

Theor. Comput. Sci., 2017

Matching colored points with rectangles.

[BibT_eX]

[DOI]

Luis Evaristo Caraballo

J. Comb. Optim., 2017

New results on the coarseness of bicolored point sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Computing the coarseness with strips or boxes.

[BibT_eX]

[DOI]

Mario Alberto López

Silvia Fernández-Merchant

Discret. Appl. Math., 2017

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

[BibT_eX]

[DOI]

Bernardo M. Ábrego

CoRR, 2017

Drawing the almost convex set in an integer grid of minimum size.

[BibT_eX]

[DOI]

Frank Duque

Carlos Hidalgo-Toscano

Comput. Geom., 2017

Depth Distribution in High Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Optimizing some constructions with bars: new geometric knapsack problems.

[BibT_eX]

[DOI]

Stefan Langerman

J. Comb. Optim., 2016

Area and Perimeter of the Convex Hull of Stochastic Points.

[BibT_eX]

[DOI]

Comput. J., 2016

The 1-Center and 1-Highway problem revisited.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2016

2015

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Adaptive Computation of the Swap-Insert Edition Distance.

[BibT_eX]

[DOI]

CoRR, 2015

Refining the Analysis of Divide and Conquer: How and When.

[BibT_eX]

[DOI]

CoRR, 2015

Balanced Islands in Two Colored Point Sets in the Plane.

[BibT_eX]

[DOI]

CoRR, 2015

New results on stabbing segments with a polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2015

On balanced 4-holes in bichromatic point sets.

[BibT_eX]

[DOI]

Adriana Ramírez-Vigueras

Toshinori Sakai

Comput. Geom., 2015

Bichromatic 2-center of pairs of points.

[BibT_eX]

[DOI]

Esther M. Arkin

Ferran Hurtado

Piyush Kumar

Joseph S. B. Mitchell

Comput. Geom., 2015

On Guillotine Cutting Sequences.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2015

2014

Maximum-weight planar boxes in O(n2) time (and better).

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Embedding the double Circle in a Square Grid of Minimum Size.

[BibT_eX]

[DOI]

Mario Alberto López

Int. J. Comput. Geom. Appl., 2014

Continuous Surveillance of Points by rotating Floodlights.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2014

Locating a single facility and a high-speed line.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

On the number of radial orderings of planar point sets.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Order types and cross-sections of line arrangements in R^3.

[BibT_eX]

[DOI]

Andres J. Ruiz-Vargas

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

The Velocity Assignment Problem for Conflict Resolution with Multiple Aerial Vehicles Sharing Airspace.

[BibT_eX]

[DOI]

David Alejo

Jose A. Cobano

Aníbal Ollero

J. Intell. Robotic Syst., 2013

The 1-median and 1-highway problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2013

Drawing the double circle on a grid of minimum size

[BibT_eX]

[DOI]

Mario Alberto López

CoRR, 2013

Matching colored points with rectangles.

[BibT_eX]

[DOI]

Luis Evaristo Caraballo

CoRR, 2013

Covering a bichromatic point set with two disjoint monochromatic disks.

[BibT_eX]

[DOI]

Sergio Cabello

Comput. Geom., 2013

On the coarseness of bicolored point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Locating a Communication Path in a Competitive Scenario.

[BibT_eX]

[DOI]

Manuel Abellanas

Comput. J., 2013

2012

An upper bound on the coarseness of point sets

[BibT_eX]

[DOI]

CoRR, 2012

The class cover problem with boxes.

[BibT_eX]

[DOI]

Sergio Cabello

Comput. Geom., 2012

Adaptive Techniques to find Optimal Planar Boxes.

[BibT_eX]

[DOI]

Gonzalo Navarro

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Computing optimal islands.

[BibT_eX]

[DOI]

Crevel Bautista-Santiago

Oper. Res. Lett., 2011

The Maximum Box Problem for moving points in the plane.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Finding all pure strategy Nash equilibria in a planar location game.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2011

On the Number of Radial Orderings of Colored Planar Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

The 1-Center and 1-Highway Problem.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Locating a Service Facility and a Rapid Transit Line.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2009

Bichromatic separability with two boxes: A general approach.

[BibT_eX]

[DOI]

Carmen Cortés