Selected Publications

Agarwal, P.K., Bhattacharya, B.K. and Sen, S., Output-sensitive algorithms for uniform partitions of points, Accepted in Algorithmica, 2000.

Benkoczi, R. and Bhattacharya, B.K., On computing the minimum bridge between two convex polygons, Accepted in Information Processing Letters, 2000.

Bhattacharya, B.K. and Ghosh, S., Characterizing $LR-$visibility polygons and related problems, Accepted in Computational Geometry, Theory and Applications, 2000.

Bespamyatnikh, S., Bhattacharya, B.K., Kirkpatrick, D., Segal, M., Mobile facility computing, Proc. Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2000.

Bespamyatnikh, S., Bhattacharya, B.K., Keil, M., Kirkpatrick, D., Segal, M., Efficient algorithms for centers and medians in interval and circular-arc graphs, Proceedings of European Symposium on Algorithms, August 2000. (The full version is submitted to Networks.)

Benitez, M.C.A., Bhattacharya, B.K. and Gupta, K.K., EODM - a novel representation for collision detection, Proceedings of 2000 ICRA, San Francisco, 2000.

Bhattacharya, B.K., Mukhopadhyay, A. and Toussaint, G.T. Computing a shortest externally visible line segment for a si mple polygon, International Journal of Computational Geometry and Applications, Vol. 9, No. 1, 1999, pp.81-96.

Bhattacharya, B.K. and Houle, M.E., Generalized maximum independent sets for trees in subquadratic time, Proceedings of ISAAC, Chennai, India, December 1999.

Bhattacharya, B.K. and Houle, M., Generalized maximum independent sets for acyclic graphs, Proc. of Computing: The Australian Theory Symposium, 1998.

Bhattacharya, B.K. and Kaller, D., Reference set thinning for the k-nearest neighbor decision rule, Proc. 14th International Conference on Pattern Recognition, August 1998.

Bhattacharya, B.K. and Sen, S., On a simple, practical, optimal, etc., output-sensitive randomized planar convex hull algorithm, Journal of Algorithms, Vol. 25, 1997, pp.177-193.

Akl, S.G., Bhattacharya, B.K., Optimal parallel algorithm for the maximum clique problem in a family of proper circular arcs, Journal of Parallel Algorithms and Applications, Vol. 12, 1997, pp. 305-320.

Bhattacharya, B.K. and Kaller, D., An $O(m+n\log n)$ algorithm for the maximum-clique problem in circular-arc graphs, Journal of Algorithms, Vol. 25, 1997, pp.244-267.

Bhattacharya, B.K. and El-Gindy, H., Biased searching and k-point clustering, Proc. 9th CCCG, Kingston, Ontario, 1997 .

Jadhav, S., Mukhopadhyay, A. and Bhattacharya, B.K., An optimal algorithm for the intersection radius of a set of convex polygons, Journal of Algorithms, Vol. 20, 1996, pp.244-267.

Bhattacharya, B.K., Hell, P. and Huang, J., Optimal algorithm to compute maximum clique of proper circular arc graphs, SIAM Journal on Discrete Mathematics, Vol. 9, No.2, 1996, pp.274-289.

Bhattacharya, B.K., Mukhopadhyay, A. and Robert, J-M, Optimal algorithms for some intersection radius problems, Computing, Vol. 52, No. 3, 1994 pp.269-279.

Mitra, P. and Bhattacharya, B.K., Efficient approximate shortest-path queries among isothetic rectangular obstacles, Proc. WADS, Montreal, August, 1993, pp 518-529.

Mukhopadhyay, A., Kumar, C. and Bhattacharya, B.K., Computing an area-optimal convex-polygonal stabber of a set of parallel line segments, Proc. 5th Canadian Conference on Computational Geometry, Waterloo, August, 1993, pp.169-174.

Bhattacharya, B.K., Czyowicz, J., Egyed, P., Stojmenovic, I., Toussaint, G.T. and Urrutia, J. , Computing shortest transversals of sets, International Journal of Computational Geometry and Applications, Ed. D.T.Lee, Vol.2, No.4, 1992, pp.417-435.

G. Finlayson and B. K. Bhattacharya. A practical algorithm for the greedy triangulation of convex polygon. In Proc. 4th CCCG, Newfoundland, 1992.

S. Jadhav, A. Mukhopadhyay, and B. K. Bhattacharya. An optimal algorithm for the intersection radius of a set of convex polygons. In Proc. 12th FST and TCS Conference, pages 92-103, New Delhi, 1992. Springer-Verlag.

B. K. Bhattacharya and G. T. Toussaint. Computing shortest transversals. Computing, 46(2):93-119, 1991.

B. K. Bhattacharya, J. Czyowicz, P. Egyed, I. Stojmenovic, G. T. Toussaint, and J. Urrutia. Computing shortest transversals of sets. In Proc. 7th ACM Symposium on Computational Geometry, June 1991. (Accepted for publication in International Journal of Computational Geometry and Applications, 1992).

B. K. Bhattacharya, S. Jadhav, A. Mukhopadhyay, and J. M. Robert. Optimal algorithms for some smallest intersection radius problems. In Proc. 7th ACM Symposium on Computational Geometry, June 1991. (Accepted for publication in Computing, 1992).

B. K. Bhattacharya, A. Mukhopadhyay, and G. T. Toussaint. A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible. In Proc. 2nd WADS, pages 412-424. Springer-Verlag, August 1991.

B. K. Bhattacharya, P. Egyed, and G. T. Toussaint. On shortest distances inside X-shaped polygons. In Proc. 3rd CCCG, Vancouver, 1991.

B. K. Bhattacharya. Usefulness of angle-sweep over line-sweep. In Proc. 11th FST and TCS Conference, pages 390-419. Springer-Verlag, December 1991.

B. K. Bhattacharya, J. Chiabaut, D. Graf, D. Peacocke, and T. Shibahara. Text-dependent speaker identification using telephone speech. In Proc. Can. Conference on Electrical and Computer Engineering. 1990.

B. K. Bhattacharya and T. Shermer. Polygonal separators and digital shape recognition. In Proc. 2nd Can. Conference in Computational Geometry, Ottawa, 1990.

B. K. Bhattacharya, D. G. Kirkpatrick, and G. T. Toussaint. Determining sector visibility of a polygon. In Proc. 5th ACM Symposium on Computational Geometry. June 1989.

B. K. Bhattacharya and G. T. Toussaint. Computing minimal spanning covers of sets. In Proc. 1st Can. Conference on Computational Geometry. 1989.

B. K. Bhattacharya. An efficient on-line chebyshev approximation algorithm for a finite planar set. In Proc. Allerton Conference on Communication, Control and Computing, Illinois, September 1988.

T. Asano, B. K. Bhattacharya, M. Keil, and F. Yao. Clustering algorithms based on minimum and maximum spanning trees. In Proc. 4th ACM Symposium on Computational Geometry, pages 252-257, June 1988.

B. K. Bhattacharya. Circular separability of finite planar sets. In G. T. Toussaint, editor, Computer Morphology. North-Holland, 1988.

B. K. Bhattacharya and G. T. Toussaint. Fast algorithms for computing the diameter of a finite planar set. The Visual Computer 3, 1988.


Back to Dr. Bhattacharya's Home Page