E-LIB Suche - Ergebnisse für: Bhattacharya, Binay

1

A Sub-quadratic Time Algorithm for Computing the Beacon Ker..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Bhattacharya, Binay ; Mozafari, Amirhossein ; Shermer, Thomas C. - p. 69-81 , 2023

Link: https://doi.org/10.1007/..

2

The weighted k-center problem in trees for fixed k:

Bhattacharya, Binay ; Das, Sandip ; Dev, Subhadeep Ranjan
Theoretical Computer Science. 906 (2022) - p. 64-75 , 2022

Link: https://doi.org/10.1016/..

3

An Efficient Algorithm for the Proximity Connected Two Cent..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Bhattacharya, Binay ; Mozafari, Amirhossein ; Shermer, Thomas C. - p. 199-213 , 2022

Link: https://doi.org/10.1007/..

4

Computation of spatial skyline points:

Bhattacharya, Binay ; Bishnu, Arijit ; Cheong, Otfried...
Computational Geometry. 93 (2021) - p. 101698 , 2021

Link: https://doi.org/10.1016/..

5

Minsum k-sink problem on path networks:

Benkoczi, Robert ; Bhattacharya, Binay ; Higashikawa, Yuya..
Theoretical Computer Science. 806 (2020) - p. 388-401 , 2020

Link: https://doi.org/10.1016/..

6

Linear-time fitting of a k-step function:

Bhattacharya, Binay ; Das, Sandip ; Kameda, Tsunehiko
Discrete Applied Mathematics. 280 (2020) - p. 43-52 , 2020

Link: https://doi.org/10.1016/..

7

Bilinear Assignment Problem: Large Neighborhoods and Experi..:

Sokol, Vladyslav ; Ćustić, Ante ; Punnen, Abraham P..
INFORMS Journal on Computing. 32 (2020) 3 - p. 730-746 , 2020

Link: https://doi.org/10.1287/..

8

Minmax-Regret Evacuation Planning for Cycle Networks:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,

Benkoczi, Robert ; Bhattacharya, Binay ; Higashikawa, Yuya.. - p. 42-58 , 2019

Link: https://doi.org/10.1007/..

9

Optimizing squares covering a set of points:

Bereg, Sergey ; Bhattacharya, Binay ; Das, Sandip...
Theoretical Computer Science. 729 (2018) - p. 68-83 , 2018

Link: https://doi.org/10.1016/..

10

On representing a simple polygon perceivable to a blind per..:

Banerjee, Sandip ; Bhattacharya, Bhargab B. ; Bhattacharya, Binay...
Information Processing Letters. 120 (2017) - p. 1-5 , 2017

Link: https://doi.org/10.1016/..

11

The bilinear assignment problem: complexity and polynomiall..:

Ćustić, Ante ; Sokol, Vladyslav ; Punnen, Abraham P..
Mathematical Programming. 166 (2017) 1-2 - p. 185-205 , 2017

Link: https://doi.org/10.1007/..

12

Minmax regret 1-center algorithms for path/tree/unicycle/ca..:

Bhattacharya, Binay ; Kameda, Tsunehiko ; Song, Zhao
Discrete Applied Mathematics. 195 (2015) - p. 18-30 , 2015

Link: https://doi.org/10.1016/..

13

Improved algorithms for computing minmax regret sinks on dy..:

Bhattacharya, Binay ; Kameda, Tsunehiko
Theoretical Computer Science. 607 (2015) - p. 411-425 , 2015

Link: https://doi.org/10.1016/..

14

The cyclical scheduling problem:

Bhattacharya, Binay ; Chakraborty, Soudipta ; Iranmanesh, Ehsan.
Theoretical Computer Science. 555 (2014) - p. 9-22 , 2014

Link: https://doi.org/10.1016/..

15

Improved algorithms to network p -center location problems:

Bhattacharya, Binay ; Shi, Qiaosheng
Computational Geometry. 47 (2014) 2 - p. 307-315 , 2014

Link: https://doi.org/10.1016/..