The following pages link to Ayan Nandy (Q2181245):
Displaying 10 items.
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246) (← links)
- Optimizing movement in convex and non-convex path-networks to establish connectivity (Q2201771) (← links)
- Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints (Q2795940) (← links)
- Outerplanar and Planar Oriented Cliques (Q2811201) (← links)
- Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity (Q2971642) (← links)
- Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (Q4632168) (← links)
- A Facility Coloring Problem in 1-D (Q5251636) (← links)
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions (Q5919112) (← links)
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions (Q5925218) (← links)
- Oriented total-coloring of oriented graphs (Q6589144) (← links)
