Binay Bhattacharya

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 24

Top Topics

Top Venues

Theor. Comput. Sci.

Publications

Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. CoRR (2023)
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. COCOON (2) (2023)
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
An Efficient Algorithm for the Proximity Connected Two Center Problem. CoRR (2022)
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)
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
. Theor. Comput. Sci. 906 (2022)
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
An Efficient Algorithm for the Proximity Connected Two Center Problem. IWOCA (2022)
Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
Computation of spatial skyline points. Comput. Geom. 93 (2021)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS (2021)
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
Linear-time fitting of a k-step function. Discret. Appl. Math. 280 (2020)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
-sink problem on path networks. Theor. Comput. Sci. 806 (2020)
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. INFORMS J. Comput. 32 (3) (2020)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minmax-Regret Evacuation Planning for Cycle Networks. TAMC (2019)
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
The Weighted k-Center Problem in Trees for Fixed k. ISAAC (2019)
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. CoRR (2018)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA (2018)
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 (2018)
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)
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Minsum k-Sink Problem on Path Networks. CoRR (2018)
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms. CoRR (2017)
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS (2017)
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 (2017)
Ante Custic, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya
The bilinear assignment problem: complexity and polynomially solvable special cases. Math. Program. 166 (1-2) (2017)
Binay Bhattacharya, Lily Li
Minimum Enclosing Circle Problem with Base Point. CCCG (2017)
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
Linear-Time Fitting of a k-Step Function. CALDAM (2016)
Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG (2015)
Binay Bhattacharya, Tsunehiko Kameda, Zhao Song
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Discret. Appl. Math. 195 (2015)
Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti
The cyclical scheduling problem. Theor. Comput. Sci. 555 (2014)
Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti
The Cyclical Scheduling Problem. WALCOM (2013)
Binay Bhattacharya, Godfried Toussaint
Computing shortest transversals. Computing 46 (2) (1991)