Binay K. Bhattacharya

Publication Activity (10 Years)

Years Active: 1982-2020
Publications (10 Years): 12

Top Venues

CoRR

COCOA

CCCG

Theor. Comput. Sci.

Publications

Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
Constant work-space algorithms for facility location problems. Discret. Appl. Math. 283 (2020)
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228 (2017)
Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
The $p$-Center Problem in Tree Networks Revisited. CoRR (2016)
Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR (2016)
Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
. Theor. Comput. Sci. 615 (2016)
Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
The p-Center Problem in Tree Networks Revisited. SWAT (2016)
Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. CoRR (2015)
Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. COCOA (2015)
Binay K. Bhattacharya, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Hirotaka Ono, Yota Otachi
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR (2015)
Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda
Linear-Time Fitting of a $k$-Step Function. CoRR (2015)
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
Rectilinear Path Problems in Restricted Memory Setup. CALDAM (2015)
Binay K. Bhattacharya, Tsunehiko Kameda
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. Theor. Comput. Sci. 607 (2015)
Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song
Optimizing Squares Covering a Set of Points. COCOA (2014)
Binay K. Bhattacharya, Qiaosheng Shi
Improved algorithms to network p-center location problems. Comput. Geom. 47 (2) (2014)
Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. Algorithmica 70 (1) (2014)
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
Facility location problems in the constant work-space read-only memory model. CoRR (2014)
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)
Binay K. Bhattacharya, Tsunehiko Kameda
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. COCOA (2014)
Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. LATIN (2014)
Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. CCCG (2014)
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG (2014)
Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya
Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25 (2) (2013)
Binay K. Bhattacharya, Tsunehiko Kameda
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. COCOON (2012)
Binay K. Bhattacharya, Yuzhuang Hu
k-delivery traveling salesman problem on tree networks. FSTTCS (2012)
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 (2012)
Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. ISAAC (2012)
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)
Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM (2010)
Binay K. Bhattacharya, Yuzhuang Hu
Approximation Algorithms for the Multi-Vehicle Scheduling Problem. ISAAC (2) (2010)
Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya
Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) (2010)
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)
Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang
Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. ICRA (2009)
Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. Algorithmica 55 (4) (2009)
Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi
Approximation Algorithms for a Network Design Problem. COCOON (2009)
Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir
Collection depots facility location problems in trees. Networks 53 (1) (2009)
Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
Single facility collection depots location problem in the plane. Comput. Geom. 42 (5) (2009)
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) (2009)
Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
On Finding Non-dominated Points using Compact Voronoi Diagrams CoRR (2009)
Qiaosheng Shi, Binay K. Bhattacharya
Application of computational geometry to network p-center location problems. CCCG (2008)
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)
Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi
New Upper Bounds on Continuous Tree Edge-Partition Problem. AAIM (2008)
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)
Rong Ge, Martin Ester, Byron J. Gao, Zengjian Hu, Binay K. Bhattacharya, Boaz Ben-Moshe
-center problem, algorithms and applications. ACM Trans. Knowl. Discov. Data 2 (2) (2008)
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) (2008)
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) (2007)
Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi
) time. CCCG (2007)
Binay K. Bhattacharya, Qiaosheng Shi
. WADS (2007)
Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov
Approximation Algorithms for the Black and White Traveling Salesman Problem. COCOON (2007)
Binay K. Bhattacharya, Jeff Sember
Efficient Snap Rounding with Integer Arithmetic. CCCG (2007)
Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378 (3) (2007)
Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. LATIN (2006)
Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. ISAAC (2006)
Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda
An Optimal Solution to Room Search Problem. CCCG (2006)
Robert Benkoczi, Binay K. Bhattacharya, David Breton
Efficient computation of 2-medians in a tree network with positive/negative weights. Discret. Math. 306 (14) (2006)
Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
Competitive Algorithms for Maintaining a Mobile Center. Mob. Networks Appl. 11 (2) (2006)
Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer
A linear time algorithm to remove winding of a simple polygon. Comput. Geom. 33 (3) (2006)
Robert Benkoczi, Binay K. Bhattacharya
A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time. ESA (2005)
Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. ISAAC (2005)
Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
Computing the Widest Empty Boomerang. CCCG (2005)
Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. CCCG (2005)
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint
Geometric Decision Rules for Instance-Based Learning Problems. PReMI (2005)
Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
Collection depot location problem in the plane. CCCG (2005)
Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
-Medians in Trees. MFCS (2003)
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 (2003)
Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS (2002)
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
Improved Algorithms for Uniform Partitions of Points. Algorithmica 32 (4) (2002)
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) (2002)
Binay K. Bhattacharya, Asish Mukhopadhyay
On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG (2002)
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) (2002)
Binay K. Bhattacharya, Robert Benkoczi
On computing the optimal bridge between two convex polygons. Inf. Process. Lett. 79 (5) (2001)
Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan
Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS (2001)
Binay K. Bhattacharya, Subir Kumar Ghosh
Characterizing LR-visibility polygons and related problems. Comput. Geom. 18 (1) (2001)
Maria del C. Amézquita Benítez, Kamal K. Gupta, Binay K. Bhattacharya
EODM - A Novel Representation for Collision Detection. ICRA (2000)
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)
Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
Mobile facility location. DIAL-M (2000)
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC (1999)
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) (1999)
Binay K. Bhattacharya, Michael E. Houle
Generalized Maximum Independent Sets for Trees in Subquadratic Time. ISAAC (1999)
Binay K. Bhattacharya, Subir Kumar Ghosh
Characterizing lr-visibility polygons and related problems. CCCG (1998)
Binay K. Bhattacharya, Damon Kaller
Reference set thinning for the k-nearest neighbor decision rule. ICPR (1998)
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) (1997)
Selim G. Akl, Binay K. Bhattacharya
Computing Maximum Cliques of Circular Arcs in Parallel. Parallel Algorithms Appl. 12 (4) (1997)
Binay K. Bhattacharya, Sandeep Sen
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms 25 (1) (1997)
Binay K. Bhattacharya
Biased search and k-point clustering. CCCG (1997)
Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. J. Algorithms 20 (2) (1996)
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) (1996)
Binay K. Bhattacharya, Asish Mukhopadhyay
Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. ISAAC (1995)
Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, J.-M. Robert
Optimal algorithms for some intersection radius problems. Computing 52 (3) (1994)
Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya
Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. CCCG (1993)
Pinaki Mitra, Binay K. Bhattacharya
Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. WADS (1993)
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) (1992)
Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. FSTTCS (1992)
Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert
Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). SCG (1991)
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)
Binay K. Bhattacharya
An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window. CVGIP Graph. Model. Image Process. 53 (3) (1991)
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) (1991)
Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia
Computing Shortest Transversals of Sets (Extended Abstract). SCG (1991)
Binay K. Bhattacharya
Usefulness of Angle-Sweep over Line-Sweep. FSTTCS (1991)
Binay K. Bhattacharya, Godfried T. Toussaint
Computing Shortest Transversals. ICALP (1991)
Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint
Determining Sector Visibility of a Polygon. SCG (1989)

Binay K. Bhattacharya.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Binay K. Bhattacharya