( en | de | ru )

 

Disambiguation of "Bhattacharya, Binay K."

Author of the publication

copydeleteadd this publication to your clipboard
Computing a planar widest empty alpha-siphon in o(n3) time.

, , , , and . CCCG, page 33-36. Carleton University, Ottawa, Canada, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sara Binay

Nupur Bhattacharya

Subhamoy Bhattacharya

Chhaya Bhattacharya

Indrajit Bhattacharya

 

Other publications of authors with the same name

Characterizing LR-visibility polygons and related problems., and . Comput. Geom., 18 (1): 19-36 (2001)Biased search and k-point clustering.. CCCG, (1997)Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles., , and . CCCG, page 243-246. (2005)Computing the Widest Empty Boomerang., , and . CCCG, page 80-83. (2005)Approximation Algorithms for Generalized MST and TSP in Grid Clusters., , , , and . COCOA, volume 9486 of Lecture Notes in Computer Science, page 110-125. Springer, (2015)Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times., , , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 800-811. Springer, (2008)Computing Shortest Transversals of Sets (Extended Abstract)., , , , , and . SCG, page 71-80. ACM, (1991)On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm., and . J. Algorithms, 25 (1): 177-193 (1997)Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible., and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 22-31. Springer, (1995)A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree., and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 1-12. Springer, (2012)