( en | de | ru )

 

Disambiguation of "Bhattacharya, Binay K."

Author of the publication

copydeleteadd this publication to your clipboard
Clustering Algorithms Based on Minimum and Maximum Spanning Trees.

, , , and . SCG, page 252-257. ACM, (1988)

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

Subhamoy Bhattacharya

Chhaya Bhattacharya

Nupur Bhattacharya

Indrajit Bhattacharya

 

Other publications of authors with the same name

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)Usefulness of Angle-Sweep over Line-Sweep.. FSTTCS, volume 560 of Lecture Notes in Computer Science, page 390-419. Springer, (1991)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)Characterizing LR-visibility polygons and related problems., and . Comput. Geom., 18 (1): 19-36 (2001)Efficient computation of 2-medians in a tree network with positive/negative weights., , and . Electron. Notes Discret. Math., (2003)Rectilinear path problems in restricted memory setup., , , , and . Discret. Appl. Math., (2017)Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2., , and . CCCG, Carleton University, Ottawa, Canada, (2014)Approximation Algorithms for the Black and White Traveling Salesman Problem., , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 559-567. Springer, (2007)On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm., and . J. Algorithms, 25 (1): 177-193 (1997)