Sandip Das

810 total citations
71 papers, 289 citations indexed

About

Sandip Das is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Sandip Das has authored 71 papers receiving a total of 289 indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computer Graphics and Computer-Aided Design, 25 papers in Computational Theory and Mathematics and 24 papers in Computer Vision and Pattern Recognition. Recurrent topics in Sandip Das's work include Computational Geometry and Mesh Generation (46 papers), Advanced Graph Theory Research (23 papers) and Digital Image Processing Techniques (14 papers). Sandip Das is often cited by papers focused on Computational Geometry and Mesh Generation (46 papers), Advanced Graph Theory Research (23 papers) and Digital Image Processing Techniques (14 papers). Sandip Das collaborates with scholars based in India, Canada and United States. Sandip Das's co-authors include Subhas C. Nandy, Sasanka Roy, Bhaswar B. Bhattacharya, Gautam K. Das, Bhabani P. Sinha, Binay Bhattacharya, Arijit Bishnu, Sasthi C. Ghosh, Probal Chaudhuri and Bhargab B. Bhattacharya and has published in prestigious journals such as Pattern Recognition, Theoretical Computer Science and Journal of Parallel and Distributed Computing.

In The Last Decade

Sandip Das

61 papers receiving 273 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Sandip Das India	10	143	72	69	61	52	71	289
Sergei Bespamyatnikh Canada	11	164 1.1×	68 0.9×	85 1.2×	93 1.5×	37 0.7×	29	339
Paz Carmi Israel	9	128 0.9×	76 1.1×	44 0.6×	36 0.6×	38 0.7×	66	271
Y. F. Wu United States	8	211 1.5×	67 0.9×	118 1.7×	75 1.2×	54 1.0×	8	405
Inmaculada Ventura Spain	9	84 0.6×	17 0.2×	83 1.2×	69 1.1×	29 0.6×	26	234
Wolfgang Mulzer Germany	10	178 1.2×	96 1.3×	69 1.0×	108 1.8×	15 0.3×	56	286
Elmar Langetepe Germany	10	114 0.8×	25 0.3×	81 1.2×	37 0.6×	22 0.4×	34	230
Goos Kant Netherlands	11	324 2.3×	174 2.4×	194 2.8×	50 0.8×	48 0.9×	21	451
Jyh-Han Lin United States	7	31 0.2×	98 1.4×	48 0.7×	69 1.1×	88 1.7×	12	446
David Eppstein Chile	4	104 0.7×	145 2.0×	37 0.5×	26 0.4×	10 0.2×	5	311
Ignacio Araya Chile	10	26 0.2×	79 1.1×	16 0.2×	11 0.2×	121 2.3×	34	275

Countries citing papers authored by Sandip Das

Since Specialization

Citations

This map shows the geographic impact of Sandip Das's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sandip Das with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sandip Das more than expected).

Fields of papers citing papers by Sandip Das

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sandip Das. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sandip Das. The network helps show where Sandip Das may publish in the future.

Co-authorship network of co-authors of Sandip Das

This figure shows the co-authorship network connecting the top 25 collaborators of Sandip Das. A scholar is included among the top collaborators of Sandip Das based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Sandip Das. Sandip Das is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Das, Sandip, et al.. (2023). Cops and Robber on butterflies, grids, and AT-free graphs. Discrete Applied Mathematics. 345. 231–245.

Das, Sandip, et al.. (2023). Approximation algorithms for orthogonal line centers. Discrete Applied Mathematics. 338. 69–76. 1 indexed citations

Bhattacharya, Binay, Sandip Das, & Tsunehiko Kameda. (2017). Linear-time fitting of a k-step function. Discrete Applied Mathematics. 280. 43–52. 2 indexed citations

Das, Sandip, et al.. (2017). Optimal L(3,2,1)-labeling of triangular lattice. Discrete Applied Mathematics. 228. 32–40. 1 indexed citations

Das, Sandip, et al.. (2017). A lower bound technique for radio k-coloring. Discrete Mathematics. 340(5). 855–861. 16 indexed citations

Bhattacharya, Bhaswar B., et al.. (2015). Almost empty monochromatic triangles in planar point sets. Discrete Applied Mathematics. 210. 207–213. 1 indexed citations

Das, Sandip, et al.. (2015). On oriented relative clique number. Electronic Notes in Discrete Mathematics. 50. 95–101. 1 indexed citations

Bhattacharya, Bhaswar B., et al.. (2014). Minimum enclosing circle of a set of fixed points and a mobile point. Computational Geometry. 47(9). 891–898. 3 indexed citations

Bhattacharya, Bhaswar B., et al.. (2013). One-Round Discrete Voronoi Game in ℝ 2 in Presence of Existing Facilities.. Canadian Conference on Computational Geometry. 1 indexed citations

10.

Bhattacharya, Bhaswar B. & Sandip Das. (2013). On pseudo-convex partitions of a planar point set. Discrete Mathematics. 313(21). 2401–2408.

11.

Augustine, John, et al.. (2012). Localized geometric query problems. Computational Geometry. 46(3). 340–357. 5 indexed citations

12.

Mukherjee, Joydeep, et al.. (2012). Minimum-width rectangular annulus. Theoretical Computer Science. 508. 74–80. 3 indexed citations

13.

Das, Sandip, et al.. (2009). Approximation algorithms for shortest descending paths in terrains. Journal of Discrete Algorithms. 8(2). 214–230. 9 indexed citations

14.

Roy, Sasanka, et al.. (2009). Constrained minimum enclosing circle with center on a query line segment. Computational Geometry. 42(6-7). 632–638. 6 indexed citations

15.

Ranjan, Priya, et al.. (2008). Maximal Covering by Two Isothetic Unit Squares. Canadian Conference on Computational Geometry. 2 indexed citations

16.

Ben‐Moshe, Boaz, et al.. (2007). Computing a planar widest empty -siphon in o(n 3 ) time. Canadian Conference on Computational Geometry. 33–36. 1 indexed citations

17.

Roy, Sasanka, Sachin Lodha, Sandip Das, & Anil Maheshwari. (2007). Approximate shortest descent path on a terrain. Canadian Conference on Computational Geometry. 189–192. 1 indexed citations

18.

Das, Sandip, et al.. (2007). Covering Points by Isothetic Unit Squares.. Canadian Conference on Computational Geometry. 169–172. 3 indexed citations

19.

Roy, Sasanka, Sandip Das, & Subhas C. Nandy. (2006). Shortest monotone descent path problem in polyhedral terrain. Computational Geometry. 37(2). 115–133. 10 indexed citations

20.

Roy, Sasanka, et al.. (2005). A Fast Algorithm for Point Labeling Problem.. Canadian Conference on Computational Geometry. 155–158. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact