The following pages link to (Q3514515):
Displaying 32 items.
- Tangencies between families of disjoint regions in the plane (Q427060) (← links)
- Lines avoiding balls in three dimensions revisited (Q443898) (← links)
- Unions of fat convex polytopes have short skeletons (Q443910) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- The number of holes in the union of translates of a convex set in three dimensions (Q512258) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- On the union of cylinders in three dimensions (Q629833) (← links)
- A note on smaller fractional Helly numbers (Q745669) (← links)
- Between shapes, using the Hausdorff distance (Q824335) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)
- Elastic geometric shape matching for translations under the Manhattan norm (Q1615782) (← links)
- On the union complexity of families of axis-parallel rectangles with a low packing number (Q1627208) (← links)
- Improved bounds on the Hadwiger-Debrunner numbers (Q1650467) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Union of hypercubes and 3D Minkowski sums with random sizes (Q2022617) (← links)
- Stochastic makespan minimization in structured set systems (Q2118147) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Optimization of the first Dirichlet Laplacian eigenvalue with respect to a union of balls (Q2698557) (← links)
- Abstract Voronoi Diagrams from Closed Bisecting Curves (Q3132921) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
- Union of Hypercubes and 3D Minkowski Sums with Random Sizes. (Q5002676) (← links)
- (Q5115779) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
- (Q6065409) (← links)
- (Q6179341) (← links)
