The following pages link to (Q3694703):
Displaying 35 items.
- Grid refinement in the construction of Lyapunov functions using radial basis functions (Q258399) (← links)
- Geometric partitioning and robust ad-hoc network design (Q271922) (← links)
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
- (Approximate) uncertain skylines (Q359874) (← links)
- Approximate covering detection among content-based subscriptions using space filling curves (Q362593) (← links)
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- Minimum Hausdorff distance under rigid motions and comparison of protein structures (Q473041) (← links)
- Improved subquadratic 3SUM (Q513274) (← links)
- Opaque sets (Q517796) (← links)
- Line facility location in weighted regions (Q543511) (← links)
- Ectropy of diversity measures for populations in Euclidean space (Q545352) (← links)
- Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy (Q547283) (← links)
- An almost space-optimal streaming algorithm for coresets in fixed dimensions (Q547286) (← links)
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- (Q5037955) (← links)
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- Consistent digital curved rays and pseudoline arrangements (Q5075770) (← links)
- (Q5090910) (← links)
- Parallel computation of discrete Voronoi diagrams (Q5096154) (← links)
- (Q5115792) (← links)
- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees (Q6064016) (← links)
- Compact location problems with budget and communication constraints (Q6064048) (← links)
- Algorithmic graph embeddings (Q6085703) (← links)
- On reconfiguration graphs of independent sets under token sliding (Q6115427) (← links)
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
- k-pairs non-crossing shortest paths in a simple polygon (Q6487450) (← links)
- Finding a shortest pair of paths on the plane with obstacles and crossing areas (Q6487944) (← links)
- No quadrangulation is extremely odd (Q6487985) (← links)
- The first subquadratic algorithm for complete linkage clustering (Q6487987) (← links)
- Sharp inequalities involving the Cheeger constant of planar convex sets (Q6491776) (← links)
