Sandip Das

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 103

Top Venues

Publications

Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen
Growth Rate of the Number of Empty Triangles in the Plane. CALDAM (2024)
Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat
Cops and Robber on butterflies, grids, and AT-free graphs. Discret. Appl. Math. 345 (2024)
Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen
Growth Rate of the Number of Empty Triangles in the Plane. CoRR (2024)
Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Approximation algorithms for orthogonal line centers. Discret. Appl. Math. 338 (2023)
Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen
Triangle-free projective-planar graphs with diameter two: Domination and characterization. Discret. Appl. Math. 331 (2023)
Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. CALDAM (2023)
Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. CALDAM (2023)
Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen
Cops and Robber on Oriented Graphs with Respect to Push Operation. CALDAM (2023)
Sandip Das, Sk Samim Islam, Ritam M. Mitra, Sanchita Paul
Burning a binary tree and its generalization. CoRR (2023)
Sandip Das, Sk Samim Islam
Approximation algorithm for finding multipacking on Cactus. CoRR (2023)
Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. CoRR (2023)
Sandip Das, Sumitava Ghosh, Swathy Prabhu, Sagnik Sen
A Homomorphic Polynomial for Oriented Graphs. Electron. J. Comb. 30 (1) (2023)
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On clique numbers of colored mixed graphs. Discret. Appl. Math. 324 (2023)
Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
An update on (n, m)-chromatic numbers. CoRR (2023)
Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Complexity results on untangling red-blue matchings. Comput. Geom. 111 (2023)
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. CoRR (2023)
Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen
Triangle-free projective-planar graphs with diameter two: domination and characterization. CoRR (2022)
Manoj Changat, Sandip Das
Preface: CALDAM 2020. Discret. Appl. Math. 319 (2022)
Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Complexity Results on Untangling Red-Blue Matchings. LATIN (2022)
Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. CoRR (2022)
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
. Theor. Comput. Sci. 906 (2022)
Sandip Das, Harmender Gahlawat
Bumblebee visitation problem. Discret. Appl. Math. 319 (2022)
Sandip Das, Harmender Gahlawat
On the Cop Number of String Graphs. ISAAC (2022)
Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
Voronoi Games Using Geodesics. CALDAM (2022)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
On dominating set of some subclasses of string graphs. Comput. Geom. 107 (2022)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
On the signed chromatic number of some classes of graphs. Discret. Math. 345 (2) (2022)
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC (2022)
Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen
On fractional version of oriented coloring. Discret. Appl. Math. 316 (2022)
Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat
Cops and Robber on Butterflies and Solid Grids. CALDAM (2021)
Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Approximation Algorithms for Orthogonal Line Centers. CALDAM (2021)
Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
Computation of spatial skyline points. Comput. Geom. 93 (2021)
Sandip Das, Ayan Nandy, Swami Sarvottamananda
Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions. Discret. Appl. Math. 305 (2021)
Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen
Cops and Robber on some families of oriented graphs. Theor. Comput. Sci. 888 (2021)
Sandip Das, Harmender Gahlawat
Variations of cops and robbers game on grids. Discret. Appl. Math. 305 (2021)
Sandip Das, Siddani Bhaskara Rao, Uma Kant Sahoo
On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs. CALDAM (2021)
Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena
Pushable chromatic number of graphs with degree constraints. Discret. Math. 344 (1) (2021)
Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. CoRR (2021)
Sandip Das, Subhadeep Ranjan Dev, Swami Sarvottamananda
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes. CALDAM (2021)
Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen
On fractional version of oriented coloring. CoRR (2021)
Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Largest triangle inside a terrain. Theor. Comput. Sci. 858 (2021)
Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. WADS (2021)
Sandip Das, Prantar Ghosh, Shamik Ghosh, Sagnik Sen
Oriented bipartite graphs and the Goldbach graph. Discret. Math. 344 (9) (2021)
Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
Voronoi game on polygons. Theor. Comput. Sci. 882 (2021)
Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On clique numbers of colored mixed graphs. CoRR (2021)
Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
On rectangle intersection graphs with stab number at most two. Discret. Appl. Math. 289 (2021)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC (2020)
Sandip Das, Prantar Ghosh, Swathy Prabhu, Sagnik Sen
Relative clique number of planar signed graphs. Discret. Appl. Math. 280 (2020)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR (2020)
Sandip Das, Ayan Nandy, Swami Sarvottamananda
Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints. Discret. Appl. Math. 280 (2020)
Barunabha Chakraborty, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Approximating k-Orthogonal Line Center. COCOA (2020)
Sandip Das, Ayan Nandy, Swami Sarvottamananda
Optimizing movement in convex and non-convex path-networks to establish connectivity. Discret. Appl. Math. 286 (2020)
Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda
Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. COCOA (2020)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
On the signed chromatic number of some classes of graphs. CoRR (2020)
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
Linear-time fitting of a k-step function. Discret. Appl. Math. 280 (2020)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das
The 1-dimensional discrete Voronoi game. Oper. Res. Lett. 47 (2) (2019)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. COCOON (2019)
Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793 (2019)
Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Largest Triangle inside a Terrain. CCCG (2019)
Sandip Das, Harmender Gahlawat
Bumblebee Visitation Problem. CALDAM (2019)
Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM (2019)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena
Pushable chromatic number of graphs with degree constraints. CoRR (2019)
Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth
The Relative Signed Clique Number of Planar Graphs is 8. CALDAM (2019)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo
Bounds on the Bend Number of Split and Cocomparability Graphs. Theory Comput. Syst. 63 (6) (2019)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
Approximating Minimum Dominating Set on String Graphs. WG (2019)
Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen
Cops and Robber on Some Families of Oriented Graphs. IWOCA (2019)
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
The Weighted k-Center Problem in Trees for Fixed k. ISAAC (2019)
Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen
Burning Spiders. CALDAM (2018)
Sandip Das, Swathy Prabhu, Sagnik Sen
A study on oriented relative clique number. Discret. Math. 341 (7) (2018)
Sandip Das, Soumen Nandi, Sagnik Sen
On Oriented L(p, 1)-labeling. CALDAM (2018)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo
On bounds on bend number of classes of split and cocomparability graphs. CoRR (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)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
Approximating Minimum Dominating Set on String Graphs. CoRR (2018)
Sandip Das, Harmender Gahlawat
Variations of Cops and Robbers Game on Grids. CALDAM (2018)
Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
On relative clique number of colored mixed graphs. CoRR (2018)
Sandip Das, Ayan Nandy, Swami Sarvottamananda
Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions. CALDAM (2018)
Sandip Das, Swami Sarvottamananda
. CoRR (2018)
Sandip Das, Ayan Nandy, Swami Sarvottamananda
Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity. CALDAM (2017)
Sandip Das, Sasthi C. Ghosh, Soumen Nandi, Sagnik Sen
A lower bound technique for radio k-coloring. Discret. Math. 340 (5) (2017)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee
. Comput. Geom. 63 (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)
Sandip Das, Soumen Nandi, Sagnik Sen
On Chromatic Number of Colored Mixed Graphs. CALDAM (2017)
Sandip Das, Sasthi C. Ghosh, Soumen Nandi
Optimal L(3, 2, 1)-labeling of triangular lattice. Discret. Appl. Math. 228 (2017)
Sandip Das, Ayan Nandy, Swami Sarvottamananda
Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints. CALDAM (2016)
Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
The $p$-Center Problem in Tree Networks Revisited. CoRR (2016)
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
Linear-Time Fitting of a k-Step Function. CALDAM (2016)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On Local Structures of Cubicity 2 Graphs. COCOA (2016)
Sandip Das, Shamik Ghosh, Prantar Ghosh, Sagnik Sen
Oriented Bipartite Graphs and the Goldbach Graph. CoRR (2016)
Deepan Basu, Kinjal Basu, Bhaswar B. Bhattacharya, Sandip Das
Almost empty monochromatic triangles in planar point sets. Discret. Appl. Math. 210 (2016)
Sandip Das, Ayan Nandy, Swami Sarvottamananda
Under Convex Polyhedral Distance Function. FAW (2016)
Ashok Kumar Das, Sandip Das, Malay K. Sen
Forbidden substructure for interval digraphs/bigraphs. Discret. Math. 339 (2) (2016)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On a special class of boxicity 2 graphs. CoRR (2016)
Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
The p-Center Problem in Tree Networks Revisited. SWAT (2016)
Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen
Relative Clique Number of Planar Signed Graphs. CALDAM (2016)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On local structures of cubicity 2 graphs. CoRR (2016)
Sandip Das, Soumen Nandi, Sagnik Sen
On chromatic number of colored mixed graphs. CoRR (2015)
Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi game on graphs. Theor. Comput. Sci. 562 (2015)
Sandip Das, Swathyprabhu Mj, Sagnik Sen
On oriented relative clique number. Electron. Notes Discret. Math. 50 (2015)
Binay K. Bhattacharya, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Hirotaka Ono, Yota Otachi
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR (2015)
Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG (2015)
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points. Int. J. Comput. Geom. Appl. 25 (4) (2015)

Sandip Das.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sandip Das