A Counterexample to a Diameter Algorithm for Convex Polygons. - Binay K. Bhattacharya; Godfried T. Toussaint (IEEE Trans. Pattern Anal. Mach. Intell., 1982)

Time- and storage-efficient implementation of an optimal planar convex hull algorithm. - Binay K. Bhattacharya; Godfried T. Toussaint (Image Vis. Comput., 1983)

Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. - Binay K. Bhattacharya; Godfried T. Toussaint (J. Algorithms, 1983)

Optimal algorithms for computing the minimum distance between two finite planar sets. - Godfried T. Toussaint; Binay K. Bhattacharya (Pattern Recognit. Lett., 1983)

Clustering Algorithms Based on Minimum and Maximum Spanning Trees. - Tetsuo Asano; Binay K. Bhattacharya; J. Mark Keil; F. Frances Yao (SCG, 1988)

Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot. - Binay K. Bhattacharya; J. Zorbas (J. Algorithms, 1988)

Computing the volume of the union of spheres. - David Avis; Binay K. Bhattacharya; Hiroshi Imai (Vis. Comput., 1988)

Fast algorithms for computing the diameter of a finite planar set. - Binay K. Bhattacharya; Godfried T. Toussaint (Vis. Comput., 1988)

Determining Sector Visibility of a Polygon. - Binay K. Bhattacharya; David G. Kirkpatrick; Godfried T. Toussaint (SCG, 1989)

Computing Shortest Transversals of Sets (Extended Abstract). - Binay K. Bhattacharya; Jurek Czyzowicz; Peter Egyed; Ivan Stojmenovic; Godfried T. Toussaint; Jorge Urrutia (SCG, 1991)

Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). - Binay K. Bhattacharya; Shreesh Jadhav; Asish Mukhopadhyay; Jean-Marc Robert 001 (SCG, 1991)

Usefulness of Angle-Sweep over Line-Sweep. - Binay K. Bhattacharya (FSTTCS, 1991)

A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. - Binay K. Bhattacharya; Asish Mukhopadhyay; Godfried T. Toussaint (WADS, 1991)

Computing shortest transversals. - Binay Bhattacharya; Godfried Toussaint (Computing, 1991)

An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window. - Binay K. Bhattacharya (CVGIP Graph. Model. Image Process., 1991)

A counterexample to a dynamic algorithm for convex hulls of line arrangements. - Binay K. Bhattacharya; Hazel Everett; Godfried T. Toussaint (Pattern Recognit. Lett., 1991)

Computing shortest transversals of sets. - Binay K. Bhattacharya; Jurek Czyzowicz; Peter Egyed; Godfried T. Toussaint; Ivan Stojmenovic; Jorge Urrutia (Int. J. Comput. Geom. Appl., 1992)

Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. - Asish Mukhopadhyay; Chanchal Kumar; Binay K. Bhattacharya (CCCG, 1993)

Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. - Pinaki Mitra; Binay K. Bhattacharya (WADS, 1993)

Optimal algorithms for some intersection radius problems. - Binay K. Bhattacharya; Shreesh Jadhav; Asish Mukhopadhyay; J.-M. Robert (Computing, 1994)

Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. - Binay K. Bhattacharya; Asish Mukhopadhyay (ISAAC, 1995)

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. - Shreesh Jadhav; Asish Mukhopadhyay; Binay K. Bhattacharya (J. Algorithms, 1996)

A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. - Binay K. Bhattacharya; Pavol Hell; Jing Huang 007 (SIAM J. Discret. Math., 1996)

Biased search and k-point clustering. - Binay K. Bhattacharya (CCCG, 1997)

An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. - Binay K. Bhattacharya; Damon Kaller (J. Algorithms, 1997)

On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. - Binay K. Bhattacharya; Sandeep Sen (J. Algorithms, 1997)

Computing Maximum Cliques of Circular Arcs in Parallel. - Selim G. Akl; Binay K. Bhattacharya (Parallel Algorithms Appl., 1997)

Reference set thinning for the k-nearest neighbor decision rule. - Binay K. Bhattacharya; Damon Kaller (ICPR, 1998)

Output-Sensitive Algorithms for Uniform Partitions of Points. - Pankaj K. Agarwal; Binay K. Bhattacharya; Sandeep Sen (ISAAC, 1999)

Generalized Maximum Independent Sets for Trees in Subquadratic Time. - Binay K. Bhattacharya; Michael E. Houle (ISAAC, 1999)

Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. - Binay K. Bhattacharya; Asish Mukhopadhyay; Godfried T. Toussaint (Int. J. Comput. Geom. Appl., 1999)

