The following pages link to Pablo Pérez-Lantero (Q266043):
Displaying 50 items.
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- Locating a single facility and a high-speed line (Q299840) (← links)
- (Q411212) (redirect page) (← links)
- The maximum box problem for moving points in the plane (Q411213) (← links)
- The class cover problem with boxes (Q419500) (← links)
- Computing optimal islands (Q433119) (← links)
- New results on stabbing segments with a polygon (Q474818) (← links)
- On balanced 4-holes in bichromatic point sets (Q482334) (← links)
- The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited (Q512987) (← links)
- New results on the coarseness of bicolored point sets (Q522958) (← links)
- On the coarseness of bicolored point sets (Q714904) (← links)
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\) (Q1622346) (← links)
- Interval selection in the streaming model (Q1676325) (← links)
- Colored ray configurations (Q1699300) (← links)
- Computing balanced islands in two colored point sets in the plane (Q1708264) (← links)
- Covering a bichromatic point set with two disjoint monochromatic disks (Q1931262) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- Rectilinear convex hull of points in 3D (Q2081624) (← links)
- On weighted sums of numbers of convex polygons in point sets (Q2167313) (← links)
- Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs (Q2236638) (← links)
- On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2245950) (← links)
- The 1-median and 1-highway problem (Q2253533) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Finding all pure strategy Nash equilibria in a planar location game (Q2275630) (← links)
- The intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2279992) (← links)
- Maximum rectilinear convex subsets (Q2291424) (← links)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
- Drawing the almost convex set in an integer grid of minimum size (Q2401331) (← links)
- Depth distribution in high dimensions (Q2412399) (← links)
- Matching points with disks with a common intersection (Q2421852) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- On maximum-sum matchings of points (Q2679241) (← links)
- Bichromatic 2-Center of Pairs of Points (Q2894450) (← links)
- Adaptive Computation of the Swap-Insert Correction Distance (Q2949833) (← links)
- On the Number of Radial Orderings of Colored Planar Point Sets (Q4899269) (← links)
- Locating a Service Facility and a Rapid Transit Line (Q4899271) (← links)
- The 1-Center and 1-Highway Problem (Q4899274) (← links)
- New Results on Stabbing Segments with a Polygon (Q4924645) (← links)
- Maximum Rectilinear Convex Subsets (Q5149759) (← links)
- (Q5173161) (← links)
- EMBEDDING THE DOUBLE CIRCLE IN A SQUARE GRID OF MINIMUM SIZE (Q5247065) (← links)
- (Q5351886) (← links)
- $K_{1,3}$-covering red and blue points in the plane (Q5377228) (← links)
- Matching random colored points with rectangles (Q5896126) (← links)
- Computing coverage kernels under restricted settings (Q5916250) (← links)
- Maximum box problem on stochastic points (Q5918465) (← links)
- Maximum box problem on stochastic points (Q5919411) (← links)
- Computing coverage kernels under restricted settings (Q5919535) (← links)
- Matching random colored points with rectangles (Q5925699) (← links)