( en | de | ru )

 

Disambiguation of "Bhattacharya, Binay K."

Author of the publication

copydeleteadd this publication to your clipboard
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network.

, and . COCOA, volume 8881 of Lecture Notes in Computer Science, page 146-160. Springer, (2014)

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

Chhaya Bhattacharya

Subhamoy Bhattacharya

Nupur Bhattacharya

Indrajit Bhattacharya

 

Other publications of authors with the same name

Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2., , and . CCCG, Carleton University, Ottawa, Canada, (2014)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)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)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)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)Usefulness of Angle-Sweep over Line-Sweep.. FSTTCS, volume 560 of Lecture Notes in Computer Science, page 390-419. Springer, (1991)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)