The following pages link to Alok Aggarwal (Q834913):
Displaying 45 items.
- On the symmetric angle-restricted nearest neighbor problem (Q834915) (← links)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267) (← links)
- A tight lower bound for the train reversal problem (Q912613) (← links)
- Communication complexity of PRAMs (Q913504) (← links)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- Optimal tradeoffs for addition on systolic arrays (Q916387) (← links)
- Computing the longest diagonal of a simple polygon (Q917298) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- (Q1115597) (redirect page) (← links)
- Parallel computational geometry (Q1115600) (← links)
- A linear time algorithm for finding all farthest neighbors in a convex polygon (Q1123027) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- Deferred data structure for the nearest neighbor problem (Q1183453) (← links)
- Parallel complexity of computing a maximal set of disjoint paths (Q1186594) (← links)
- Optimal time bounds for some proximity problems in the plane (Q1198024) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- Parallel searching in generalized Monge arrays (Q1386363) (← links)
- Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- On computing the closest boundary point on the convex hull (Q1824383) (← links)
- A generalized model for understanding evasiveness (Q1825645) (← links)
- Parallel Depth-First Search in General Directed Graphs (Q3034839) (← links)
- (Q3128902) (← links)
- (Q3128929) (← links)
- Finding k points with minimum diameter and related problems (Q3201788) (← links)
- (Q3727387) (← links)
- An optimal algorithm for finding minimal enclosing triangles (Q3745275) (← links)
- Fast computation of the modality of polygons (Q3761211) (← links)
- (Q3763598) (← links)
- (Q3795228) (← links)
- (Q3796748) (← links)
- (Q3798233) (← links)
- (Q4028879) (← links)
- Improved Algorithms for Economic Lot Size Problems (Q4202457) (← links)
- (Q4228432) (← links)
- (Q4228514) (← links)
- (Q4268442) (← links)
- Efficient routing in optical networks (Q4371693) (← links)
- Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality (Q4840222) (← links)
- An Improved Algorithm for the Traveler′s Problem (Q4845854) (← links)
- The Angular-Metric Traveling Salesman Problem (Q4943841) (← links)
- Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout (Q4943873) (← links)
- (Q5501799) (← links)
