Bevan Das
Impact in
-
- Mobile Ad Hoc Networks
- Energy Efficient Wireless Sensor Networks
- Wireless Networks and Protocols
- Security in Wireless Sensor Networks
- Distributed systems and fault tolerance
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Mobile Ad Hoc Networks 4
-
- Complexity and Algorithms in Graphs 1
- Co-authors
- Vaduvur Bharghavan (4 shared papers)Raghupathy Sivakumar (1 shared paper)Michael C. Loui (1 shared paper)
- Journals
- Cluster Computing (1 paper)Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) (1 paper)International Conference on Communications (1 paper)Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications (1 paper)Proceedings/Proceedings - International Conference on Computer Communications and Networks (1 paper)
- Partner nations
- United States
In The Last Decade
Bevan Das
5 papers receiving 878 citations
Bevan Das's Hit Papers
Peers
Comparison fields: 5 of 19
- Computer Networks and Communications 849
- Computational Theory and Mathematics 132
- Computer Graphics and Computer-Aided Design 7
- Discrete Mathematics and Combinatorics 4
- Electrical and Electronic Engineering 34
Countries citing papers authored by Bevan Das
This map shows the geographic impact of Bevan 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 Bevan Das with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bevan Das more than expected).
Fields of papers citing papers by Bevan Das
This network shows the impact of papers produced by Bevan 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 Bevan Das. The network helps show where Bevan Das may publish in the future.
Co-authors
The 3 scholars most cited alongside Bevan 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 | Routing in ad-hoc networks using minimum connected dominating sets Hit paper breakdown → | 2002 | 576 |
| 2 | 2002 | 248 | |
| 3 | 1998 | 79 | |
| 4 | 2002 | 48 | |
| 5 | Algorithms for All Single Deletions in a Minimum Spanning Tree, Simultaneously | 1995 | 1 |
About Bevan Das
Bevan Das is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Nuclear Energy and Engineering, Waste Management and Disposal and Infectious Diseases, having authored 5 papers that have together received 952 indexed citations. Recurring topics across this work include Mobile Ad Hoc Networks (4 papers) and Complexity and Algorithms in Graphs (1 paper). The work is most often cited by research in Computer Networks and Communications (849 citations), Computational Theory and Mathematics (132 citations), Computer Graphics and Computer-Aided Design (7 citations), Discrete Mathematics and Combinatorics (4 citations) and Electrical and Electronic Engineering (34 citations). Bevan Das has collaborated with scholars based in United States. Frequent co-authors include Vaduvur Bharghavan, Raghupathy Sivakumar and Michael C. Loui. Their work appears in journals such as Cluster Computing, Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign), International Conference on Communications, Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications and Proceedings/Proceedings - International Conference on Computer Communications and Networks.
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.