default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArindam Kumar Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i2]Ran Wei, Arindam Kumar Das, Payman Arabshahi, Daniel S. Kirschen:
A Rolling Horizon Restoration Framework for Post-disaster Restoration of Electrical Distribution Networks. CoRR abs/2404.03197 (2024)- 2020
- [j2]Yushi Tan, Arindam Kumar Das
, Mareldi Ahumada-Paras, Payman Arabshahi, Daniel S. Kirschen:
Scheduling Post-disaster Repairs in Electricity Distribution Networks with Uncertain Repair Times. SIGMETRICS Perform. Evaluation Rev. 47(4): 21-24 (2020)
2010 – 2019
- 2019
- [i1]Yushi Tan, Arindam Kumar Das, Payman Arabshahi, Daniel S. Kirschen:
Post-disaster Repair Scheduling in Partially Automated Electricity Distribution Networks. CoRR abs/1906.06461 (2019)
2000 – 2009
- 2007
- [j1]Iyappan Ramachandran, Arindam Kumar Das, Sumit Roy:
Analysis of the contention access period of IEEE 802.15.4 MAC. ACM Trans. Sens. Networks 3(1): 4 (2007) - [c15]Arindam Kumar Das, Sumit Roy, Abhijit Mahalanobis:
Analysis of the Contention Access Phase of a Reservation MAC Protocol for Wide-Area Data Intensive Sensor Networks. GLOBECOM 2007: 626-630 - 2006
- [c14]Arindam Kumar Das, Rajiv Vijayakumar, Sumit Roy:
Static Channel Assignment in Multi-radio Multi-Channel 802.11 Wireless Mesh Networks: Issues, Metrics and Algorithms. GLOBECOM 2006 - [c13]Arindam Kumar Das, Mehran Mesbahi:
Distributed Linear Parameter Estimation in Sensor Networks based on Laplacian Dynamics Consensus Algorithm. SECON 2006: 440-449 - 2005
- [c12]Yuko Hatano, Arindam Kumar Das, Mehran Mesbahi:
Agreement in presence of noise: pseudogradients on random geometric networks. CDC/ECC 2005: 6382-6387 - [c11]Arindam Kumar Das, Mehran Mesbahi:
K-node connected power efficient topologies in wireless networks: a semidefinite programming approach. GLOBECOM 2005: 6 - [c10]Arindam Kumar Das, Robert J. Marks II, Payman Arabshahi, Andrew Gray:
Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas. INFOCOM 2005: 1782-1793 - [c9]Arindam Kumar Das, Hamed M. K. Alazemi, Rajiv Vijayakumar, Sumit Roy:
Optimization models for fixed channel assignment in wireless mesh networks with multiple radios. SECON 2005: 463-474 - [c8]Arindam Kumar Das, Payman Arabshahi, Andrew Gray:
An ant colony system approach for solving the at-least version of the generalized minimum spanning tree problem. SIS 2005: 60-67 - [c7]Roberto Montemanni, Luca Maria Gambardella, Arindam Kumar Das:
The minimum power broadcast problem in wireless networks: a simulated annealing approach. WCNC 2005: 2057-2062 - [p1]Roberto Montemanni, Luca Maria Gambardella, Arindam Kumar Das:
Models and Algorithms for the MPSCP. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks 2005: 133-146 - 2004
- [c6]Arindam Kumar Das, Robert Jackson Marks, Mohamed A. El-Sharkawi, Payman Arabshahi, Andrew Gray:
Optimization methods for minimum power bidirectional topology construction in wireless networks with sectored antennas. GLOBECOM 2004: 3962-3968 - [c5]Arindam Kumar Das, Robert Jackson Marks, Mohamed A. El-Sharkawi, Payman Arabshahi, Andrew Gray:
Optimization methods for minimum power multicasting in wireless networks with sectored antennas. WCNC 2004: 1299-1304 - 2003
- [c4]Arindam Kumar Das, Robert Jackson Marks, Mohamed A. El-Sharkawi, Payman Arabshahi, Andrew Gray:
MDLT: a polynomial time optimal algorithm for maximization of time-to-first- failure in energy constrained wireless broadcast networks. GLOBECOM 2003: 362-366 - [c3]Arindam Kumar Das, Robert Jackson Marks, Mohamed A. El-Sharkawi, Payman Arabshahi, Andrew Gray:
r-shrink: a heuristic for improving minimum power broadcast trees in wireless networks. GLOBECOM 2003: 523-527 - [c2]Arindam Kumar Das:
Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations. INFOCOM 2003: 1001-1010 - 2002
- [c1]Robert J. Marks II, Arindam Kumar Das, Mohamed A. El-Sharkawi, Payman Arabshahi, Andrew Gray:
Minimum power broadcast trees for wireless networks: optimizing using the viability lemma. ISCAS (1) 2002: 273-276
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 2025-01-09 13:09 CET 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:
