The following pages link to Anil Maheshwari (Q170448):
Displaying 50 items.
- An optimal algorithm for the Euclidean bottleneck full Steiner tree problem (Q390152) (← links)
- \(\alpha\)-visibility (Q390160) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- Switching to directional antennas with constant increase in radius and hop distance (Q517801) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- On the number of shortest descending paths on the surface of a convex terrain (Q553957) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Fréchet distance with speed limits (Q621928) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Multilist layering: Complexity and applications (Q673793) (← links)
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions (Q679740) (← links)
- Analysis of farthest point sampling for approximating geodesics in a graph (Q679744) (← links)
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon (Q679748) (← links)
- Characterizing and recognizing weak visibility polygons (Q686142) (← links)
- Fixed-orientation equilateral triangle matching of point sets (Q744055) (← links)
- Maximum bipartite subgraph of geometric intersection graphs (Q782177) (← links)
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- Minimum consistent subset of simple graph classes (Q831758) (← links)
- The minimum moving spanning tree problem (Q832829) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties (Q904106) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- An optimal algorithm for computing a minimum nested nonconvex polygon (Q918739) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Geometric spanners with small chromatic number (Q955227) (← links)
- Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
- On the false-positive rate of Bloom filters (Q975449) (← links)
- A linear-space algorithm for distance preserving graph embedding (Q1005326) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- An optimal parallel algorithm for computing furthest neighbors in a tree (Q1205722) (← links)
- An algorithm for recognizing palm polygons (Q1345480) (← links)
- Stage-graph representations (Q1363763) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- Approximating the integral Fréchet distance (Q1615637) (← links)
- An optimal algorithm for plane matchings in multipartite geometric graphs (Q1616235) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)
- Strong matching of points with geometric shapes (Q1699290) (← links)
- Geometric path problems with violations (Q1709576) (← links)
- Spanning trees in multipartite geometric graphs (Q1755734) (← links)
- Path refinement in weighted regions (Q1799222) (← links)
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747) (← links)
- Translating a regular grid over a point set (Q1873153) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- An in-place min-max priority search tree (Q1931277) (← links)
- Localized geometric query problems (Q1931281) (← links)
- Low-interference networks in metric spaces of bounded doubling dimension (Q1944217) (← links)
