Sandip Das
-
- Computational Geometry and Mesh Generation 46
- Signal Processing top 10%
- Data Management and Algorithms 13
-
- Advanced Graph Theory Research 23
- Graph Labeling and Dimension Problems 12
- Complexity and Algorithms in Graphs 8
-
- Digital Image Processing Techniques 14
- Robotic Path Planning Algorithms 8
-
- Optimization and Search Problems 9
- Co-authors
- Subhas C. NandySasanka RoyBhaswar B. BhattacharyaGautam K. DasBhabani P. SinhaBinay BhattacharyaArijit BishnuSasthi C. Ghosh
- Cited by
- Computer Graphics and Computer-Aided DesignSignal ProcessingIndustrial and Manufacturing Engineering
- Journals
- Pattern Recognition (1 paper)Theoretical Computer Science (7 papers)Journal of Parallel and Distributed Computing (2 papers)
- Partner nations
- IndiaCanadaUnited States
In The Last Decade
Sandip Das
61 papers receiving 273 citations
Peers
Comparison fields: 5 of 58
- Computer Graphics and Computer-Aided Design 143
- Signal Processing 61
- Industrial and Manufacturing Engineering 52
- Computational Theory and Mathematics 72
- Discrete Mathematics and Combinatorics 13
Countries citing papers authored by Sandip Das
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
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
The 25 scholars most cited alongside Sandip Das, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2023 | 0 | |
| 2 | 2023 | 1 | |
| 3 | 2017 | 2 | |
| 4 | 2017 | 1 | |
| 5 | 2017 | 16 | |
| 6 | 2015 | 1 | |
| 7 | 2015 | 1 | |
| 8 | 2014 | 3 | |
| 9 | One-Round Discrete Voronoi Game in ℝ 2 in Presence of Existing Facilities. | 2013 | 1 |
| 10 | 2013 | 0 | |
| 11 | 2012 | 5 | |
| 12 | 2012 | 3 | |
| 13 | 2009 | 9 | |
| 14 | 2009 | 6 | |
| 15 | Maximal Covering by Two Isothetic Unit Squares | 2008 | 2 |
| 16 | Computing a planar widest empty -siphon in o(n 3 ) time | 2007 | 1 |
| 17 | Approximate shortest descent path on a terrain | 2007 | 1 |
| 18 | Covering Points by Isothetic Unit Squares. | 2007 | 3 |
| 19 | 2006 | 10 | |
| 20 | A Fast Algorithm for Point Labeling Problem. | 2005 | 6 |
About Sandip Das
Sandip Das is a scholar working on Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics, having authored 71 papers that have together received 289 indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (46 papers), Advanced Graph Theory Research (23 papers), Digital Image Processing Techniques (14 papers), Data Management and Algorithms (13 papers), Graph Labeling and Dimension Problems (12 papers), Optimization and Search Problems (9 papers), Robotic Path Planning Algorithms (8 papers) and Complexity and Algorithms in Graphs (8 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (143 citations), Signal Processing (61 citations) and Industrial and Manufacturing Engineering (52 citations). Sandip Das has collaborated with scholars based in India, Canada and United States. Frequent 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. Their work appears in journals such as Pattern Recognition, Theoretical Computer Science and Journal of Parallel and Distributed Computing.
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.