default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBinay K. Bhattacharya
Binay Bhattacharya
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j54]Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved algorithms for optimal k sink location on path networks. Theor. Comput. Sci. 1039: 115190 (2025)- 2023
- [c72]Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer:
A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. COCOON (2) 2023: 69-81 - [i12]Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. CoRR abs/2303.17204 (2023) - 2022
- [j53]Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
The weighted k-center problem in trees for fixed k. Theor. Comput. Sci. 906: 64-75 (2022) - [c71]Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari:
A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic. CCCG 2022: 40-47 - [c70]Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer:
An Efficient Algorithm for the Proximity Connected Two Center Problem. IWOCA 2022: 199-213 - [i11]Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer:
An Efficient Algorithm for the Proximity Connected Two Center Problem. CoRR abs/2204.08754 (2022) - 2021
- [j52]Binay Bhattacharya, Arijit Bishnu, Otfried Cheong
, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of spatial skyline points. Comput. Geom. 93: 101698 (2021) - [c69]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama:
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS 2021: 13:1-13:19 - 2020
- [j51]Binay Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-time fitting of a k-step function. Discret. Appl. Math. 280: 43-52 (2020) - [j50]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Constant work-space algorithms for facility location problems. Discret. Appl. Math. 283: 456-472 (2020) - [j49]Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya:
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. INFORMS J. Comput. 32(3): 730-746 (2020) - [j48]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-sink problem on path networks. Theor. Comput. Sci. 806: 388-401 (2020)
2010 – 2019
- 2019
- [c68]Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
The Weighted k-Center Problem in Trees for Fixed k. ISAAC 2019: 27:1-27:11 - [c67]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax-Regret Evacuation Planning for Cycle Networks. TAMC 2019: 42-58 - 2018
- [j47]Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song:
Optimizing squares covering a set of points. Theor. Comput. Sci. 729: 68-83 (2018) - [c66]Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. ISAAC 2018: 14:1-14:13 - [c65]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA 2018: 78-89 - [i10]Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. CoRR abs/1806.00814 (2018) - [i9]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Path Networks. CoRR abs/1810.10631 (2018) - 2017
- [j46]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228: 80-87 (2017) - [j45]Sandip Banerjee, Bhargab B. Bhattacharya, Binay Bhattacharya, Arindam Biswas, Sandip Das, Ritankar Mandal, Sasanka Roy:
On representing a simple polygon perceivable to a blind person. Inf. Process. Lett. 120: 1-5 (2017) - [j44]Ante Custic, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya:
The bilinear assignment problem: complexity and polynomially solvable special cases. Math. Program. 166(1-2): 185-205 (2017) - [c64]Binay Bhattacharya, Lily Li:
Minimum Enclosing Circle Problem with Base Point. CCCG 2017: 50-55 - [c63]Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS 2017: 133-144 - [i8]Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya:
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. CoRR abs/1707.07057 (2017) - 2016
- [j43]Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-efficient algorithm for computing a centerpoint of a set of points in R2. Theor. Comput. Sci. 615: 61-70 (2016) - [c62]Binay Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-Time Fitting of a k-Step Function. CALDAM 2016: 85-96 - [c61]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The p-Center Problem in Tree Networks Revisited. SWAT 2016: 6:1-6:15 - [i7]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The $p$-Center Problem in Tree Networks Revisited. CoRR abs/1604.07535 (2016) - [i6]Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR abs/1609.01373 (2016) - 2015
- [j42]Binay Bhattacharya, Tsunehiko Kameda, Zhao Song:
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Discret. Appl. Math. 195: 18-30 (2015) - [j41]Binay K. Bhattacharya, Tsunehiko Kameda:
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. Theor. Comput. Sci. 607: 411-425 (2015) - [c60]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80 - [c59]Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol:
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. COCOA 2015: 110-125 - [c58]Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG 2015: 24-36 - [i5]Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol:
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. CoRR abs/1507.04438 (2015) - [i4]Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR abs/1512.07533 (2015) - [i3]Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-Time Fitting of a $k$-Step Function. CoRR abs/1512.07537 (2015) - 2014
- [j40]Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. Algorithmica 70(1): 2-21 (2014) - [j39]Binay K. Bhattacharya, Qiaosheng Shi:
Improved algorithms to network p-center location problems. Comput. Geom. 47(2): 307-315 (2014) - [j38]Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti:
The cyclical scheduling problem. Theor. Comput. Sci. 555: 9-22 (2014) - [c57]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG 2014 - [c56]Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. CCCG 2014 - [c55]Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song:
Optimizing Squares Covering a Set of Points. COCOA 2014: 37-52 - [c54]Binay K. Bhattacharya, Tsunehiko Kameda:
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. COCOA 2014: 146-160 - [c53]Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song:
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON 2014: 417-428 - [c52]Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. LATIN 2014: 330-341 - [i2]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Facility location problems in the constant work-space read-only memory model. CoRR abs/1409.4092 (2014) - 2013
- [j37]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2): 176-190 (2013) - [c51]Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti:
The Cyclical Scheduling Problem. WALCOM 2013: 217-232 - 2012
- [j36]Robert Benkoczi, Binay K. Bhattacharya, Yuzhuang Hu, Chien-Hsin Lin, Qiaosheng Shi, Biing-Feng Wang:
Efficient algorithms for the conditional covering problem. Inf. Comput. 219: 39-57 (2012) - [c50]Binay K. Bhattacharya, Tsunehiko Kameda:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. COCOON 2012: 1-12 - [c49]Binay K. Bhattacharya, Yuzhuang Hu:
k-delivery traveling salesman problem on tree networks. FSTTCS 2012: 325-336 - [c48]Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. ISAAC 2012: 588-597 - 2011
- [c47]Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi:
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. ICTAC 2011: 45-61 - 2010
- [c46]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368 - [c45]Binay K. Bhattacharya, Yuzhuang Hu:
Approximation Algorithms for the Multi-Vehicle Scheduling Problem. ISAAC (2) 2010: 192-205 - [c44]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM 2010: 82-93
2000 – 2009
- 2009
- [j35]Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir:
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. Algorithmica 55(4): 601-618 (2009) - [j34]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Single facility collection depots location problem in the plane. Comput. Geom. 42(5): 403-418 (2009) - [j33]Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir:
Collection depots facility location problems in trees. Networks 53(1): 50-62 (2009) - [j32]Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese:
Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci. 410(52): 5515-5528 (2009) - [c43]Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi:
Approximation Algorithms for a Network Design Problem. COCOON 2009: 225-237 - [c42]Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang:
Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. ICRA 2009: 2461-2466 - [c41]Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Evangelos Kranakis, Danny Krizanc:
Sensor network connectivity with multiple directional antennae of a given angular sum. IPDPS 2009: 1-11 - [i1]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
On Finding Non-dominated Points using Compact Voronoi Diagrams. CoRR abs/0909.0814 (2009) - 2008
- [j31]Asish Mukhopadhyay, Chanchal Kumar, Eugene Greene, Binay K. Bhattacharya:
On intersecting a set of parallel line segments with a convex polygon of minimum area. Inf. Process. Lett. 105(2): 58-64 (2008) - [j30]Rong Ge, Martin Ester, Byron J. Gao, Zengjian Hu, Binay K. Bhattacharya, Boaz Ben-Moshe:
Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications. ACM Trans. Knowl. Discov. Data 2(2): 7:1-7:35 (2008) - [c40]Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi:
New Upper Bounds on Continuous Tree Edge-Partition Problem. AAIM 2008: 38-49 - [c39]Qiaosheng Shi, Binay K. Bhattacharya:
Application of computational geometry to network p-center location problems. CCCG 2008 - [c38]Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese:
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region. COCOA 2008: 103-115 - [c37]Binay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi:
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. ISAAC 2008: 800-811 - 2007
- [j29]Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami:
Computing the maximum clique in the visibility graph of a simple polygon. J. Discrete Algorithms 5(3): 524-532 (2007) - [j28]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir:
Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378(3): 237-252 (2007) - [c36]Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi:
Computing a planar widest empty alpha-siphon in o(n3) time. CCCG 2007: 33-36 - [c35]Binay K. Bhattacharya, Jeff Sember:
Efficient Snap Rounding with Integer Arithmetic. CCCG 2007: 145-148 - [c34]Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov:
Approximation Algorithms for the Black and White Traveling Salesman Problem. COCOON 2007: 559-567 - [c33]Binay K. Bhattacharya, Qiaosheng Shi:
Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p. WADS 2007: 529-540 - 2006
- [j27]Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer:
A linear time algorithm to remove winding of a simple polygon. Comput. Geom. 33(3): 165-173 (2006) - [j26]Robert Benkoczi, Binay K. Bhattacharya, David Breton:
Efficient computation of 2-medians in a tree network with positive/negative weights. Discret. Math. 306(14): 1505-1516 (2006) - [j25]Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Competitive Algorithms for Maintaining a Mobile Center. Mob. Networks Appl. 11(2): 177-186 (2006) - [c32]Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda:
An Optimal Solution to Room Search Problem. CCCG 2006 - [c31]Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir:
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. ISAAC 2006: 379-388 - [c30]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. LATIN 2006: 166-177 - 2005
- [c29]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Collection depot location problem in the plane. CCCG 2005: 76-79 - [c28]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Computing the Widest Empty Boomerang. CCCG 2005: 80-83 - [c27]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. CCCG 2005: 243-246 - [c26]Robert Benkoczi, Binay K. Bhattacharya:
A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time. ESA 2005: 271-282 - [c25]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. ISAAC 2005: 693-703 - [c24]Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint:
Geometric Decision Rules for Instance-Based Learning Problems. PReMI 2005: 60-69 - 2003
- [j24]Robert Benkoczi, Binay K. Bhattacharya, David Breton:
Efficient computation of 2-medians in a tree network with positive/negative weights. Electron. Notes Discret. Math. 15: 39-42 (2003) - [c23]Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter:
Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227 - 2002
- [j23]Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen:
Improved Algorithms for Uniform Partitions of Points. Algorithmica 32(4): 521-539 (2002) - [j22]Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan:
Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. 23(1): 1-29 (2002) - [j21]Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal:
Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002) - [c22]Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58 - [c21]Binay K. Bhattacharya, Asish Mukhopadhyay:
On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG 2002: 84-96 - 2001
- [j20]Binay K. Bhattacharya, Subir Kumar Ghosh:
Characterizing LR-visibility polygons and related problems. Comput. Geom. 18(1): 19-36 (2001) - [j19]Binay K. Bhattacharya, Robert Benkoczi:
On computing the optimal bridge between two convex polygons. Inf. Process. Lett. 79(5): 215-221 (2001) - [c20]Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan:
Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS 2001: 438-449 - 2000
- [c19]Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Mobile facility location. DIAL-M 2000: 46-53 - [c18]Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal:
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA 2000: 100-111 - [c17]Maria del C. Amézquita Benítez, Kamal K. Gupta, Binay K. Bhattacharya:
EODM - A Novel Representation for Collision Detection. ICRA 2000: 3727-3732
1990 – 1999
- 1999
- [j18]Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint:
Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. Int. J. Comput. Geom. Appl. 9(1): 81-96 (1999) - [c16]Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen:
Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC 1999: 403-414 - [c15]Binay K. Bhattacharya, Michael E. Houle:
Generalized Maximum Independent Sets for Trees in Subquadratic Time. ISAAC 1999: 435-445 - 1998
- [c14]Binay K. Bhattacharya, Subir Kumar Ghosh:
Characterizing lr-visibility polygons and related problems. CCCG 1998 - [c13]Binay K. Bhattacharya, Damon Kaller:
Reference set thinning for the k-nearest neighbor decision rule. ICPR 1998: 238-242 - 1997
- [j17]Binay K. Bhattacharya, Sandeep Sen:
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms 25(1): 177-193 (1997) - [j16]Binay K. Bhattacharya, Damon Kaller:
An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. J. Algorithms 25(2): 336-358 (1997) - [j15]Selim G. Akl, Binay K. Bhattacharya:
Computing Maximum Cliques of Circular Arcs in Parallel. Parallel Algorithms Appl. 12(4): 305-320 (1997) - [c12]Binay K. Bhattacharya:
Biased search and k-point clustering. CCCG 1997 - 1996
- [j14]Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya:
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. J. Algorithms 20(2): 244-267 (1996) - [j13]Binay K. Bhattacharya, Pavol Hell, Jing Huang:
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. SIAM J. Discret. Math. 9(2): 274-289 (1996) - 1995
- [c11]Binay K. Bhattacharya, Asish Mukhopadhyay:
Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. ISAAC 1995: 22-31 - 1994
- [j12]Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, J.-M. Robert:
Optimal algorithms for some intersection radius problems. Computing 52(3): 269-279 (1994) - 1993
- [c10]Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya:
Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. CCCG 1993: 169-174 - [c9]Pinaki Mitra, Binay K. Bhattacharya:
Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. WADS 1993: 518-529 - 1992
- [j11]Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia:
Computing shortest transversals of sets. Int. J. Comput. Geom. Appl. 2(4): 417-442 (1992) - [c8]Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya:
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. FSTTCS 1992: 92-103 - 1991
- [j10]Binay Bhattacharya, Godfried Toussaint:
Computing shortest transversals. Computing 46(2): 93-119 (1991) - [j9]Binay K. Bhattacharya:
An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window. CVGIP Graph. Model. Image Process. 53(3): 269-270 (1991) - [j8]Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint:
A counterexample to a dynamic algorithm for convex hulls of line arrangements. Pattern Recognit. Lett. 12(3): 145-147 (1991) - [c7]Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia:
Computing Shortest Transversals of Sets (Extended Abstract). SCG 1991: 71-80 - [c6]Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert:
Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). SCG 1991: 81-88 - [c5]Binay K. Bhattacharya:
Usefulness of Angle-Sweep over Line-Sweep. FSTTCS 1991: 390-419 - [c4]Binay K. Bhattacharya, Godfried T. Toussaint:
Computing Shortest Transversals. ICALP 1991: 649-660 - [c3]Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint:
A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. WADS 1991: 412-424
1980 – 1989
- 1989
- [c2]Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint:
Determining Sector Visibility of a Polygon. SCG 1989: 247-253 - 1988
- [j7]Binay K. Bhattacharya, J. Zorbas:
Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot. J. Algorithms 9(4): 449-469 (1988) - [j6]David Avis, Binay K. Bhattacharya, Hiroshi Imai:
Computing the volume of the union of spheres. Vis. Comput. 3(6): 323-328 (1988) - [j5]Binay K. Bhattacharya, Godfried T. Toussaint:
Fast algorithms for computing the diameter of a finite planar set. Vis. Comput. 3(6): 379-388 (1988) - [c1]Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao:
Clustering Algorithms Based on Minimum and Maximum Spanning Trees. SCG 1988: 252-257 - 1983
- [j4]Binay K. Bhattacharya, Godfried T. Toussaint:
Time- and storage-efficient implementation of an optimal planar convex hull algorithm. Image Vis. Comput. 1(3): 140-144 (1983) - [j3]Binay K. Bhattacharya, Godfried T. Toussaint:
Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. J. Algorithms 4(2): 121-136 (1983) - [j2]Godfried T. Toussaint, Binay K. Bhattacharya:
Optimal algorithms for computing the minimum distance between two finite planar sets. Pattern Recognit. Lett. 2(2): 79-82 (1983) - 1982
- [j1]Binay K. Bhattacharya, Godfried T. Toussaint:
A Counterexample to a Diameter Algorithm for Convex Polygons. IEEE Trans. Pattern Anal. Mach. Intell. 4(3): 306-309 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-08 20:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
