Binay Bhattacharya

31 papers B 4C 4Journal 17Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
Improved algorithms for optimal k sink location on path networks.
Theor. Comput. Sci.
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2023 — conf
A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons.
COCOON (2)
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
2023 J jnl
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.
CoRR
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2022 — conf
A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic.
CCCG
Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari
2022 — conf
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.
JCDCGGG
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2022 C conf
An Efficient Algorithm for the Proximity Connected Two Center Problem.
IWOCA
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
2022 J jnl
An Efficient Algorithm for the Proximity Connected Two Center Problem.
CoRR
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
2022 J jnl
The weighted
Theor. Comput. Sci.
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2021 J jnl
Computation of spatial skyline points.
Comput. Geom.
Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
2021 C conf
Locating Evacuation Centers Optimally in Path and Cycle Networks.
ATMOS
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama
2020 J jnl
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms.
INFORMS J. Comput.
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
2020 J jnl
Linear-time fitting of a k-step function.
Discret. Appl. Math.
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
2020 J jnl
Minsum
Theor. Comput. Sci.
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2019 C conf
Minmax-Regret Evacuation Planning for Cycle Networks.
TAMC
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2019 B conf
The Weighted k-Center Problem in Trees for Fixed k.
ISAAC
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2018 B conf
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks.
ISAAC
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2018 J jnl
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks.
CoRR
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2018 C conf
Minsum k-Sink Problem on Dynamic Flow Path Networks.
IWOCA
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2018 J jnl
Minsum k-Sink Problem on Path Networks.
CoRR
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2018 J jnl
Optimizing squares covering a set of points.
Theor. Comput. Sci.
Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song
2017 J jnl
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms.
CoRR
Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya
2017 B conf
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks.
WADS
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2017 — conf
Minimum Enclosing Circle Problem with Base Point.
CCCG
Binay Bhattacharya, Lily Li
2017 J jnl
On representing a simple polygon perceivable to a blind person.
Inf. Process. Lett.
Sandip Banerjee, Bhargab B. Bhattacharya, Binay Bhattacharya, Arindam Biswas, Sandip Das, Ritankar Mandal, Sasanka Roy
2017 J jnl
The bilinear assignment problem: complexity and polynomially solvable special cases.
Math. Program.
Ante Custic, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya
2016 — conf
Linear-Time Fitting of a k-Step Function.
CALDAM
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
2015 — conf
Geometric p-Center Problems with Centers Constrained to Two Lines.
JCDCGG
Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2015 J jnl
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks.
Discret. Appl. Math.
Binay Bhattacharya, Tsunehiko Kameda, Zhao Song
2014 J jnl
The cyclical scheduling problem.
Theor. Comput. Sci.
Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti
2013 B conf
The Cyclical Scheduling Problem.
WALCOM
Binay Bhattacharya, Soudipta Chakraborty, Ehsan Iranmanesh, Ramesh Krishnamurti
1991 J jnl
Computing shortest transversals.
Computing
Binay Bhattacharya, Godfried Toussaint