Catalogue_reward- SBI

Wrist Scopy 2012

Fast computation of the modality of polygons

Communication complexity of PRAMs

Consecutive interval query and dynamic programming on intervals

Parallel complexity of computing a maximal set of disjoint paths

A generalized model for understanding evasiveness

A linear time algorithm for finding all farthest neighbors in a convex polygon

On computing the closest boundary point on the convex hull

Finding minimal convex nested polygons