The following pages link to Arun Kumar Das (Q831690):
Displaying 12 items.
- Approximation algorithms for orthogonal line centers (Q831691) (← links)
- Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← links)
- Voronoi game on polygons (Q2044961) (← links)
- Resource-theoretic efficacy of the single copy of a two-qubit entangled state in a sequential network (Q2102810) (← links)
- Largest triangle inside a terrain (Q2222094) (← links)
- Approximating \(k\)-orthogonal line center (Q2692202) (← links)
- Optimal strategies in single round Voronoi game on convex polygons with constraints (Q2692236) (← links)
- Region‐based fault‐tolerant distributed file storage system design in networks (Q4642435) (← links)
- (Q5379092) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- Approximation algorithms for orthogonal line centers (Q6166042) (← links)
- Multipacking in Euclidean Plane (Q6754081) (← links)
