Binay K. Bhattacharya

	2009
71		Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi: Approximation Algorithms for a Network Design Problem. COCOON 2009: 225-237
70		Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Evangelos Kranakis, Danny Krizanc: Sensor network connectivity with multiple directional antennae of a given angular sum. IPDPS 2009: 1-11
69		Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir: Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. Algorithmica 55(4): 601-618 (2009)
68		Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink: On Finding Non-dominated Points using Compact Voronoi Diagrams CoRR abs/0909.0814: (2009)
67		Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir: Collection depots facility location problems in trees. Networks 53(1): 50-62 (2009)
	2008
66		Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi: New Upper Bounds on Continuous Tree Edge-Partition Problem. AAIM 2008: 38-49
65		Qiaosheng Shi, Binay K. Bhattacharya: Application of computational geometry to network p-center location problems. CCCG 2008
64		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
63		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
62		Asish Mukhopadhyay, Chanchal Kumar, Eugene Greene, Binay K. Bhattacharya: On intersecting a set of parallel line segments with a convex polygon of minimum area. Inf. Process. Lett. 105(2): 58-64 (2008)
61		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): (2008)
	2007
60		Binay K. Bhattacharya, Jeff Sember: Efficient Snap Rounding with Integer Arithmetic. CCCG 2007: 145-148
59		Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi: Computing a planar widest empty alpha-siphon in o(n3) time. CCCG 2007: 33-36
58		Binay K. Bhattacharya, Yuzhuang Hu, Alexander Kononov: Approximation Algorithms for the Black and White Traveling Salesman Problem. COCOON 2007: 559-567
57		Binay K. Bhattacharya, Qiaosheng Shi: Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p. WADS 2007: 529-540
56		Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami: Computing the maximum clique in the visibility graph of a simple polygon. J. Discrete Algorithms 5(3): 524-532 (2007)
55		Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir: Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378(3): 237-252 (2007)
	2006
54		Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda: An Optimal Solution to Room Search Problem. CCCG 2006
53		Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir: Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. ISAAC 2006: 379-388
52		Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. LATIN 2006: 166-177
51		Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer: A linear time algorithm to remove winding of a simple polygon. Comput. Geom. 33(3): 165-173 (2006)
50		Robert Benkoczi, Binay K. Bhattacharya, David Breton: Efficient computation of 2-medians in a tree network with positive/negative weights. Discrete Mathematics 306(14): 1505-1516 (2006)
49		Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Competitive Algorithms for Maintaining a Mobile Center. MONET 11(2): 177-186 (2006)
	2005
48		Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. CCCG 2005: 243-246
47		Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember: Collection depot location problem in the plane. CCCG 2005: 76-79
46		Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Computing the Widest Empty Boomerang. CCCG 2005: 80-83
45		Robert Benkoczi, Binay K. Bhattacharya: A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time. ESA 2005: 271-282
44		Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. ISAAC 2005: 693-703
43		Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint: Geometric Decision Rules for Instance-Based Learning Problems. PReMI 2005: 60-69
	2003
42		Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter: Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227
41		Robert Benkoczi, Binay K. Bhattacharya, David Breton: Efficient computation of 2-medians in a tree network with positive/negative weights. Electronic Notes in Discrete Mathematics 15: 39-42 (2003)
	2002
40		Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58
39		Binay K. Bhattacharya, Asish Mukhopadhyay: On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG 2002: 84-96
38		Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen: Improved Algorithms for Uniform Partitions of Points. Algorithmica 32(4): 521-539 (2002)
37		Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan: Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. 23(1): 1-29 (2002)
36		Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, J. David Kirkpatrick, Michael Segal: Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002)
	2001
35		Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan: Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS 2001: 438-449
34		Binay K. Bhattacharya, Subir Kumar Ghosh: Characterizing LR-visibility polygons and related problems. Comput. Geom. 18(1): 19-36 (2001)
33		Binay K. Bhattacharya, Robert Benkoczi: On computing the optimal bridge between two convex polygons. Inf. Process. Lett. 79(5): 215-221 (2001)
	2000
32		Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Mobile facility location. DIAL-M 2000: 46-53
31		Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal: Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA 2000: 100-111
30		Maria del C. Amézquita Benítez, Kamal K. Gupta, Binay K. Bhattacharya: EODM - A Novel Representation for Collision Detection. ICRA 2000: 3727-3732
	1999
29		Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen: Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC 1999: 403-414
28		Binay K. Bhattacharya, Michael E. Houle: Generalized Maximum Independent Sets for Trees in Subquadratic Time. ISAAC 1999: 435-445
27		Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint: Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. Int. J. Comput. Geometry Appl. 9(1): 81- (1999)
	1998
26		Binay K. Bhattacharya, Subir Kumar Ghosh: Characterizing lr-visibility polygons and related problems. CCCG 1998
	1997
25		Binay K. Bhattacharya: Biased search and k-point clustering. CCCG 1997
24		Binay K. Bhattacharya, Sandeep Sen: On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms 25(1): 177-193 (1997)
23		Binay K. Bhattacharya, Damon Kaller: An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. J. Algorithms 25(2): 336-358 (1997)
22		Selim G. Akl, Binay K. Bhattacharya: Computing Maximum Cliques of Circular Arcs in Parallel. Parallel Algorithms Appl. 12(4): 305-320 (1997)
	1996
21		Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. J. Algorithms 20(2): 244-267 (1996)
20		Binay K. Bhattacharya, Pavol Hell, Jing Huang: A Linear Algorithm for Maximum Weight Cliques in ProperCircular Arc Graphs. SIAM J. Discrete Math. 9(2): 274-289 (1996)
	1995
19		Binay K. Bhattacharya, Asish Mukhopadhyay: Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. ISAAC 1995: 22-31
	1993
