Binay K. Bhattacharya

	2011
79		Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi: Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. ICTAC 2011: 45-61
	2010
78		Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya: Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368
77		Binay K. Bhattacharya, Yuzhuang Hu: Approximation Algorithms for the Multi-Vehicle Scheduling Problem. ISAAC (2) 2010: 192-205
76		Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink: Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM 2010: 82-93
	2009
75		Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi: Approximation Algorithms for a Network Design Problem. COCOON 2009: 225-237
74		Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang: Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. ICRA 2009: 2461-2466
73		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
72		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)
71		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)
70		Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember: Single facility collection depots location problem in the plane. Comput. Geom. 42(5): 403-418 (2009)
69		Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir: Collection depots facility location problems in trees. Networks 53(1): 50-62 (2009)
68		Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese: Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci. 410(52): 5515-5528 (2009)
	2008
67		Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi: New Upper Bounds on Continuous Tree Edge-Partition Problem. AAIM 2008: 38-49
66		Qiaosheng Shi, Binay K. Bhattacharya: Application of computational geometry to network p-center location problems. CCCG 2008
65		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
64		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
63		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)
62		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
61		Binay K. Bhattacharya, Jeff Sember: Efficient Snap Rounding with Integer Arithmetic. CCCG 2007: 145-148
60		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
59		Binay K. Bhattacharya, Yuzhuang Hu, Alexander Kononov: Approximation Algorithms for the Black and White Traveling Salesman Problem. COCOON 2007: 559-567
58		Binay K. Bhattacharya, Qiaosheng Shi: Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p. WADS 2007: 529-540
57		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)
56		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
55		Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda: An Optimal Solution to Room Search Problem. CCCG 2006
54		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
53		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
52		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)
51		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)
50		Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Competitive Algorithms for Maintaining a Mobile Center. MONET 11(2): 177-186 (2006)
	2005
49		Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. CCCG 2005: 243-246
48		Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember: Collection depot location problem in the plane. CCCG 2005: 76-79
47		Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Computing the Widest Empty Boomerang. CCCG 2005: 80-83
46		Robert Benkoczi, Binay K. Bhattacharya: A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time. ESA 2005: 271-282
45		Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. ISAAC 2005: 693-703
44		Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint: Geometric Decision Rules for Instance-Based Learning Problems. PReMI 2005: 60-69
	2003
43		Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter: Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227
42		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
41		Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58
40		Binay K. Bhattacharya, Asish Mukhopadhyay: On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG 2002: 84-96
39		Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen: Improved Algorithms for Uniform Partitions of Points. Algorithmica 32(4): 521-539 (2002)
38		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)
37		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. Networks 39(3): 144-152 (2002)
	2001
36		Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan: Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS 2001: 438-449
35		Binay K. Bhattacharya, Subir Kumar Ghosh: Characterizing LR-visibility polygons and related problems. Comput. Geom. 18(1): 19-36 (2001)
34		Binay K. Bhattacharya, Robert Benkoczi: On computing the optimal bridge between two convex polygons. Inf. Process. Lett. 79(5): 215-221 (2001)
	2000
33		Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Mobile facility location. DIAL-M 2000: 46-53
32		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
31		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
30		Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen: Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC 1999: 403-414
29		Binay K. Bhattacharya, Michael E. Houle: Generalized Maximum Independent Sets for Trees in Subquadratic Time. ISAAC 1999: 435-445
28		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
27		Binay K. Bhattacharya, Subir Kumar Ghosh: Characterizing lr-visibility polygons and related problems. CCCG 1998
	1997
26		Binay K. Bhattacharya: Biased search and k-point clustering. CCCG 1997
25		Binay K. Bhattacharya, Sandeep Sen: On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms 25(1): 177-193 (1997)
24		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)
23		Selim G. Akl, Binay K. Bhattacharya: Computing Maximum Cliques of Circular Arcs in Parallel. Parallel Algorithms Appl. 12(4): 305-320 (1997)
	1996
22		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)
21		Binay K. Bhattacharya, Pavol Hell, Jing Huang: A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. SIAM J. Discrete Math. 9(2): 274-289 (1996)
	1995
