| 2015 | COCOA | Approximation Algorithms for Generalized MST and TSP in Grid Clusters. | Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol |
| 2014 | COCOA | Optimizing Squares Covering a Set of Points. | Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song |
| 2014 | COCOA | Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. | Binay K. Bhattacharya, Tsunehiko Kameda |
| 2014 | COCOON | Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. | Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song |
| 2014 | LATIN | Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. | Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song |
| 2012 | COCOON | A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. | Binay K. Bhattacharya, Tsunehiko Kameda |
| 2012 | ISAAC | Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. | Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song |
| 2011 | ICTAC | Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. | Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi |
| 2010 | COCOA | Some Variations on Constrained Minimum Enclosing Circle Problem. | Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya |
| 2010 | ISAAC | Approximation Algorithms for the Multi-Vehicle Scheduling Problem. | Binay K. Bhattacharya, Yuzhuang Hu |
| 2010 | WALCOM | Computation of Non-dominated Points Using Compact Voronoi Diagrams. | Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink |
| 2009 | COCOON | Approximation Algorithms for a Network Design Problem. | Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi |
| 2009 | ICRA | Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. | Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang |
| 2008 | AAIM | New Upper Bounds on Continuous Tree Edge-Partition Problem. | Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi |
| 2008 | COCOA | 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 |
| 2008 | ISAAC | Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. | Binay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi |
| 2007 | COCOON | Approximation Algorithms for the Black and White Traveling Salesman Problem. | Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov |
| 2007 | WADS | Optimal Algorithms for the Weighted | Binay K. Bhattacharya, Qiaosheng Shi |
| 2006 | ISAAC | Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. | Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir |
| 2006 | LATIN | An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. | Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi |
| 2005 | ESA | A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time. | Robert Benkoczi, Binay K. Bhattacharya |
| 2005 | ISAAC | Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. | Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi |
| 2003 | MFCS | Faster Algorithms for | Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter |
| 2001 | WADS | Optimal Algorithms for Two-Guard Walkability of Simple Polygons. | Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan |
| 2000 | ESA | 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 |
| 2000 | ICRA | EODM - A Novel Representation for Collision Detection. | Maria del C. Amzquita Bentez, Kamal K. Gupta, Binay K. Bhattacharya |
| 1999 | ISAAC | Output-Sensitive Algorithms for Uniform Partitions of Points. | Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen |
| 1999 | ISAAC | Generalized Maximum Independent Sets for Trees in Subquadratic Time. | Binay K. Bhattacharya, Michael E. Houle |
| 1998 | ICPR | Reference set thinning for the k-nearest neighbor decision rule. | Binay K. Bhattacharya, Damon Kaller |
| 1995 | ISAAC | Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. | Binay K. Bhattacharya, Asish Mukhopadhyay |
| 1993 | WADS | Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. | Pinaki Mitra, Binay K. Bhattacharya |
| 1991 | ICALP | Computing Shortest Transversals. | Binay K. Bhattacharya, Godfried T. Toussaint |
| 1991 | WADS | 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 |