( 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

Subhamoy Bhattacharya

Nupur Bhattacharya

Chhaya Bhattacharya

Indrajit Bhattacharya

 

Other publications of authors with the same name

On computing the optimal bridge between two convex polygons., and . Inf. Process. Lett., 79 (5): 215-221 (2001)On intersecting a set of parallel line segments with a convex polygon of minimum area., , , and . Inf. Process. Lett., 105 (2): 58-64 (2008)An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs., and . J. Algorithms, 25 (2): 336-358 (1997)Some variations on constrained minimum enclosing circle problem., , , and . J. Comb. Optim., 25 (2): 176-190 (2013)A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network., , and . Algorithmica, 70 (1): 2-21 (2014)Approximation Algorithms for a Network Design Problem., , and . COCOON, volume 5609 of Lecture Notes in Computer Science, page 225-237. Springer, (2009)Rectilinear Path Problems in Restricted Memory Setup., , , , and . CALDAM, volume 8959 of Lecture Notes in Computer Science, page 69-80. Springer, (2015)Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 693-703. Springer, (2005)Some Variations on Constrained Minimum Enclosing Circle Problem., , , and . COCOA (1), volume 6508 of Lecture Notes in Computer Science, page 354-368. Springer, (2010)Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments., , and . CCCG, page 169-174. University of Waterloo, (1993)