Alok Aggarwal

Available identifiers

zbMath Open aggarwal.alokMaRDI QIDQ834913

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5501799	2015-08-14	Paper
On the symmetric angle-restricted nearest neighbor problem	2009-08-27	Paper
The Angular-Metric Traveling Salesman Problem	2000-03-19	Paper
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout	2000-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4268442	1999-10-31	Paper
https://portal.mardi4nfdi.de/entity/Q4228432	1999-04-22	Paper
https://portal.mardi4nfdi.de/entity/Q4228514	1999-03-01	Paper
Consecutive interval query and dynamic programming on intervals	1998-07-28	Paper
Parallel searching in generalized Monge arrays	1998-05-24	Paper
Efficient routing in optical networks	1998-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q3128929	1997-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q3128902	1997-06-02	Paper
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality	1996-11-04	Paper
An Improved Algorithm for the Traveler′s Problem	1995-09-17	Paper
Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications	1994-11-27	Paper
Improved Algorithms for Economic Lot Size Problems	1993-10-04	Paper
https://portal.mardi4nfdi.de/entity/Q4028879	1993-03-28	Paper
Optimal time bounds for some proximity problems in the plane	1993-01-16	Paper
Deferred data structure for the nearest neighbor problem	1992-06-28	Paper
Parallel complexity of computing a maximal set of disjoint paths	1992-06-28	Paper
Computing external farthest neighbors for a simple polygon	1992-06-25	Paper
Multilayer grid embeddings for VLSI	1991-01-01	Paper
Optimal tradeoffs for addition on systolic arrays	1991-01-01	Paper
A lower bound on the area of permutation layouts	1991-01-01	Paper
Finding k points with minimum diameter and related problems	1991-01-01	Paper
A tight lower bound for the train reversal problem	1990-01-01	Paper
Communication complexity of PRAMs	1990-01-01	Paper
Applications of generalized matrix searching to geometric algorithms	1990-01-01	Paper
Computing the longest diagonal of a simple polygon	1990-01-01	Paper
Parallel Depth-First Search in General Directed Graphs	1990-01-01	Paper
A linear-time algorithm for computing the Voronoi diagram of a convex polygon	1989-01-01	Paper
A linear time algorithm for finding all farthest neighbors in a convex polygon	1989-01-01	Paper
Finding minimal convex nested polygons	1989-01-01	Paper
On computing the closest boundary point on the convex hull	1989-01-01	Paper
A generalized model for understanding evasiveness	1989-01-01	Paper
Parallel computational geometry	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3795228	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3796748	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3798233	1988-01-01	Paper
Geometric applications of a matrix-searching algorithm	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3763598	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3727387	1986-01-01	Paper
An optimal algorithm for finding minimal enclosing triangles	1986-01-01	Paper
Fast computation of the modality of polygons	1986-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Alok Aggarwal