20		Binay K. Bhattacharya, Asish Mukhopadhyay: Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. ISAAC 1995: 22-31
	1994
19		Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, J.-M. Robert: Optimal algorithms for some intersection radius problems. Computing 52(3): 269-279 (1994)
	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	[30] [39]
2	Selim G. Akl	[23]
3	Ei Ando	[79]
4	Tetsuo Asano	[6]
5	David Avis	[4]
6	Boaz Ben-Moshe	[45] [47] [49] [53] [56] [60] [62]
7	Maria del C. Amézquita Benítez	[31]
8	Robert Benkoczi	[34] [42] [43] [46] [48] [51] [67] [69] [70]
9	Sergey Bereg (Sergei Bespamyatnikh)	[32] [33] [37] [41] [50]
10	Arijit Bishnu	[71] [76]
11	David Breton	[42] [51]
12	B. Burmester	[65]
13	Mike Burmester	[68]
14	Paz Carmi	[64]
15	Otfried Cheong (Otfried Schwarzkopf)	[71] [76]
16	Marek Chrobak	[43]
17	Jirel Czyzowicz	[15]
18	Jurek Czyzowicz	[12]
19	Gautam Das	[38]
20	Sandip Das	[48] [60] [70] [71] [76] [78]
21	Peter Egyed	[12] [15]
22	Martin Ester	[62]
23	Hazel Everett	[8]
24	Byron J. Gao	[62]
25	Daya Ram Gaur	[60]
26	Rong Ge	[62]
27	Subir Kumar Ghosh	[27] [35] [52] [57]
28	Partha P. Goswami	[57]
29	Eugene Greene	[63]
30	Kamal K. Gupta	[31]
31	Pavol Hell	[21]
32	Michael E. Houle	[29]
33	Yuzhuang Hu	[54] [59] [64] [65] [68] [73] [75] [77] [79]
34	Zengjian Hu	[62]
35	Jing Huang	[21]
36	Hiroshi Imai	[4]
37	Shreesh Jadhav	[11] [16] [19] [22]
38	Damon Kaller	[24]
39	Tsunehiko Kameda	[55] [74] [79]
40	Arindam Karmakar	[71] [76] [78]
41	J. Mark Keil	[6] [32] [37]
42	David G. Kirkpatrick	[7] [32] [33] [37] [41] [50]
43	Alexander Kononov	[59]
44	Evangelos Kranakis	[65] [68] [73]
45	Danny Krizanc	[73]
46	Chanchal Kumar	[18] [63]
47	Lawrence L. Larmore	[43]
48	Pinaki Mitra	[17]
49	Kaustav Mukherjee	[44]
50	Asish Mukhopadhyay	[10] [11] [16] [18] [19] [20] [22] [28] [36] [38] [40] [63]
51	Subhas C. Nandy	[78]
52	Giri Narasimhan	[36] [38]
53	J.-M. Robert	[19]
54	Jean-Marc Robert	[11]
55	Wojciech Rytter	[43]
56	Michael Segal	[32] [33] [37] [41] [50]
57	Jeff Sember	[48] [61] [70]
58	Sandeep Sen	[25] [30] [39]
59	Thomas C. Shermer	[52] [57]
60	Qiaosheng Shi	[45] [47] [49] [53] [54] [55] [56] [58] [60] [64] [65] [66] [67] [68] [72] [73] [75] [79]
61	Jack Snoeyink	[71] [76]
62	Ivan Stojmenovic	[12] [15]
63	Arie Tamir	[54] [56] [69] [72]
64	Godfried T. Toussaint	[1] [2] [3] [7] [8] [10] [12] [13] [15] [28] [44]
65	Jorge Urrutia	[12] [15]
66	Andreas Wiese	[65] [68]
67	F. Frances Yao (Frances F. Yao, Foong Frances Yao)	[6]
68	John Z. Zhang	[55] [74]
69	J. Zorbas	[5]

Colors in the list of coauthors

Last update Thu May 24 01:13:30 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page