The SCEAS System
| |||||||

## Search the dblp DataBase
Binay K. Bhattacharya:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
**Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:243-246 [Conf] - Binay K. Bhattacharya
**Biased search and k-point clustering.**[Citation Graph (0, 0)][DBLP] CCCG, 1997, pp:- [Conf] - Binay K. Bhattacharya, Subir Kumar Ghosh
**Characterizing lr-visibility polygons and related problems.**[Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf] - Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
**Collection depot location problem in the plane.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:76-79 [Conf] - Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
**Computing the Widest Empty Boomerang.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:80-83 [Conf] - Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya
**Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments.**[Citation Graph (0, 0)][DBLP] CCCG, 1993, pp:169-174 [Conf] - Tetsuo Asano, Binay K. Bhattacharya, Mark Keil, F. Frances Yao
**Clustering Algorithms Based on Minimum and Maximum Spanning Trees.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1988, pp:252-257 [Conf] - Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia
**Computing Shortest Transversals of Sets (Extended Abstract).**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1991, pp:71-80 [Conf] - Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert
**Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract).**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1991, pp:81-88 [Conf] - Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint
**Determining Sector Visibility of a Polygon.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:247-253 [Conf] - Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
**Mobile facility location.**[Citation Graph (0, 0)][DBLP] DIAL-M, 2000, pp:46-53 [Conf] - Robert Benkoczi, Binay K. Bhattacharya
**A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time.**[Citation Graph (0, 0)][DBLP] ESA, 2005, pp:271-282 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:100-111 [Conf] - Binay K. Bhattacharya
**Usefulness of Angle-Sweep over Line-Sweep.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:390-419 [Conf] - Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya
**An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1992, pp:92-103 [Conf] - Binay K. Bhattacharya, Godfried T. Toussaint
**Computing Shortest Transversals.**[Citation Graph (0, 0)][DBLP] ICALP, 1991, pp:649-660 [Conf] - Maria del C. Amézquita Benítez, Kamal K. Gupta, Binay K. Bhattacharya
**EODM - A Novel Representation for Collision Detection.**[Citation Graph (0, 0)][DBLP] ICRA, 2000, pp:3727-3732 [Conf] - Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
**Lower and Upper Bounds for Tracking Mobile Users.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:47-58 [Conf] - Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
**Output-Sensitive Algorithms for Uniform Partitions of Points.**[Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:403-414 [Conf] - Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
**Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:693-703 [Conf] - Binay K. Bhattacharya, Michael E. Houle
**Generalized Maximum Independent Sets for Trees in Subquadratic Time.**[Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:435-445 [Conf] - Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir
**Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:379-388 [Conf] - Binay K. Bhattacharya, Asish Mukhopadhyay
**Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible.**[Citation Graph (0, 0)][DBLP] ISAAC, 1995, pp:22-31 [Conf] - Binay K. Bhattacharya, Asish Mukhopadhyay
**On the Minimum Perimeter Triangle Enclosing a Convex Polygon.**[Citation Graph (0, 0)][DBLP] JCDCG, 2002, pp:84-96 [Conf] - Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
**An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:166-177 [Conf] - Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
**Faster Algorithms for**[Citation Graph (0, 0)][DBLP]*k*-Medians in Trees. MFCS, 2003, pp:218-227 [Conf] - Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint
**Geometric Decision Rules for Instance-Based Learning Problems.**[Citation Graph (0, 0)][DBLP] PReMI, 2005, pp:60-69 [Conf] - Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan
**Optimal Algorithms for Two-Guard Walkability of Simple Polygons.**[Citation Graph (0, 0)][DBLP] WADS, 2001, pp:438-449 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] WADS, 1991, pp:412-424 [Conf] - Pinaki Mitra, Binay K. Bhattacharya
**Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles.**[Citation Graph (0, 0)][DBLP] WADS, 1993, pp:518-529 [Conf] - Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
**Improved Algorithms for Uniform Partitions of Points.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:32, n:4, pp:521-539 [Journal] - Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan
**Optimally computing a shortest weakly visible line segment inside a simple polygon.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2002, v:23, n:1, pp:1-29 [Journal] - Binay K. Bhattacharya, Subir Kumar Ghosh
**Characterizing LR-visibility polygons and related problems.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:18, n:1, pp:19-36 [Journal] - Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer
**A linear time algorithm to remove winding of a simple polygon.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:33, n:3, pp:165-173 [Journal] - Binay K. Bhattacharya
**An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window.**[Citation Graph (0, 0)][DBLP] CVGIP: Graphical Model and Image Processing, 1991, v:53, n:3, pp:269-270 [Journal] - Robert Benkoczi, Binay K. Bhattacharya, D. Breton
**Efficient computation of 2-medians in a tree network with positive/negative weights.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:14, pp:1505-1516 [Journal] - Binay K. Bhattacharya, Jirel Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia
**Computing shortest transversals of sets.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1992, v:2, n:4, pp:417-442 [Journal] - Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
**Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:81-0 [Journal] - Binay K. Bhattacharya, Robert Benkoczi
**On computing the optimal bridge between two convex polygons.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:79, n:5, pp:215-221 [Journal] - Binay K. Bhattacharya, Godfried T. Toussaint
**Time- and storage-efficient implementation of an optimal planar convex hull algorithm.**[Citation Graph (0, 0)][DBLP] Image Vision Comput., 1983, v:1, n:3, pp:140-144 [Journal] - Binay K. Bhattacharya, Damon Kaller
**An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1997, v:25, n:2, pp:336-358 [Journal] - Binay K. Bhattacharya, Sandeep Sen
**On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1997, v:25, n:1, pp:177-193 [Journal] - Binay K. Bhattacharya, Godfried T. Toussaint
**Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1983, v:4, n:2, pp:121-136 [Journal] - Binay K. Bhattacharya, J. Zorbas
**Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1988, v:9, n:4, pp:449-469 [Journal] - Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya
**An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:2, pp:244-267 [Journal] - Sergey Bereg, Binay K. Bhattacharya, David Kirkpatrick, Michael Segal
**Competitive Algorithms for Maintaining a Mobile Center.**[Citation Graph (0, 0)][DBLP] MONET, 2006, v:11, n:2, pp:177-186 [Journal] - Sergei Bespamyatnikh, Binay K. Bhattacharya, Mark Keil, J. David Kirkpatrick, Michael Segal
**Efficient algorithms for centers and medians in interval and circular-arc graphs.**[Citation Graph (0, 0)][DBLP] Networks, 2002, v:39, n:3, pp:144-152 [Journal] - Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint
**A counterexample to a dynamic algorithm for convex hulls of line arrangements.**[Citation Graph (0, 0)][DBLP] Pattern Recognition Letters, 1991, v:12, n:3, pp:145-147 [Journal] - Binay K. Bhattacharya, Pavol Hell, Jing Huang
**A Linear Algorithm for Maximum Weight Cliques in ProperCircular Arc Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1996, v:9, n:2, pp:274-289 [Journal] - David Avis, Binay K. Bhattacharya, Hiroshi Imai
**Computing the volume of the union of spheres.**[Citation Graph (0, 0)][DBLP] The Visual Computer, 1988, v:3, n:6, pp:323-328 [Journal] - Binay K. Bhattacharya, Godfried T. Toussaint
**Fast algorithms for computing the diameter of a finite planar set.**[Citation Graph (0, 0)][DBLP] The Visual Computer, 1988, v:3, n:6, pp:379-388 [Journal] - Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda
**An Optimal Solution to Room Search Problem.**[Citation Graph (0, 0)][DBLP] CCCG, 2006, pp:- [Conf] - Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi
**Computing a planar widest empty alpha-siphon in o(n**[Citation Graph (0, 0)][DBLP]^{3}) time. CCCG, 2007, pp:33-36 [Conf] - Binay K. Bhattacharya, Jeff Sember
**Efficient Snap Rounding with Integer Arithmetic.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:145-148 [Conf] - Binay K. Bhattacharya, Yuzhuang Hu, Alexander Kononov
**Approximation Algorithms for the Black and White Traveling Salesman Problem.**[Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:559-567 [Conf] - Binay K. Bhattacharya, Qiaosheng Shi
**Optimal Algorithms for the Weighted**[Citation Graph (0, 0)][DBLP]*p*-Center Problems on the Real Line for Small*p*. WADS, 2007, pp:529-540 [Conf] - Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
**Efficient algorithms for center problems in cactus networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:378, n:3, pp:237-252 [Journal] **New Upper Bounds on Continuous Tree Edge-Partition Problem.**[Citation Graph (, )][DBLP]**Application of computational geometry to network p-center location problems.**[Citation Graph (, )][DBLP]**Approximation Algorithms for a Network Design Problem.**[Citation Graph (, )][DBLP]**Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing.**[Citation Graph (, )][DBLP]**Sensor network connectivity with multiple directional antennae of a given angular sum.**[Citation Graph (, )][DBLP]**Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times.**[Citation Graph (, )][DBLP]**Computation of Non-dominated Points Using Compact Voronoi Diagrams.**[Citation Graph (, )][DBLP]**Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region.**[Citation Graph (, )][DBLP]**Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees.**[Citation Graph (, )][DBLP]**Single facility collection depots location problem in the plane.**[Citation Graph (, )][DBLP]**Optimal algorithms for some intersection radius problems.**[Citation Graph (, )][DBLP]**On Finding Non-dominated Points using Compact Voronoi Diagrams**[Citation Graph (, )][DBLP]
Search in 0.513secs, Finished in 0.518secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |