| 2010 |
|---|
| 14 | Computation of Non-dominated Points Using Compact Voronoi Diagrams. Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink. WALCOM 2010, 82-93. Web SearchBibTeXDownload |
| 2009 |
|---|
| 13 | On Finding Non-dominated Points using Compact Voronoi Diagrams. Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink. CoRR (abs/0909.0814) (2009). Web SearchBibTeXDownload |
| 2008 |
|---|
| 12 | Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications. Rong Ge, Martin Ester, Byron J. Gao, Zengjian Hu, Binay K. Bhattacharya, Boaz Ben-Moshe. TKDD (2) (2008). Web SearchBibTeXDownload |
| 2006 |
|---|
| 11 | Competitive Algorithms for Maintaining a Mobile Center. Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. MONET (11): 177-186 (2006). Web SearchBibTeXDownload |
| 2002 |
|---|
| 10 | Improved Algorithms for Uniform Partitions of Points. Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen. Algorithmica (32): 521-539 (2002). Web SearchBibTeXDownload |
| 9 | Optimally computing a shortest weakly visible line segment inside a simple polygon. Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan. Comput. Geom. (23): 1-29 (2002). Cited by 3Web SearchBibTeXDownload |
| 8 | Lower and Upper Bounds for Tracking Mobile Users. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. IFIP TCS 2002, 47-58. Web SearchBibTeX |
| 7 | Efficient algorithms for centers and medians in interval and circular-arc graphs. Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal. Networks (39): 144-152 (2002). Web SearchBibTeXDownload |
| 2000 |
|---|
| 6 | Mobile facility location. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. DIAL-M 2000, 46-53. Web SearchBibTeXDownload |
| 5 | Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal. ESA 2000, 100-111. Web SearchBibTeXDownload |
| 1999 |
|---|
| 4 | Output-Sensitive Algorithms for Uniform Partitions of Points. Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen. ISAAC 1999, 403-414. Web SearchBibTeXDownload |
| 3 | Generalized Maximum Independent Sets for Trees in Subquadratic Time. Binay K. Bhattacharya, Michael E. Houle. ISAAC 1999, 435-445. Web SearchBibTeXDownload |
| 1989 |
|---|
| 2 | Determining Sector Visibility of a Polygon. Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint. Symposium on Computational Geometry 1989, 247-253. Web SearchBibTeXDownload |
| 1988 |
|---|
| 1 | Computing the volume of the union of spheres. David Avis, Binay K. Bhattacharya, Hiroshi Imai. The Visual Computer (3): 323-328 (1988). Web SearchBibTeXDownload |
