default search action
Sandip Das 0001
Person information
- affiliation: Indian Statistical Institute, Advanced Computing and Microelectronics Unit, Kolkata, India
Other persons with the same name
- Sandip Das — disambiguation page
- Sandip Das 0002
— University of Engineering and Management, Electronics and Communication Engineering Department, Jaipur, India
- Sandip Das 0003 — G. S. Sanyal School of Telecommunications, Indian Institute of Technology Kharagpur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j86]Sheikh Shakil Akhtar
Cops and Robber on butterflies, grids, and AT-free graphs. Discret. Appl. Math. 345: 231-245 (2024) - [j85]Sandip Das, Subhadeep Ranjan Dev
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes. Discret. Appl. Math. 350: 44-61 (2024) - [j84]Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni:
On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. Discret. Appl. Math. 358: 417-428 (2024) - [j83]Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen:
Oriented total-coloring of oriented graphs. Discret. Math. 347(12): 114174 (2024) - [c83]Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Growth Rate of the Number of Empty Triangles in the Plane. CALDAM 2024: 77-87 - [i33]Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Growth Rate of the Number of Empty Triangles in the Plane. CoRR abs/2402.07775 (2024) - [i32]Sandip Das, Harmender Gahlawat:
On the Cop Number of String Graphs. CoRR abs/2408.11002 (2024) - 2023
- [j82]Sandip Das, Sumitava Ghosh, Swathy Prabhu, Sagnik Sen:
A Homomorphic Polynomial for Oriented Graphs. Electron. J. Comb. 30(1) (2023) - [j81]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Complexity results on untangling red-blue matchings. Comput. Geom. 111: 101974 (2023) - [j80]Dipayan Chakraborty
On clique numbers of colored mixed graphs. Discret. Appl. Math. 324: 29-40 (2023) - [j79]Dibyayan Chakraborty
Triangle-free projective-planar graphs with diameter two: Domination and characterization. Discret. Appl. Math. 331: 11-24 (2023) - [j78]Arun Kumar Das
Approximation algorithms for orthogonal line centers. Discret. Appl. Math. 338: 69-76 (2023) - [c82]Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. CALDAM 2023: 89-100 - [c81]Sandip Das, Florent Foucaud
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. CALDAM 2023: 297-308 - [c80]Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Oriented Graphs with Respect to Push Operation. CALDAM 2023: 309-320 - [i31]Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. CoRR abs/2303.17204 (2023) - [i30]Sandip Das, Koushik Kumar Dey, Pavan P. D, Sagnik Sen:
Counting the minimum number of arcs in an oriented graph having weak diameter 2. CoRR abs/2304.00742 (2023) - [i29]Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni:
An update on (n, m)-chromatic numbers. CoRR abs/2306.08069 (2023) - [i28]Sandip Das, Sk Samim Islam, Ritam M. Mitra, Sanchita Paul:
Burning a binary tree and its generalization. CoRR abs/2308.02825 (2023) - [i27]Sandip Das, Sk Samim Islam:
Approximation algorithm for finding multipacking on Cactus. CoRR abs/2308.04882 (2023) - [i26]Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee:
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. CoRR abs/2312.10485 (2023) - 2022
- [j77]Dibyayan Chakraborty
On dominating set of some subclasses of string graphs. Comput. Geom. 107: 101884 (2022) - [j76]Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen:
On fractional version of oriented coloring. Discret. Appl. Math. 316: 33-42 (2022) - [j75]Sandip Das, Harmender Gahlawat
Bumblebee visitation problem. Discret. Appl. Math. 319: 27-41 (2022) - [j74]Manoj Changat, Sandip Das:
Preface: CALDAM 2020. Discret. Appl. Math. 319: 192-193 (2022) - [j73]Julien Bensmail, Sandip Das, Soumen Nandi
On the signed chromatic number of some classes of graphs. Discret. Math. 345(2): 112664 (2022) - [j72]Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
The weighted k-center problem in trees for fixed k. Theor. Comput. Sci. 906: 64-75 (2022) - [c79]Arun Kumar Das
Voronoi Games Using Geodesics. CALDAM 2022: 195-207 - [c78]Dibyayan Chakraborty
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC 2022: 12:1-12:17 - [c77]Sandip Das, Harmender Gahlawat
On the Cop Number of String Graphs. ISAAC 2022: 45:1-45:18 - [c76]Arun Kumar Das
Complexity Results on Untangling Red-Blue Matchings. LATIN 2022: 730-745 - [i25]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. CoRR abs/2202.11857 (2022) - [i24]Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen:
Triangle-free projective-planar graphs with diameter two: domination and characterization. CoRR abs/2212.04253 (2022) - 2021
- [j71]Binay Bhattacharya, Arijit Bishnu, Otfried Cheong
Computation of spatial skyline points. Comput. Geom. 93: 101698 (2021) - [j70]Dibyayan Chakraborty
On rectangle intersection graphs with stab number at most two. Discret. Appl. Math. 289: 354-365 (2021) - [j69]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions. Discret. Appl. Math. 305: 311-328 (2021) - [j68]Sandip Das, Harmender Gahlawat
Variations of cops and robbers game on grids. Discret. Appl. Math. 305: 340-349 (2021) - [j67]Julien Bensmail, Sandip Das, Soumen Nandi
Pushable chromatic number of graphs with degree constraints. Discret. Math. 344(1): 112151 (2021) - [j66]Sandip Das, Prantar Ghosh
Oriented bipartite graphs and the Goldbach graph. Discret. Math. 344(9): 112497 (2021) - [j65]Arun Kumar Das
Largest triangle inside a terrain. Theor. Comput. Sci. 858: 90-99 (2021) - [j64]Aritra Banik, Arun Kumar Das
Voronoi game on polygons. Theor. Comput. Sci. 882: 125-142 (2021) - [j63]Sandip Das, Harmender Gahlawat
Cops and Robber on some families of oriented graphs. Theor. Comput. Sci. 888: 31-40 (2021) - [c75]Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Approximation Algorithms for Orthogonal Line Centers. CALDAM 2021: 43-54 - [c74]Sandip Das, Subhadeep Ranjan Dev, Swami Sarvottamananda:
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes. CALDAM 2021: 179-195 - [c73]Sandip Das, Siddani Bhaskara Rao, Uma Kant Sahoo:
On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs. CALDAM 2021: 259-271 - [c72]Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat
Cops and Robber on Butterflies and Solid Grids. CALDAM 2021: 272-281 - [c71]Sergio Cabello
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. WADS 2021: 258-270 - [i23]Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. CoRR abs/2104.07416 (2021) - [i22]Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. CoRR abs/2104.11420 (2021) - [i21]Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen:
On fractional version of oriented coloring. CoRR abs/2107.13443 (2021) - 2020
- [j62]Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
Linear-time fitting of a k-step function. Discret. Appl. Math. 280: 43-52 (2020) - [j61]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints. Discret. Appl. Math. 280: 71-85 (2020) - [j60]Sandip Das, Prantar Ghosh
Relative clique number of planar signed graphs. Discret. Appl. Math. 280: 86-92 (2020) - [j59]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Optimizing movement in convex and non-convex path-networks to establish connectivity. Discret. Appl. Math. 286: 62-77 (2020) - [c70]Barunabha Chakraborty, Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Approximating k-Orthogonal Line Center. COCOA 2020: 47-60 - [c69]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: 515-529 - [c68]Dibyayan Chakraborty
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC 2020: 7:1-7:15 - [e2]Manoj Changat, Sandip Das:
Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings. Lecture Notes in Computer Science 12016, Springer 2020, ISBN 978-3-030-39218-5 [contents] - [i20]Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR abs/2006.16511 (2020) - [i19]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron
On the signed chromatic number of some classes of graphs. CoRR abs/2009.12059 (2020)
2010 – 2019
- 2019
- [j58]Dibyayan Chakraborty
Bounds on the Bend Number of Split and Cocomparability Graphs. Theory Comput. Syst. 63(6): 1336-1357 (2019) - [j57]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
The 1-dimensional discrete Voronoi game. Oper. Res. Lett. 47(2): 115-121 (2019) - [j56]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793: 28-35 (2019) - [c67]Dibyayan Chakraborty
On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM 2019: 124-137 - [c66]Sandip Das, Soumen Nandi
The Relative Signed Clique Number of Planar Graphs is 8. CALDAM 2019: 245-253 - [c65]Sandip Das, Harmender Gahlawat
Bumblebee Visitation Problem. CALDAM 2019: 254-262 - [c64]Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Largest Triangle inside a Terrain. CCCG 2019: 133-138 - [c63]Dibyayan Chakraborty
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. COCOON 2019: 65-77 - [c62]Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
The Weighted k-Center Problem in Trees for Fixed k. ISAAC 2019: 27:1-27:11 - [c61]Sandip Das, Harmender Gahlawat
Cops and Robber on Some Families of Oriented Graphs. IWOCA 2019: 188-200 - [c60]Dibyayan Chakraborty
Approximating Minimum Dominating Set on String Graphs. WG 2019: 232-243 - [i18]Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron
Pushable chromatic number of graphs with degree constraints. CoRR abs/1911.09909 (2019) - 2018
- [j55]Sandip Das, Swathy Prabhu, Sagnik Sen:
A study on oriented relative clique number. Discret. Math. 341(7): 2049-2057 (2018) - [j54]Sergey Bereg
Optimizing squares covering a set of points. Theor. Comput. Sci. 729: 68-83 (2018) - [c59]Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan
Burning Spiders. CALDAM 2018: 155-163 - [c58]Sandip Das, Harmender Gahlawat
Variations of Cops and Robbers Game on Grids. CALDAM 2018: 249-259 - [c57]Sandip Das, Soumen Nandi
On Oriented L(p, 1)-labeling. CALDAM 2018: 274-282 - [c56]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions. CALDAM 2018: 283-300 - [i17]Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo:
On bounds on bend number of classes of split and cocomparability graphs. CoRR abs/1804.06584 (2018) - [i16]Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee:
Approximating Minimum Dominating Set on String Graphs. CoRR abs/1809.09990 (2018) - [i15]Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On relative clique number of colored mixed graphs. CoRR abs/1810.05503 (2018) - [i14]Sandip Das, Swami Sarvottamananda:
Computing the Minkowski Sum of Convex Polytopes in Rd. CoRR abs/1811.05812 (2018) - 2017
- [j53]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee:
The discrete Voronoi game in R2. Comput. Geom. 63: 53-62 (2017) - [j52]Sandip Das, Sasthi C. Ghosh, Soumen Nandi
Optimal L(3, 2, 1)-labeling of triangular lattice. Discret. Appl. Math. 228: 32-40 (2017) - [j51]Sandip Das, Sasthi C. Ghosh, Soumen Nandi
A lower bound technique for radio k-coloring. Discret. Math. 340(5): 855-861 (2017) - [j50]Sandip Banerjee
On representing a simple polygon perceivable to a blind person. Inf. Process. Lett. 120: 1-5 (2017) - [c55]Sandip Das, Soumen Nandi
On Chromatic Number of Colored Mixed Graphs. CALDAM 2017: 130-140 - [c54]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity. CALDAM 2017: 141-155 - 2016
- [j49]Deepan Basu, Kinjal Basu, Bhaswar B. Bhattacharya, Sandip Das:
Almost empty monochromatic triangles in planar point sets. Discret. Appl. Math. 210: 207-213 (2016) - [j48]Ashok Kumar Das, Sandip Das, Malay K. Sen:
Forbidden substructure for interval digraphs/bigraphs. Discret. Math. 339(2): 1028-1051 (2016) - [c53]Binay Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-Time Fitting of a k-Step Function. CALDAM 2016: 85-96 - [c52]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints. CALDAM 2016: 126-138 - [c51]Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen:
Relative Clique Number of Planar Signed Graphs. CALDAM 2016: 326-336 - [c50]Sujoy Kumar Bhore, Dibyayan Chakraborty
On Local Structures of Cubicity 2 Graphs. COCOA 2016: 254-269 - [c49]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function. FAW 2016: 41-52 - [c48]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The p-Center Problem in Tree Networks Revisited. SWAT 2016: 6:1-6:15 - [i13]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On a special class of boxicity 2 graphs. CoRR abs/1603.09561 (2016) - [i12]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On local structures of cubicity 2 graphs. CoRR abs/1603.09570 (2016) - [i11]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The $p$-Center Problem in Tree Networks Revisited. CoRR abs/1604.07535 (2016) - [i10]Sandip Das, Shamik Ghosh, Prantar Ghosh, Sagnik Sen:
Oriented Bipartite Graphs and the Goldbach Graph. CoRR abs/1611.10259 (2016) - 2015
- [j47]Soumen Nandi
On L(k, k-1, ..., 1) labeling of triangular lattice. Electron. Notes Discret. Math. 48: 281-288 (2015) - [j46]Sandip Das, Swathyprabhu Mj, Sagnik Sen:
On oriented relative clique number. Electron. Notes Discret. Math. 50: 95-101 (2015) - [j45]Priya Ranjan Sinha Mahapatra
Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points. Int. J. Comput. Geom. Appl. 25(4): 263-282 (2015) - [j44]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi game on graphs. Theor. Comput. Sci. 562: 270-282 (2015) - [c47]Sujoy Kumar Bhore, Dibyayan Chakraborty
On a Special Class of Boxicity 2 Graphs. CALDAM 2015: 157-168 - [c46]Binay Bhattacharya, Ante Custic
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG 2015: 24-36 - [i9]Sandip Das, Soumen Nandi, Sagnik Sen:
On chromatic number of colored mixed graphs. CoRR abs/1508.07222 (2015) - [i8]Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR abs/1512.07533 (2015) - [i7]Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-Time Fitting of a $k$-Step Function. CoRR abs/1512.07537 (2015) - 2014
- [j43]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum enclosing circle of a set of fixed points and a mobile point. Comput. Geom. 47(9): 891-898 (2014) - [c45]Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid:
A Facility Coloring Problem in 1-D. AAIM 2014: 88-99 - [c44]Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra
Optimizing Squares Covering a Set of Points. COCOA 2014: 37-52 - [c43]Soumen Nandi, Nitish Panigrahy, Mohit Agrawal, Sasthi Charan Ghosh, Sandip Das:
Efficient channel assignment for cellular networks modeled as honeycomb grid. ICTCS 2014: 183-295 - [i6]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar:
Voronoi Game on Graphs. CoRR abs/1407.8474 (2014) - 2013
- [j42]Sandip Das, Mathew C. Francis, Pavol Hell, Jing Huang:
Recognition and Characterization of Chronological Interval Digraphs. Electron. J. Comb. 20(3): 5 (2013) - [j41]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013) - [j40]Bhaswar B. Bhattacharya, Sandip Das:
On pseudo-convex partitions of a planar point set. Discret. Math. 313(21): 2401-2408 (2013) - [j39]Deepan Basu, Bhaswar B. Bhattacharya, Sandip Das:
Almost Empty Monochromatic Triangles in Planar Point Sets. Electron. Notes Discret. Math. 44: 53-59 (2013) - [j38]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2): 176-190 (2013) - [j37]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Optimal strategies for the one-round discrete Voronoi game on a line. J. Comb. Optim. 26(4): 655-669 (2013) - [j36]Asim Basu, Sandip Das, Shamik Ghosh, Malay K. Sen:
Circular-Arc Bigraphs and Its Subclasses. J. Graph Theory 73(4): 361-376 (2013) - [j35]Bhaswar B. Bhattacharya, Sandip Das:
Disjoint empty convex pentagons in planar point sets. Period. Math. Hung. 66(1): 73-86 (2013) - [j34]Sandip Banerjee
On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. Trans. Comput. Sci. 20: 22-38 (2013) - [j33]Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra
Minimum-width rectangular annulus. Theor. Comput. Sci. 508: 74-80 (2013) - [c42]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
Two-Round Discrete Voronoi Game along a Line. FAW-AAIM 2013: 210-220 - [c41]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee:
One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities. CCCG 2013 - [c40]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The Discrete Voronoi Game in a Simple Polygon. COCOON 2013: 197-207 - [c39]Barun Gorain, Partha Sarathi Mandal
POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks. ICDCN 2013: 463-464 - [c38]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar:
Voronoi Game on Graphs. WALCOM 2013: 77-88 - 2012
- [c37]Sandip Banerjee
On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. ISVD 2012: 132-137 - 2011
- [j32]Sandip Das, Ryuhei Uehara
Guest Editor's Foreword. J. Graph Algorithms Appl. 15(3): 319-321 (2011) - [c36]Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra
Minimum Width Rectangular Annulus. FAW-AAIM 2011: 364-374 - [c35]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. COCOON 2011: 213-224 - [c34]Priya Ranjan Sinha Mahapatra
k-Enclosing Axis-Parallel Square. ICCSA (3) 2011: 84-93 - [c33]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. WALCOM 2011: 98-109 - [i5]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized Geometric Query Problems. CoRR abs/1111.2918 (2011) - 2010
- [j31]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43(2): 182-190 (2010) - [j30]Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010) - [c32]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368 - [c31]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM 2010: 82-93 - [c30]Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. WALCOM 2010: 102-112 - [i4]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location. CoRR abs/1004.0558 (2010) - [i3]Bhaswar B. Bhattacharya, Sandip Das:
Holes or Empty Pseudo-Triangles in Planar Point Sets. CoRR abs/1011.0517 (2010)
2000 – 2009
- 2009
- [j29]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Single facility collection depots location problem in the plane. Comput. Geom. 42(5): 403-418 (2009) - [j28]Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy:
Constrained minimum enclosing circle with center on a query line segment. Comput. Geom. 42(6-7): 632-638 (2009) - [j27]Debabrata Bardhan, Sasanka Roy, Sandip Das:
Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon. Int. J. Comput. Geom. Appl. 19(4): 357-370 (2009) - [j26]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest Color-Spanning Object Revisited. Int. J. Comput. Geom. Appl. 19(5): 457-478 (2009) - [j25]Sasanka Roy, Subhasis Bhattacharjee
A new fast heuristic for labeling points. Inf. Process. Lett. 109(10): 478-484 (2009) - [j24]Chandan Saha, Sandip Das:
Covering a set of points in a plane using two parallel rectangles. Inf. Process. Lett. 109(16): 907-912 (2009) - [j23]Pritha Banerjee
FPGA placement using space-filling curves: Theory meets practice. ACM Trans. Embed. Comput. Syst. 9(2): 12:1-12:23 (2009) - [e1]Sandip Das, Ryuhei Uehara:
WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5431, Springer 2009, ISBN 978-3-642-00201-4 [contents] - [i2]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
On Finding Non-dominated Points using Compact Voronoi Diagrams. CoRR abs/0909.0814 (2009) - 2008
- [j22]Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy:
Variations of Base-Station Placement Problem on the Boundary of a Convex Region. Int. J. Found. Comput. Sci. 19(2): 405-427 (2008) - [j21]Arindam Karmakar, Sasanka Roy, Sandip Das:
Fast computation of smallest enclosing circle with center on a query line segment. Inf. Process. Lett. 108(6): 343-346 (2008) - [j20]Sasanka Roy, Debabrata Bardhan, Sandip Das:
Base station placement on boundary of a convex polygon. J. Parallel Distributed Comput. 68(2): 265-273 (2008) - [c29]Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das:
Maximal Covering by Two Isothetic Unit Squares. CCCG 2008 - [c28]Arindam Karmakar, Sasanka Roy, Sandip Das:
Guarding Exterior Region of a Simple Polygon. WALCOM 2008: 100-110 - [i1]Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation Algorithms for Shortest Descending Paths in Terrains. CoRR abs/0805.1401 (2008) - 2007
- [j19]Sasanka Roy, Sandip Das, Subhas C. Nandy:
Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007) - [j18]Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. Inf. Process. Lett. 102(4): 163-168 (2007) - [c27]Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi:
Computing a planar widest empty alpha-siphon in o(n3) time. CCCG 2007: 33-36 - [c26]Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das:
Covering Points by Isothetic Unit Squares. CCCG 2007: 169-172 - [c25]Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari:
Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192 - [c24]Arindam Karmakar, Sasanka Roy, Sandip Das:
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. CCCG 2007: 273-276 - [c23]Chandan Saha, Sandip Das:
Covering a Set of Points in a Plane Using Two Parallel Rectangles. ICCTA 2007: 214-218 - [c22]Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy:
Base Station Placement Problem on the Boundary of a Convex Region. WALCOM 2007: 151-152 - 2006
- [j17]Malay K. Sen, P. Talukdar, Sandip Das:
Chronological orderings of interval digraphs. Discret. Math. 306(14): 1601-1609 (2006) - [j16]Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha:
Efficient algorithm for placing a given number of base stations to cover a convex region. J. Parallel Distributed Comput. 66(11): 1353-1358 (2006) - [j15]Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
Simple algorithms for partial point set pattern matching under rigid motion. Pattern Recognit. 39(9): 1662-1671 (2006) - [j14]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Range assignment for energy efficient broadcasting in linear radio networks. Theor. Comput. Sci. 352(1-3): 332-341 (2006) - [c21]Debabrata Bardhan, Sasanka Roy, Sandip Das:
Optimal Guard Placement Problem Under L-Visibility. ICCSA (1) 2006: 10-19 - [c20]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759 - [c19]Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy:
Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776 - 2005
- [j13]Satyaki Mukherjee, Sandip Das:
Moving Griffith crack in an orthotropic strip with punches at boundary faces. Int. J. Math. Math. Sci. 2005(19): 3157-3167 (2005) - [j12]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest k-point enclosing rectangle and square of arbitrary orientation. Inf. Process. Lett. 94(6): 259-266 (2005) - [c18]Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Collection depot location problem in the plane. CCCG 2005: 76-79 - [c17]Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy:
A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158 - [c16]Pritha Banerjee
Fast FPGA Placement using Space-filling Curve. FPL 2005: 415-420 - [c15]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. ICCSA (1) 2005: 827-837 - [c14]Sasanka Roy, Debabrata Bardhan, Sandip Das:
Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. ICDCIT 2005: 105-116 - [c13]Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha:
Placing a Given Number of Base Stations to Cover a Convex Region. IWDC 2005: 57-62 - [c12]Sasanka Roy, Sandip Das, Subhas C. Nandy:
Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292 - 2004
- [j11]Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. Comput. Geom. 29(3): 163-175 (2004) - [j10]Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Optimal algorithm for a special point-labeling problem. Inf. Process. Lett. 89(2): 91-98 (2004) - [j9]Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya:
Manhattan-diagonal routing in channels and switchboxes. ACM Trans. Design Autom. Electr. Syst. 9(1): 75-104 (2004) - [c11]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119 - [c10]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC 2004: 420-429 - [c9]Sasanka Roy, Sandip Das, Subhas C. Nandy:
A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. ICCSA (3) 2004: 42-52 - 2003
- [j8]Sandip Das, P. Talukdar, Malay K. Sen:
Homogeneously Representable Interval Bigraphs. Electron. Notes Discret. Math. 15: 75-78 (2003) - [j7]Malay K. Sen, P. Talukdar, Sandip Das:
Chronological Orderings of Interval Digraph. Electron. Notes Discret. Math. 15: 182-185 (2003) - [j6]Jeet Chaudhuri, Subhas C. Nandy, Sandip Das:
Largest empty rectangle among a point set. J. Algorithms 46(1): 54-78 (2003) - [j5]Subhas C. Nandy, Sandip Das, Partha P. Goswami:
An efficient k nearest neighbors searching algorithm for a query line. Theor. Comput. Sci. 299(1-3): 273-288 (2003) - [c8]Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. CIAC 2003: 36-45 - 2002
- [c7]Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. SWAT 2002: 69-79 - [c6]Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120 - 2000
- [j4]Susanta Chakrabarti, Sandip Das, Debesh Kumar Das, Bhargab B. Bhattacharya:
Synthesis of symmetric functions for path-delay fault testability. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(9): 1076-1081 (2000)
1990 – 1999
- 1999
- [c5]Susanta Chakraborty, Sandip Das, Debesh K. Das, Bhargab B. Bhattacharya:
Synthesis of Symmetric Functions for Path-Delay Fault Testability. VLSI Design 1999: 512-517 - [c4]Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
High Performance MCM Routing: A New Approach. VLSI Design 1999: 564-569 - 1998
- [c3]Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya:
Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model. VLSI Design 1998: 65- - 1996
- [c2]Sandip Das, Bhargab B. Bhattacharya:
Channel routing in Manhattan-diagonal model. VLSI Design 1996: 43-48 - 1993
- [j3]Sandip Das, Malay K. Sen:
An interval digraph in relation to its associated bipartite graph. Discret. Math. 122(1-3): 113-136 (1993) - [c1]Sandip Das, Bhargab B. Bhattacharya:
Via Minimization in Channel Routing by Layout Modification. VLSI Design 1993: 109-110
1980 – 1989
- 1989
- [j2]Sandip Das, Malay K. Sen, A. B. Roy, Douglas B. West:
Interval digraphs: An analogue of interval graphs. J. Graph Theory 13(2): 189-202 (1989) - [j1]Malay K. Sen, Sandip Das, Douglas B. West:
Circular-arc digraphs: A characterization. J. Graph Theory 13(5): 581-592 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: