| |
| Journal Articles |
| |
Benkoczi, R., Bhattacharya, B.K. and Tamir, A., Collection depots facility location problems in trees, Accepted, Networks, 2008. |
| |
|
| |
Bhattacharya B.K., Tamir A. and Shi Q., "Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees", Available online, Algorithmica. |
| |
|
| |
Mukhopadhyay, A., Kumar, C., Greene, E., Bhattacharya, B.K., On intersecting a set of parallel line segments with a convex polygon of minimum area, Information Processing Letters, Vol. 105, No. 2, 58-64, 2008. |
| |
|
| |
Rong Ge, Martin Ester, Byron J. Gao, Zengjian Hu, Binay K. Bhattacharya, Boaz Ben-Moshe: Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications. TKDD 2(2) |
| |
|
| |
Benkoczi R., Bhattacharya B.K., Das S. and Sember J., "Collection depots facility location problems in the plane", Accepted, Computational Geometry, Theory and Applications. |
| |
|
| |
Ben-Moshe, B., Bhattacharya, B.K., Shi, Q. and Tamir, A, Efficient algorithms for center problems in Cactus networks, Theoretical Computer Science, Vol. 378(3), 237-252, 2007. |
| |
|
| |
Ghosh, S.K., Shermer, T., Bhattacharya, B.K. and Goswami, P., Computing the maximum clique in the visibility graph of a simple polygon, Journal of Discrete Algorithms, Vol 5, No. 3, 524-532, 2007. |
| |
|
| |
Benkoczi, R., Breton, D. and Bhattacharya, B.K.,
Efficient computation of 2-medians in a tree network with positive/negative weights, Discrete Mathematics, Vol. 306(14), 1505-1516, 2006. |
| |
|
| |
Bereg (Bespamyatnikh), S., Bhattacharya, B.K., Kirkpatrick, D., Segal, M.,
Competitive algorithms for mobile centers, MONET, Vol. 11(2), 177-186, 2006. |
| |
|
| |
Bhattacharya, B.K., Ghosh, S.K. and Shermer, T., A linear time algorithm to remove winding of a simple polygon, Computational Geometry: Theory and Applications, vol. 33, 165-173, 2006. |
| |
|
| |
Pankaj Agarwal, Binay Bhattacharya and Sandeep Sen, "Improved algorithms for uniform partition of points", Algorithmica, Vol. 32, pp.32-52, 2002. |
| |
|
| |
Sergei Bespamyatnikh, Binay Bhattacharya, Mark Keil, David Kirkpatrick, Mike Segal, "Efficient algorithms for centers and medians in interval and
circular-arc graphs", Networks, Vol. 33, pp.144-152, 2002. |
| |
|
| |
Binay Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan, "Optimally computing a shortest weakly visible line segment inside a simple polygon", Computational Geometry, Theory and Applications,
Vol. 23, pp. 1-29, 2002. |
| |
|
| |
R. Benkoczi and B.K. Bhattacharya
"An optimal algorithm to compute the smallest bridge between two convex polygons",
Information Processing Letters, Vol. 79, 215-221, 2001. |
| |
|
| |
B. K. Bhattacharya and S. Ghosh
"Characterizing LR-visibility polygons and related problems",
Computational Geometry: Theory and Applications,
Vol. 18, pp. 19-36, 2001. |
| |
|
| |
Bhattacharya, B.K., Mukhopadhyay, A. and Toussaint, G.T.,
"Computing a shortest weakly externally visible line segment for a simple polygon"
International Journal of Computational Geometry and Applications, Vol. 9, No. 1, 81-96, 1999. |
| |
|
| |
Akl, S.G. and Bhattacharya, B.K., "Optimal parallel algorithm for the maximum clique problem in a family of proper circulars", Journal of Parallel Algorithms and Applications, 1997. |
| |
|
| |
Bhattacharya, B.K. and Sen, S., "On a simple, practical, optimal output-sensitive randomized planar convex hull algorithm", Journal of Algorithms, Vol. 25, 1997, 177-193, 1997. |
| |
|
| |
Bhattacharya, B.K. and Kaller, D., "An O(m+nlogn) algorithm for the maximum-clique problem in circular-arc graphs", Journal of Algorithms, Vol. 25, 1997, 336-358, 1997. |
| |
|
| |
S. Jadhav, A. Mukhopadhyay and B.K. Bhattacharya, An optimal algorithm for the intersection radius of a set of convex polygons, Journal of ALgorithms, Vol.20, No. 2, 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 of Discrete Mathematics", Vol. 9, No. 2, 1996, pp.274-289, 1996. |
| |
|
| |
Bhattacharya, B.K., Mukhopadhyay, A. and Roberts, "J-M, Optimal algorithms for some intersection
radius problems",
Computing, Vol. 52, No. 3, 1994 pp.269-279, 1994. |
| |
|
| |
B.K. Bhattacharya, J. Czyzowich, P. Egyed, G. T. Toussaint, I. Stojmenovic, J. Urrutia, Computing the shortest transversal of sets, International Journal on Computational Geometry and Applications, Vol. 2, No. 4, 1992, pp. 417-442. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "Computing Shortest Transversals" Computing, Vol. 46, 1991, pp. 93-119, 1991. |
| |
|
| |
Bhattacharya, B.K., Everett, H. and Toussaint, G.T., "A counterexample to a dynamic algorithm f
or convex
hulls of line arrangements" Pattern Recognition Letters, Vol.12, 1991, pp. 145-147, 1991. |
| |
|
| |
Bhattacharya, B.K., "An optimal algorithm to translate a convex polyhedron through a two-dimens
ional
convex window", CVGIP: Graphical Models and Image Processing, Vol.53, No.5, 1991, pp.269-270, 1991. |
| |
|
| |
Avis, D., Bhattacharya, B.K. and Imai, H., "Fast algorithims for computing the diameter of a finite planar point sets", Visual Computer, Vol.3, 1988. |
| |
|
| |
Bhattacharya, B.K. and Zorbas, J., "Solving the two-dimensional findpath problem using a line t
riangle
representation of the robot" Journal of Algorithms, Vol.9, 1988, pp.449-469. |
| |
|
| |
Bhattacharya, B.K., "Circular separability of finite planar sets" Computer Morohology, edited by G.T. Toussaint, North-Holland, 1988, pp. 25-39, 1988. |
| |
|
| |
Cameron, R.D.;Bhattacharyya, B.K.., Merks, E.A.T., "Efficient reconstruction of binary trees from their traversals" Applied Mathematics Letters Vol 2, No. 1, 1988, pp. 79-82. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "Fast algorithims for computing the diameter of a finite planar set", Visual Computer, Vol. 3, 1988, pp. 379-388. |
| |
|
| |
Bhattacharya, B.K. and Zorbas, J., "Solving the two-dimensional findpath problem using a line triangle of representation of the robot" Journal of Algorithms Vol9, 1988, pp. 449-469. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "On geometric algorithms that use the furthest point Voronoi diagram",Computational Geometry, Edited by G.T. Toussaint, North-Holland, 1985, pp. 43-61. |
| |
|
| |
Bhattacharya, B.K. and Eligindy, H., "A new linear convex hull algorithm for simple polygons", IEEE Transactions on Information Theory, Vol. IT-30, No. 1, 1984, pp. 85-88. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "Efficient algorithms for computing the maximum distance between two finite planar set" Journal of Algorithms, Vol.4, 1983, pp. 121-136. |
| |
|
| |
Toussaint, G.T. and Bhattacharya, B.K., "Optimal algorithms for computing the minimum distance between two finite planar sets", Pattern Recognition Letters, Vol.2, 1983, pp. 79-82. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "Time and storage - efficient implementation of an optimal planar convex hull algorithm" Image and Vision Computing, Vol.1, No.3, 1983, pp.140-144. |
| |
|
| |
Avis, D. and Bhattacharya, B.K., "Algorithms for computing d-dimensional Voronoi diagrams and their duals", Computational Geometry, Edited by F.P. Preparata, Jai Press, 1983, pp. 159-180. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "A counterexample to a diameter algorithm for convex polygons", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-4, No.3, 1982, pp. 306-309. |
| |
|
| |
Avis, D., Toussaint, G.T. and Bhattacharya, B.K., "On multimodality of distances in ocnvex polygons", Computers and Mathematics with Applications, Vol.8, No.2, 1982, pp.153-156. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "An upper bound on the probability of misclassification in terms of Matusita's measure of affinity" Annals of the Institute of Statistical Mathematics, Vol.34, No.1, A, 1982, pp. 161-165. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "Comment on: On divergence and probability of eror in pattern recognition" Proceedings of the IEEE, Vol,68, No.4, 1980, pp.539-540. |
| |
|
| |
| Conference Proceedings |
| |
Binay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi: Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. ISAAC 2008: 800-811 |
| |
|
| |
Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi: New Upper Bounds on Continuous Tree Edge-Partition Problem. AAIM 2008: 38-49 |
| |
|
| |
Binay K. Bhattacharya, B. Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese: Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region. COCOA 2008: 103-115 |
| |
|
| |
Bhattacharya, B.K., Hu, Y., and Kononov A., Approximation Algorithms for the Black and White Traveling Salesman Problem, Proceedimgs of COCOON: 559-567, 2007. (Invited to a special issue) |
| |
|
| |
Ben-Moshe B., Bhattacharya, B.K., Das S., Gaur D., Shi Q., Computing a planar widest empty alpha-siphon in o(n3) time, Proceedings of CCCG, 33-36, 2007. |
| |
|
| |
Bhattacharya, B.K. and Sember, J, Efficient Snap Rounding with Integer Arithmetic, Proceedings of CCCG, 145-148, 2007. |
| |
|
| |
Bhattacharya, B.K. and Shi Q., Optimal algorithms for the weighted p -center problems on the real line for small p, Proceedings of WADS:529-540, 2007. |
| |
|
| |
Gaur D. and Bhattacharya, B.K. "Covering points by axis parallel lines", (Extended Abstract), EWCG 42-45, 2007. |
| |
|
| |
Bhattacharya, B.K., Hu, Y., Shi, Q., and Tamir, A., ''Optimal algorithms for the path/tree-shaped facility location problems in trees", Proceedings of ISAAC, 379-388, 2006.(Invited to a special issue) |
| |
|
| |
Bhattacharya, B.K., Zhang, J., Shi, Q., and Kameda, T., An optimal solution to room search problem, Proceedings of CCCG, 55-58, 2006. |
| |
|
| |
Ben-Moshe, B., Bhattacharya, B.K. and Shi, Q., A linear-time algorithm for solving the weighted 2-center problem,
Proceedings of LATIN, 166-167, 2006. |
| |
|
| |
Bhattacharya, B.K., Mukherjee, K. and Toussaint, G.T.,
''Geometric decision rules for instance-based learning problems,
Proceedings of the First International Conference on Pattern Recognition and Machine Learning, Kolkata, December 15-18, 2005 (invited paper). |
| |
|
| |
Ben-Moshe, B, Bhattacharya, B.K., Shi, Q,
''Efficient algorithms for the weighted 2-center problem in a cactus graph'',
Proceedings of ISAAC, 2005 (Invited to a special issue). |
| |
|
| |
Boaz Benmoshe, Binay Bhattacharya and Qiaosheng Shi,
Implicit representation of the farthest point Voronoi diagram in the plane. Proceedings of CCCG, 2005. |
| |
|
| |
Ben-Moshe, B., Bhattacharya, B.K. and Shi, Q.,
''Computing the widest empty boomerang'',
Proceedings of Canadian Conference on Computational Geometry, 2005. |
| |
|
| |
Robert Benkoczi, Binay Bhattacharya, Sandip Das and Jeff Sember, Collection depots problems in the plane. Proc. of CCCG, 2005. (Invited to a special issue of Computational Geometry: Theory and Applications.) |
| |
|
| |
Robert Benkoczi and Binay Bhattacharya, New results in median problems in trees, Proc. of ESA, 2005. |
| |
|
| |
Binay Bhattacharya, Kaustav Mukherjee and Godfried T. Toussaint, "Geometric decision rules for high dimensions," Proceedings of the 55th Session of the International Statistics Institute, Sydney, Australia, April 5-12, 2005 (invited paper). |
| |
|
| |
Benkoczi, R., Bhattacharya, B.K. and Merchant, R.,
''Constrained Weighted Rectilinear Median Problem in the Plane'',
Japan Conference on Discrete and Computational geometry, October 8-11, 2004. |
| |
|
| |
R. Benkoczi, B.K. Bhattacharya, M. Chrobak, L.L. Larmore, W. Rytter, Faster Algorithms for k-Median Problems in Trees, MFCS, Aug. 2003, Budapest. |
| |
|
| |
B.K.Bhattacharya and A. Mukhopadhyay, On Minimal Perimeter triangle enclosing a convex polygon, JCDCG, Japan, 2002. |
| |
|
| |
Robert Benkoczi, David Breton and Binay Bhattacharya, "Optimal location in trees using the spine decomposition", 5th International Conference of Operations Research, Havana,
March 4-8, 2002. |
| |
|
| |
S. Bespamyatnikh, B.K. Bhattacharya, D. Kirkpatrick anf M.Segal, Lower and Upper Bounds for Tracking Mobile Users, 2nd IFIP International Conference on Theoretical Computer Science, Track 1, Montreal, August 25-30, 2002. |
| |
|
| |
B.K. Bhattacharya and H. ElGindy, Cluster identification in tree networks, Proceedings of Communications in Computing CIC-2002 , 2002. |
| |
|
| |
R. Benkoczi, B.K. Bhattacharya and D. Breton, Efficient computation of 2-medians in a tree network with positive/negative weights, R.C. Bose Centennial Symposium on Discrete Mathematics, Calcutta, 2002. |
| |
|
| |
Bhattacharya, B. and Mukhopadhyay, A.,"A linear time algorithm for computing the minimum perimeter triangle of a convex polygon", 17 European Workshop on Computational Geometry, Berlin, 2001. |
| |
|
| |
Binay Bhattacharya, Asish Mukhopadhyay and Giri Narasimhan, "Optimal algorithms for two-guard walkability of simple polygons", Seventh International Workshop on Algorithms and Data Structures, August 2001, pp.438-449. |
| |
|
| |
Benitez, M., Bhattacharya, B.K. and Gupta, K.
EODM - a novel representation for collison detection, 2000 ICRA, San Francisco, 2000. |
| |
|
| |
Bespamyatnikh, S., Bhattacharya, B.K., Keil, M.J., Kirkpatrick, D. and Segal, M., "Efficient algorithms for centers and medians in interval and circular-arc graphs", European Symposium on Algorithms, 2000, 100-111. |
| |
|
| |
Bespamyatnikh, S., Bhattacharya, B.K., Kirkpatrick, D. and Segal, M., "Mobile facility location", Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Boston, August 2000. |
| |
|
| |
Bhattacharya, B.K. and Houle, M..
"Generalized maximum independent sets for trees",
Tenth ISAAC, Chennai, 1999. |
| |
|
| |
Agarwal, P., Bhattacharya, B.K. and Sen, S.
"Output-sensitive algorithms for uniform partition of points"
Tenth ISSAC, Chennai, 1999. |
| |
|
| |
Bhattacharya, B.K., Ghosh, S.
Characterizing LR-visibility polygons and related problems, Tenth CCCG, 1998. |
| |
|
| |
Bhattacharya, B.K., Kaller, D.
"Reference set thinning for the k-nearest neighbor decision rule" 14th ICPR, Brisbane, 1998. |
| |
|
| |
Bhattacharya, B.K. and Houle, M., Generalized maximum independent sets for acyclic graphs, Computing: The Australian Theory Symposium, Melbourne, Australia, 1997. |
| |
|
| |
Bhattacharya, B.K. and El-Gindy, H., Biased searching and k-point clustering, Ninth Canadian Conference on Computational Geometry, Kingston, Canada, 1997. |
| |
|
| |
Bhattacharya, B.K. and Mukhopadhyay, A. Optimal time algorithm to determine a chord from which a polygon is weakly internally visible,
Proc. ISAAC, 1995. |
| |
|
| |
A. Mukhopadhyay, C. Kumar, B.K. Bhattacharya, Computing an area-optimal convex polygonal stabber of a set of parallel line segments, CCCG, 1993, 169-174. |
| |
|
| |
P. Mitra and B.K. Bhattacharya, Efficient approximate shortest-path queries among isothetic rectangular obstacles, WADS, 1993, pp. 518-529. |
| |
|
| |
S. Jadhav, A. Mukhopadhyay, B.K. Bhattacharya, An optimal algorithm for the intersection radius of convex polygons, FSTTCS, 1992, pp.92-103. |
| |
|
| |
Usefulness of angle-sweep over line-sweep, B.K.Bhattacharya, FSTTCS, 1991, pp.390-419. |
| |
|
| |
B.K. Bhattacharya, S. Jadhav, A. Mukhopadhyay, J.-M. Roberts, Optimal algorithms for some intersection radius problems, Proceedings ACM Symposium on Computational Geometry, pp.81-88. |
| |
|
| |
Bhattacharya, B.K., Mukhopadhyay, A., and Toussaint, G.T., "A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible", Proceedings of the 2nd WADS. August 1991, pp. 421-424. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "Computing
transversals" Proceedings of the ICALP, 1991 |
| |
|
| |
J. Czyzowicz, P. Egyed, I. Stojmenovich, J.-M. Robert, G.T. Toussaint, Computing shortest traversals of sets, Proceedings ACM Symposium on Computational Geometry, 1991, pp.71-80. |
| |
|
| |
Bhattacharya, B.K., Egyed, P. and Toussaint, G.T., "On shortest distances inside X-shaped polygons." Proceedings of the 3rd CCCG, 1991, pp. 88-91. |
| |
|
| |
Bhattacharya, B.K., and Shermer, T., "Polygonal separators and digital shape recognition", Proceedings of the 2nd. Canadian Conference in Computational Geometry, 1990, 74-77. |
| |
|
| |
Bhattacharya, B.K., Chiabaut, J., Graf, D., Peacocke, D, Shibahara, T, "Text-dependent speaker identification using telephone speech", Proceedings of Canadian Conference on Electrical and Computer Engineering, 1990, (5 pages). |
| |
|
| |
Bhattacharya, B.K., Kirkpatric, D.G. and Toussaint, G.T., "Determining sector visibility of a polygon", Proceedings of the 5th ACM Symposium on Computational Geometry, June 1989, pp.247-254. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "Computing minimal spanning covers of sets", Proceddings of the 1st Canadian Conference on Computationa Geometry, June 1989, pp.24. |
| |
|
| |
Bhattacharya, B.K., "An efficient on-line Chebyshev approximation algorithm for a finite planar set", Proceedings of the Allerton Conference on Communication, Control and Computing, Illinois, September 1988, pp.107-108. |
| |
|
| |
Asano, T., Bhattacharya, B.K., Keil, M. and Yao, F., "Clustering algorithms based on minimum and mzximum spanning trees", Proceedings of the 4th ACM Symposium on Computational Geometry, June 1988, pp.252-257. |
| |
|
| |
Avis, D., Bhattacharya, B.K. and Imai, H., "Computing the volume of the union os spheres", 113th IFIP Conference on System Modelling and Optimization, Tokyo, 1987, pp.66. |
| |
|
| |
Bhattacharya, B.K. and Toussaint, G.T., "Fast algorithms for computing the diameter of a finite planar set", Proceedings of Computer Graphics International, 1987. Editor: T.L. Kunii, Springer Verlag, 1987, pp.89-104. |
| |
|
| |
Xie, Shun-en; Calvert, T.W. and Bhattacharya, B.K., "Planning viewpoints and the navigation route of patrol robot in a known 2-D environment", SPIE's 1986 Cambridge Symposium in Advances in Intelligent Robotics Systems, Mass., October 1986, pp.206-212. |
| |
|
| |
Xie, S.; Calvert, T.W. and Bhattacharya, B.K., "Planning views for the incremental construction of bosy models", Proceedings of the 8th International Conference on Pattern Recognition, Paris, October 1986 (4 pages). |
| |
|
| |
Toussaint, G.T., Bhattacharya, B.K. and Poulsen, R.S., "The applications of Voronoi diagrams to nonparametric decision rules", Proceedings of Computer Science and Statistics, 16th Symposuim on the Interface, Atlanta, Georgia, March 1984, pp. 1-12. |
| |
|
| |
Bhattacharya, B.K., "An algorithm for computing order k Voronoi diagram in the plane", Proceedings of the Allerton Conference on Communication, Control, and Computing, Illinois, October 1984, pp.120-121. |
| |
|
| |
Bhattacharya, B.K. and ElGindy, H., "A new linear convex hull algorithm for simple polygons", IEEE International Symposium on Information Theory, Les Ares, France, June 1982. |
| |
|
| |
Toussaint, G.T. and Bhattacharya, B.K., "The complexity of computing distances between sets", IEEE International Symposium on Information Theory, Les Ares, France, June 1982. |
| |
|
| |
Toussaint, G.T. and Bhattacharya, B.K., "Optimal algorithms for computing the minimum distance between two finite planar sets", Fifth International Congress of Cybernetics and Systems, Mexico City, August 1981. |
| |
|
| |
Toussaint, G.T., Bhattacharya, B.K. and Poulsen, R.S., "Graph theoretic methods for edited nearest neighbor decision rule", IEEE International Symposium on Information Theory, Santa Monica, February 1981. |
| |
|
| |
| Industry Sponsored Acitivities |
| |
PERSONALIZED TRAFFIC ALERT: This is a part of MITACS project sponsored by an industrial partner. A prototype is being built for an Ottawa based taxi company to monitor the road conditions of city road networks in order to alert an user if his/her (personalized) path registered with the system is being currently affected and suggests alternate shortest travel time paths. The road conditions are monitored by accessing the live GPS data available from the taxi fleet plying in the city roads. |
| |
|
| |
LIMOUSINE SCHEDULING IN OTTAWA REGION. This is a part of MITACS project sponsored by an industrial partner. A prototype has been built for the industrial partner. The prototype has been tested extensively by the partner. |
| |
|
| |
Built a prototype to schedule vehicles to distribute modems to customers in Atlanta metropolitan area. (Sponsor: Dynamex Inc.) |
| |
|
| |
Built a prototype to schedule patients' transfer between hospitals/care-homes by ambulances in Greater Vancouver area.
(Sponsor: FDM software) |
| |
|
| |
Finished developing a prototype for the same-day pickup-and-delivery courier schedule in Greater Vancouver area. (Sponsor: Dynamex Inc.) |
| |
|
| |
Finished developing a sytem to estimate the travel times between locations in cities. The system has been tested on Greater Vancouver, Atalanta and Dallas road networks. (Sponsor: Dynamex Inc. and FDM software) |
| |
|
| |
B.K. Bhattacharya, S. Mitrovic-Minic, The dynamic TSPTW on a line: Do preprocessing so that insertion of a new location into an existing route may be done in sublinear time,EURO/INFORMS Joint International Meeting, Istanbul, Turkey,July 6-10, 2003. |
| |
|