Mobile facility location. - Sergei Bespamyatnikh; Binay K. Bhattacharya; David G. Kirkpatrick; Michael Segal 001 (DIAL-M, 2000)

EODM - A Novel Representation for Collision Detection. - Maria del C. Amézquita Benítez; Kamal K. Gupta; Binay K. Bhattacharya (ICRA, 2000)

Optimal Algorithms for Two-Guard Walkability of Simple Polygons. - Binay K. Bhattacharya; Asish Mukhopadhyay; Giri Narasimhan (WADS, 2001)

Characterizing LR-visibility polygons and related problems. - Binay K. Bhattacharya; Subir Kumar Ghosh (Comput. Geom., 2001)

On computing the optimal bridge between two convex polygons. - Binay K. Bhattacharya; Robert Benkoczi (Inf. Process. Lett., 2001)

Lower and Upper Bounds for Tracking Mobile Users. - Sergei Bespamyatnikh; Binay K. Bhattacharya; David G. Kirkpatrick; Michael Segal 001 (IFIP TCS, 2002)

On the Minimum Perimeter Triangle Enclosing a Convex Polygon. - Binay K. Bhattacharya; Asish Mukhopadhyay (JCDCG, 2002)

Improved Algorithms for Uniform Partitions of Points. - Pankaj K. Agarwal; Binay K. Bhattacharya; Sandeep Sen (Algorithmica, 2002)

Optimally computing a shortest weakly visible line segment inside a simple polygon. - Binay K. Bhattacharya; Gautam Das 001; Asish Mukhopadhyay; Giri Narasimhan (Comput. Geom., 2002)

Efficient algorithms for centers and medians in interval and circular-arc graphs. - Sergei Bespamyatnikh; Binay K. Bhattacharya; J. Mark Keil; David G. Kirkpatrick; Michael Segal 001 (Networks, 2002)

Faster Algorithms for k-Medians in Trees. - Robert Benkoczi; Binay K. Bhattacharya; Marek Chrobak; Lawrence L. Larmore; Wojciech Rytter (MFCS, 2003)

Efficient computation of 2-medians in a tree network with positive/negative weights. - Robert Benkoczi; Binay K. Bhattacharya; David Breton (Electron. Notes Discret. Math., 2003)

Computing the Widest Empty Boomerang. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi (CCCG, 2005)

Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi (CCCG, 2005)

Collection depot location problem in the plane. - Robert Benkoczi; Binay K. Bhattacharya; Sandip Das 001; Jeff Sember (CCCG, 2005)

A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time. - Robert Benkoczi; Binay K. Bhattacharya (ESA, 2005)

Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi (ISAAC, 2005)

Geometric Decision Rules for Instance-Based Learning Problems. - Binay K. Bhattacharya; Kaustav Mukherjee; Godfried T. Toussaint (PReMI, 2005)

An Optimal Solution to Room Search Problem. - Binay K. Bhattacharya; John Z. Zhang; Qiaosheng Shi; Tsunehiko Kameda (CCCG, 2006)

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. - Binay K. Bhattacharya; Yuzhuang Hu; Qiaosheng Shi; Arie Tamir (ISAAC, 2006)

An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi (LATIN, 2006)

A linear time algorithm to remove winding of a simple polygon. - Binay K. Bhattacharya; Subir Kumar Ghosh; Thomas C. Shermer (Comput. Geom., 2006)

Competitive Algorithms for Maintaining a Mobile Center. - Sergey Bereg; Binay K. Bhattacharya; David G. Kirkpatrick; Michael Segal 001 (Mob. Networks Appl., 2006)

Computing a planar widest empty alpha-siphon in o(n3) time. - Boaz Ben-Moshe; Binay K. Bhattacharya; Sandip Das 001; Daya Ram Gaur; Qiaosheng Shi (CCCG, 2007)

Efficient Snap Rounding with Integer Arithmetic. - Binay K. Bhattacharya; Jeff Sember (CCCG, 2007)

Approximation Algorithms for the Black and White Traveling Salesman Problem. - Binay K. Bhattacharya; Yuzhuang Hu; Alexander V. Kononov (COCOON, 2007)

Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p. - Binay K. Bhattacharya; Qiaosheng Shi (WADS, 2007)

Computing the maximum clique in the visibility graph of a simple polygon. - Subir Kumar Ghosh; Thomas C. Shermer; Binay K. Bhattacharya; Partha P. Goswami (J. Discrete Algorithms, 2007)

Efficient algorithms for center problems in cactus networks. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi; Arie Tamir (Theor. Comput. Sci., 2007)

New Upper Bounds on Continuous Tree Edge-Partition Problem. - Robert Benkoczi; Binay K. Bhattacharya; Qiaosheng Shi (AAIM, 2008)

