Binay Bhattacharya

Simon Fraser University — Canada

Computer Science · Physical Sciences

21h-index1.4kcitations144works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(85), Facility Location and Emergency Management(45), Data Management and Algorithms(32), Optimization and Search Problems(31), Complexity and Algorithms in Graphs(27)

Publications144 total

A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs
Lecture notes in computer science·2025
Improved algorithms for optimal k sink location on path networks
Theoretical Computer Science·2025
A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons
Lecture notes in computer science·2023
A Subquadratic Time Algorithm for the Weighted $k$-Center Problem on Cactus Graphs
arXiv (Cornell University)·2023Open Access
An Efficient Algorithm for the Proximity Connected Two Center Problem
arXiv (Cornell University)·2022Open Access
The weighted k-center problem in trees for fixed k
Theoretical Computer Science·2022· 2 citedOpen Access
An Efficient Algorithm for the Proximity Connected Two Center Problem
Lecture notes in computer science·2022· 3 cited
Locating Evacuation Centers Optimally in Path and Cycle Networks
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021Open Access
Computation of spatial skyline points
Computational Geometry·2020Open Access
Constant work-space algorithms for facility location problems
Discrete Applied Mathematics·2020· 2 cited
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
INFORMS journal on computing·2020Open Access
Minsum k-sink problem on path networks
Theoretical Computer Science·2019Open Access
Minmax-Regret Evacuation Planning for Cycle Networks
Lecture notes in computer science·2019· 1 cited
Minsum k-Sink Problem on Dynamic Flow Path Networks
Lecture notes in computer science·2018· 9 cited
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018· 2 citedOpen Access
Linear-time fitting of a <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml13" display="inline" overflow="scroll" altimg="si13.gif"><mml:mi>k</mml:mi></mml:math>-step function
Discrete Applied Mathematics·2017· 2 cited
Bilinear Assignment Problem: Large Neighborhoods and Experimental\n Analysis of Algorithms
arXiv (Cornell University)·2017Open Access
The bilinear assignment problem: complexity and polynomially solvable special cases
Mathematical Programming·2017Open Access
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks
Lecture notes in computer science·2017· 19 cited
Minimum Enclosing Circle Problem with Base Point.
Canadian Conference on Computational Geometry·2017
page 1 of 8Next →

Frequent Co-authors

Qiaosheng Shi(11), Tsunehiko Kameda(6), David Kirkpatrick(5), Godfried Toussaint(5), Yuzhuang Hu(4), Boaz Ben‐Moshe(4), Michael Segal(4), Godfried T. Toussaint(4), Evangelos Kranakis(3), Sergei Bespamyatnikh(3), Asish Mukhopadhyay(3), Mark Keil(2), Andreas Wiese(2), Arie Tamir(2), David Avis(2), Robert Benkoczi(2), Subir Kumar Ghosh(2), Zhao Song(2), Jurek Czyzowicz(2), Peter Egyed(2)