 | 2010 |
| 10 |  | Joy Bhadury,
Craig A. Tovey:
An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon.
Int. J. Comput. Math. 87(2): 244-259 (2010) |
| 2009 |
| 9 |  | Michael R. Wagner,
Joy Bhadury,
Steve Peng:
Risk management in uncapacitated facility location models with random demands.
Computers & OR 36(4): 1002-1011 (2009) |
| 2003 |
| 8 |  | Laxmi Gewali,
Prashu Kodela,
Joy Bhadury:
Approximation Algorithm for Multi-Facility Location.
Applied Informatics 2003: 411-416 |
| 7 |  | Laxmi Gewali,
Joy Bhadury,
Ramaswamy Chandrasekaran:
Network Design Subject to Facility Location.
CCCG 2003: 128-131 |
| 6 |  | Joy Bhadury,
Horst A. Eiselt,
Jorge H. Jaramillo:
An alternating heuristic for medianoid and centroid problems in the plane.
Computers & OR 30(4): 553-565 (2003) |
| 2002 |
| 5 |  | Jorge H. Jaramillo,
Joy Bhadury,
Rajan Batta:
On the use of genetic algorithms to solve location problems.
Computers & OR 29(6): 761-779 (2002) |
| 1999 |
| 4 |  | Joy Bhadury,
Horst A. Eiselt:
Brand positioning under lexicographic choice rules.
European Journal of Operational Research 113(1): 1-16 (1999) |
| 1998 |
| 3 |  | Joy Bhadury,
Ramaswamy Chandrasekaran,
Laxmi Gewali:
Constructing median constrained minimum spanning tree.
CCCG 1998 |
| 1997 |
| 2 |  | Joy Bhadury,
V. Chandru,
A. Maheshwari,
Ramaswamy Chandrasekaran:
Art Gallery Problems for Convex Nested Polygons.
INFORMS Journal on Computing 9(1): 100-110 (1997) |
| 1996 |
| 1 |  | Joy Bhadury,
Ramaswamy Chandrasekaran:
Finding the Set of All Minimal Nested Convex Polygons.
CCCG 1996: 26-31 |