Application of computational geometry to network p-center location problems. - Qiaosheng Shi; Binay K. Bhattacharya (CCCG, 2008)

Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. - Binay K. Bhattacharya; Paz Carmi; Yuzhuang Hu; Qiaosheng Shi (ISAAC, 2008)

On intersecting a set of parallel line segments with a convex polygon of minimum area. - Asish Mukhopadhyay; Chanchal Kumar; Eugene Greene; Binay K. Bhattacharya (Inf. Process. Lett., 2008)

Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications. - Rong Ge 002; Martin Ester; Byron J. Gao; Zengjian Hu; Binay K. Bhattacharya; Boaz Ben-Moshe (ACM Trans. Knowl. Discov. Data, 2008)

Approximation Algorithms for a Network Design Problem. - Binay K. Bhattacharya; Yuzhuang Hu; Qiaosheng Shi (COCOON, 2009)

Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. - Binay K. Bhattacharya; Tsunehiko Kameda; John Z. Zhang (ICRA, 2009)

Sensor network connectivity with multiple directional antennae of a given angular sum. - Binay K. Bhattacharya; Yuzhuang Hu; Qiaosheng Shi; Evangelos Kranakis; Danny Krizanc (IPDPS, 2009)

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. - Binay K. Bhattacharya; Qiaosheng Shi; Arie Tamir (Algorithmica, 2009)

Single facility collection depots location problem in the plane. - Robert Benkoczi; Binay K. Bhattacharya; Sandip Das 001; Jeff Sember (Comput. Geom., 2009)

On Finding Non-dominated Points using Compact Voronoi Diagrams - Binay K. Bhattacharya; Arijit Bishnu; Otfried Cheong; Sandip Das 001; Arindam Karmakar; Jack Snoeyink (CoRR, 2009)

Collection depots facility location problems in trees. - Robert Benkoczi; Binay K. Bhattacharya; Arie Tamir (Networks, 2009)

Optimal movement of mobile sensors for barrier coverage of a planar region. - Binay K. Bhattacharya; Mike Burmester; Yuzhuang Hu; Evangelos Kranakis; Qiaosheng Shi; Andreas Wiese (Theor. Comput. Sci., 2009)

Approximation Algorithms for the Multi-Vehicle Scheduling Problem. - Binay K. Bhattacharya; Yuzhuang Hu (ISAAC (2), 2010)

Computation of Non-dominated Points Using Compact Voronoi Diagrams. - Binay K. Bhattacharya; Arijit Bishnu; Otfried Cheong; Sandip Das 001; Arindam Karmakar; Jack Snoeyink (WALCOM, 2010)

Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. - Ei Ando; Binay K. Bhattacharya; Yuzhuang Hu; Tsunehiko Kameda; Qiaosheng Shi (ICTAC, 2011)

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. - Binay K. Bhattacharya; Tsunehiko Kameda (COCOON, 2012)

k-delivery traveling salesman problem on tree networks. - Binay K. Bhattacharya; Yuzhuang Hu (FSTTCS, 2012)

Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. - Binay K. Bhattacharya; Tsunehiko Kameda; Zhao Song 002 (ISAAC, 2012)

Efficient algorithms for the conditional covering problem. - Robert Benkoczi; Binay K. Bhattacharya; Yuzhuang Hu; Chien-Hsin Lin; Qiaosheng Shi; Biing-Feng Wang (Inf. Comput., 2012)

Some variations on constrained minimum enclosing circle problem. - Arindam Karmakar; Sandip Das 001; Subhas C. Nandy; Binay K. Bhattacharya (J. Comb. Optim., 2013)

Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (CCCG, 2014)

Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. - Binay K. Bhattacharya; Subhas C. Nandy; Sasanka Roy (CCCG, 2014)

Optimizing Squares Covering a Set of Points. - Binay K. Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Priya Ranjan Sinha Mahapatra; Zhao Song 002 (COCOA, 2014)

Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. - Binay K. Bhattacharya; Tsunehiko Kameda (COCOA, 2014)

Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. - Binay K. Bhattacharya; Minati De; Tsunehiko Kameda; Sasanka Roy; Vladyslav Sokol; Zhao Song 002 (COCOON, 2014)

Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. - Binay K. Bhattacharya; Tsunehiko Kameda; Zhao Song 002 (LATIN, 2014)

A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. - Binay K. Bhattacharya; Tsunehiko Kameda; Zhao Song 002 (Algorithmica, 2014)

Improved algorithms to network p-center location problems. - Binay K. Bhattacharya; Qiaosheng Shi (Comput. Geom., 2014)

Facility location problems in the constant work-space read-only memory model. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (CoRR, 2014)

