The following pages link to (Q4796181):
Displaying 38 items.
- Efficiently approximating color-spanning balls (Q284593) (← links)
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Algorithms for interval structures with applications (Q388095) (← links)
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- Shortest color-spanning intervals (Q896153) (← links)
- The weighted farthest color Voronoi diagram on trees and graphs. (Q1421027) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Stabbing segments with rectilinear objects (Q1738129) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Minimum width color spanning annulus (Q1748988) (← links)
- Computing minimum diameter color-spanning sets is hard (Q1944200) (← links)
- Color-spanning localized query (Q1998849) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Color spanning objects: algorithms and hardness results (Q2181240) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Computing the center region and its variants (Q2272371) (← links)
- On some matching problems under the color-spanning model (Q2319899) (← links)
- Expected computations on color spanning sets (Q2343982) (← links)
- On some geometric problems of color-spanning sets (Q2392733) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Color Spanning Objects: Algorithms and Hardness Results (Q2795933) (← links)
- Minimum Width Color Spanning Annulus (Q2817884) (← links)
- Algorithms for Interval Structures with Applications (Q3004669) (← links)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model (Q4632199) (← links)
- (Q5136221) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5896889) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5918556) (← links)
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended (Q5971177) (← links)
- Online \(k\)-color spanning disk problems (Q6053966) (← links)
- Computing largest minimum color-spanning intervals of imprecise points (Q6547918) (← links)
- Maximum-width rainbow-bisecting empty annulus (Q6551277) (← links)
- The 2-mixed-center color spanning problem (Q6606233) (← links)
- Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions (Q6624198) (← links)
