The following pages link to Amitava Datta (Q192271):
Displaying 6 items.
- An optimal algorithm for one-separation of a set of isothetic polygons (Q707337) (← links)
- On-line path planning in an unknown polygonal environment (Q707338) (← links)
- Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition (Q781014) (← links)
- Asymptotic properties of restricted naming games (Q1620650) (← links)
- Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes. (Q5959183) (← links)
- Competitive searching in polygons—Beyond generalised streets (Q6487943) (← links)