The cyclical scheduling problem. - Binay Bhattacharya; Soudipta Chakraborty; Ehsan Iranmanesh; Ramesh Krishnamurti (Theor. Comput. Sci., 2014)

Approximation Algorithms for Generalized MST and TSP in Grid Clusters. - Binay K. Bhattacharya; Ante Custic; Akbar Rafiey; Arash Rafiey; Vladyslav Sokol (COCOA, 2015)

Geometric p-Center Problems with Centers Constrained to Two Lines. - Binay Bhattacharya; Ante Custic; Sandip Das 001; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (JCDCGG, 2015)

Geometric k-Center Problems with Centers Constrained to Two Lines. - Binay K. Bhattacharya; Ante Custic; Sandip Das 001; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (CoRR, 2015)

Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. - Binay Bhattacharya; Tsunehiko Kameda; Zhao Song 002 (Discret. Appl. Math., 2015)

Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. - Binay K. Bhattacharya; Tsunehiko Kameda (Theor. Comput. Sci., 2015)

The p-Center Problem in Tree Networks Revisited. - Aritra Banik; Binay K. Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Zhao Song 002 (SWAT, 2016)

Improved Algorithms for Computing k-Sink on Dynamic Path Networks. - Binay K. Bhattacharya; Mordecai J. Golin; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (CoRR, 2016)

Space-efficient algorithm for computing a centerpoint of a set of points in R2. - Binay K. Bhattacharya; Subhas C. Nandy; Sasanka Roy (Theor. Comput. Sci., 2016)

Minimum Enclosing Circle Problem with Base Point. - Binay Bhattacharya; Lily Li (CCCG, 2017)

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. - Binay Bhattacharya; Mordecai J. Golin; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (WADS, 2017)

Rectilinear path problems in restricted memory setup. - Binay K. Bhattacharya; Minati De; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2017)

On representing a simple polygon perceivable to a blind person. - Sandip Banerjee; Bhargab B. Bhattacharya; Binay Bhattacharya; Arindam Biswas 002; Sandip Das 001; Ritankar Mandal; Sasanka Roy (Inf. Process. Lett., 2017)

The bilinear assignment problem: complexity and polynomially solvable special cases. - Ante Custic; Vladyslav Sokol; Abraham P. Punnen; Binay Bhattacharya (Math. Program., 2017)

An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. - Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (ISAAC, 2018)

Minsum k-Sink Problem on Dynamic Flow Path Networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (IWOCA, 2018)

Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. - Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (CoRR, 2018)

Minsum k-Sink Problem on Path Networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (CoRR, 2018)

Optimizing squares covering a set of points. - Sergey Bereg; Binay Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Priya Ranjan Sinha Mahapatra; Zhao Song 002 (Theor. Comput. Sci., 2018)

The Weighted k-Center Problem in Trees for Fixed k. - Binay Bhattacharya; Sandip Das 001; Subhadeep Ranjan Dev (ISAAC, 2019)

Minmax-Regret Evacuation Planning for Cycle Networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (TAMC, 2019)

Linear-time fitting of a k-step function. - Binay Bhattacharya; Sandip Das 001; Tsunehiko Kameda (Discret. Appl. Math., 2020)

Constant work-space algorithms for facility location problems. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2020)

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. - Vladyslav Sokol; Ante Custic; Abraham P. Punnen; Binay Bhattacharya (INFORMS J. Comput., 2020)

Minsum k-sink problem on path networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (Theor. Comput. Sci., 2020)

Locating Evacuation Centers Optimally in Path and Cycle Networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh; Junichi Teruyama (ATMOS, 2021)

Computation of spatial skyline points. - Binay Bhattacharya; Arijit Bishnu; Otfried Cheong; Sandip Das 001; Arindam Karmakar; Jack Snoeyink (Comput. Geom., 2021)

A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic. - Binay Bhattacharya; Tsunehiko Kameda; Amirhossein Mozafari (CCCG, 2022)

An Efficient Algorithm for the Proximity Connected Two Center Problem. - Binay Bhattacharya; Amirhossein Mozafari; Thomas C. Shermer (IWOCA, 2022)

A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. - Binay Bhattacharya; Sandip Das 001; Subhadeep Ranjan Dev (JCDCGGG, 2022)

The weighted k-center problem in trees for fixed k. - Binay Bhattacharya; Sandip Das 001; Subhadeep Ranjan Dev (Theor. Comput. Sci., 2022)

A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. - Binay Bhattacharya; Amirhossein Mozafari; Thomas C. Shermer (COCOON (2), 2023)

Improved algorithms for optimal k sink location on path networks. - Binay Bhattacharya; Mordecai J. Golin; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (Theor. Comput. Sci., 2025)