Publications (20)
On Pseudo-Convex Partitions of a Planar Point Set
Bhaswar B. Bhattacharya, Sandip Das
Disjoint Empty Convex Pentagons in Planar Point Sets
Bhaswar B. Bhattacharya, Sandip Das
On local structures of cubicity 2 graphs
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das +1
Chromatic number of signed graphs with bounded maximum degree
Sandip Das, Soumen Nandi, Soumyajit Paul +1
Voronoi Game on Graphs
Sayan Bandyapadhyay, Aritra Banik, Sandip Das +1
Holes or Empty Pseudo-Triangles in Planar Point Sets
Bhaswar B. Bhattacharya, Sandip Das
On bounds on bend number of split and cocomparability graphs
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee +1
Almost Empty Monochromatic Triangles in Planar Point Sets
Deepan Basu, Kinjal Basu, Bhaswar B. Bhattacharya +1
Querying for the Largest Empty Geometric Object in a Desired Location
John Augustine, Sandip Das, Anil Maheshwari +3
Geometric k-Center Problems with Centers Constrained to Two Lines
Binay Bhattacharya, Sandip Das, Yuya Higashikawa +2
On a special class of boxicity 2 graphs
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das +1
The $p$-Center Problem in Tree Networks Revisited
Aritra Banik, Binay Bhattacharya, Sandip Das +2
Localized Geometric Query Problems
John Augustine, Sandip Das, Anil Maheshwari +3
On chromatic number of colored mixed graphs
Sandip Das, Soumen Nandi, Sagnik Sen
Computing the Minkowski Sum of Convex Polytopes in $\Re^d$
Sandip Das, Swami Sarvottamananda
Linear-Time Fitting of a $k$-Step Function
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
Approximation Algorithms for Shortest Descending Paths in Terrains
Mustaq Ahmed, Sandip Das, Sachin Lodha +3
Approximating Minimum Dominating Set on String Graphs
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
A Variable Rate Fronthaul Scheme for Cloud Radio Access Networks (C-RAN)
Sandip Das, Marco Ruffini
On relative clique number of colored mixed graphs
Sandip Das, Soumen Nandi, Debdeep Roy +1