The following pages link to Subhash Suri (Q247185):
Displaying 50 items.
- (Q194162) (redirect page) (← links)
- Observability of lattice graphs (Q329291) (← links)
- Metric embedding, hyperbolic space, and social networks (Q340518) (← links)
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas (Q393889) (← links)
- Reconstructing visibility graphs with simple robots (Q442263) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- Capture bounds for visibility-based pursuit evasion (Q482339) (← links)
- Finding a shortest diagonal of a simple polygon in linear time (Q676568) (← links)
- A lower bound for multicast key distribution (Q707165) (← links)
- BOB: Improved winner determination in combinatorial auctions and generalizations (Q814442) (← links)
- Range counting over multidimensional data streams (Q854715) (← links)
- Selfish load balancing and atomic congestion games (Q868439) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Computing the longest diagonal of a simple polygon (Q917298) (← links)
- Bandwidth-constrained allocation in grid computing (Q1018048) (← links)
- Computing the link center of a simple polygon (Q1104086) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q1196456) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- Label placement by maximum independent set in rectangles (Q1276946) (← links)
- Data structures for two-edge connectivity in planar graphs (Q1331953) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131) (← links)
- Geometric permutations of balls with bounded size disparity. (Q1395572) (← links)
- Compressing two-dimensional routing tables (Q1402210) (← links)
- A constant bound for geometric permutations of disjoint unit balls (Q1404497) (← links)
- Morphing simple polygons (Q1577545) (← links)
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries (Q1615774) (← links)
- Range-max queries on uncertain data (Q1745722) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- Computing geodesic furthest neighbors in simple polygons (Q1822979) (← links)
- Routing bandwidth-guaranteed paths with restoration in label-switched networks (Q1887181) (← links)
- Multiway range trees: scalable IP lookup with fast updates (Q1888474) (← links)
- Separation and approximation of polyhedral objects (Q1900992) (← links)
- The maximum exposure problem (Q2123293) (← links)
- K-dominance in multidimensional data: theory and applications (Q2173457) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Improved approximation bounds for the minimum constraint removal problem (Q2206735) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Computing Klee's measure of grounded boxes (Q2346960) (← links)
- Selecting distances in the plane (Q2366232) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Convex hulls under uncertainty (Q2408916) (← links)
- Conflict-free chromatic art gallery coverage (Q2441589) (← links)
- Erratum to: ``Conflict-free chromatic art gallery coverage'' (Q2441591) (← links)
- Towards real-time dynamic spectrum auctions (Q2475958) (← links)
- Adaptive sampling for geometric problems over data streams (Q2477195) (← links)
- Side constraints and non-price attributes in markets (Q2506312) (← links)