18		Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya: Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. CCCG 1993: 169-174
17		Pinaki Mitra, Binay K. Bhattacharya: Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. WADS 1993: 518-529
	1992
16		Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. FSTTCS 1992: 92-103
15		Binay K. Bhattacharya, Jirel Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia: Computing shortest transversals of sets. Int. J. Comput. Geometry Appl. 2(4): 417-442 (1992)
	1991
14		Binay K. Bhattacharya: Usefulness of Angle-Sweep over Line-Sweep. FSTTCS 1991: 390-419
13		Binay K. Bhattacharya, Godfried T. Toussaint: Computing Shortest Transversals. ICALP 1991: 649-660
12		Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia: Computing Shortest Transversals of Sets (Extended Abstract). Symposium on Computational Geometry 1991: 71-80
11		Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert: Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). Symposium on Computational Geometry 1991: 81-88
10		Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint: A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. WADS 1991: 412-424
9		Binay K. Bhattacharya: An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window. CVGIP: Graphical Model and Image Processing 53(3): 269-270 (1991)
8		Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint: A counterexample to a dynamic algorithm for convex hulls of line arrangements. Pattern Recognition Letters 12(3): 145-147 (1991)
	1989
7		Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint: Determining Sector Visibility of a Polygon. Symposium on Computational Geometry 1989: 247-253
	1988
6		Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao: Clustering Algorithms Based on Minimum and Maximum Spanning Trees. Symposium on Computational Geometry 1988: 252-257
5		Binay K. Bhattacharya, J. Zorbas: Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot. J. Algorithms 9(4): 449-469 (1988)
4		David Avis, Binay K. Bhattacharya, Hiroshi Imai: Computing the volume of the union of spheres. The Visual Computer 3(6): 323-328 (1988)
3		Binay K. Bhattacharya, Godfried T. Toussaint: Fast algorithms for computing the diameter of a finite planar set. The Visual Computer 3(6): 379-388 (1988)
	1983
2		Binay K. Bhattacharya, Godfried T. Toussaint: Time- and storage-efficient implementation of an optimal planar convex hull algorithm. Image Vision Comput. 1(3): 140-144 (1983)
1		Binay K. Bhattacharya, Godfried T. Toussaint: Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. J. Algorithms 4(2): 121-136 (1983)

Coauthor Index

1	Pankaj K. Agarwal	[29] [38]
2	Selim G. Akl	[22]
3	Tetsuo Asano	[6]
4	David Avis	[4]
5	Boaz Ben-Moshe	[44] [46] [48] [52] [55] [59] [61]
6	Maria del C. Amézquita Benítez	[30]
7	Robert Benkoczi	[33] [41] [42] [45] [47] [50] [66] [67]
8	Sergey Bereg (Sergei Bespamyatnikh)	[31] [32] [36] [40] [49]
9	Arijit Bishnu	[68]
10	David Breton	[41] [50]
11	B. Burmester	[64]
12	Paz Carmi	[63]
13	Otfried Cheong (Otfried Schwarzkopf)	[68]
14	Marek Chrobak	[42]
15	Jirel Czyzowicz	[15]
16	Jurek Czyzowicz	[12]
17	Gautam Das	[37]
18	Sandip Das	[47] [59] [68]
19	Peter Egyed	[12] [15]
20	Martin Ester	[61]
21	Hazel Everett	[8]
22	Byron J. Gao	[61]
23	Daya Ram Gaur	[59]
24	Rong Ge	[61]
25	Subir Kumar Ghosh	[26] [34] [51] [56]
26	Partha P. Goswami	[56]
27	Eugene Greene	[62]
28	Kamal K. Gupta	[30]
29	Pavol Hell	[20]
30	Michael E. Houle	[28]
31	Yuzhuang Hu	[53] [58] [63] [64] [70] [71]
32	Zengjian Hu	[61]
33	Jing Huang	[20]
34	Hiroshi Imai	[4]
35	Shreesh Jadhav	[11] [16] [21]
36	Damon Kaller	[23]
37	Tsunehiko Kameda	[54]
38	Arindam Karmakar	[68]
39	J. Mark Keil	[6] [31] [36]
40	David G. Kirkpatrick	[7] [31] [32] [40] [49]
41	J. David Kirkpatrick	[36]
42	Alexander Kononov	[58]
43	Evangelos Kranakis	[64] [70]
44	Danny Krizanc	[70]
45	Chanchal Kumar	[18] [62]
46	Lawrence L. Larmore	[42]
47	Pinaki Mitra	[17]
48	Kaustav Mukherjee	[43]
49	Asish Mukhopadhyay	[10] [11] [16] [18] [19] [21] [27] [35] [37] [39] [62]
50	Giri Narasimhan	[35] [37]
51	Jean-Marc Robert	[11]
52	Wojciech Rytter	[42]
53	Michael Segal	[31] [32] [36] [40] [49]
54	Jeff Sember	[47] [60]
55	Sandeep Sen	[24] [29] [38]
56	Thomas C. Shermer	[51] [56]
57	Qiaosheng Shi	[44] [46] [48] [52] [53] [54] [55] [57] [59] [63] [64] [65] [66] [69] [70] [71]
58	Jack Snoeyink	[68]
59	Ivan Stojmenovic	[12] [15]
60	Arie Tamir	[53] [55] [67] [69]
61	Godfried T. Toussaint	[1] [2] [3] [7] [8] [10] [12] [13] [15] [27] [43]
62	Jorge Urrutia	[12] [15]
63	Andreas Wiese	[64]
64	F. Frances Yao (Frances F. Yao, Foong Frances Yao)	[6]
65	John Z. Zhang	[54]
66	J. Zorbas	[5]

Colors in the list of coauthors