Arindam Kumar Das

Orcid: 0000-0001-6605-2258

According to our database1, Arindam Kumar Das authored at least 20 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Rolling Horizon Restoration Framework for Post-disaster Restoration of Electrical Distribution Networks.
CoRR, 2024

2020
Scheduling Post-disaster Repairs in Electricity Distribution Networks with Uncertain Repair Times.
SIGMETRICS Perform. Evaluation Rev., 2020

2019
Post-disaster Repair Scheduling in Partially Automated Electricity Distribution Networks.
CoRR, 2019

2007
Analysis of the contention access period of IEEE 802.15.4 MAC.
ACM Trans. Sens. Networks, 2007

Analysis of the Contention Access Phase of a Reservation MAC Protocol for Wide-Area Data Intensive Sensor Networks.
Proceedings of the Global Communications Conference, 2007

2006
Distributed Linear Parameter Estimation in Sensor Networks based on Laplacian Dynamics Consensus Algorithm.
Proceedings of the Third Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, 2006

Static Channel Assignment in Multi-radio Multi-Channel 802.11 Wireless Mesh Networks: Issues, Metrics and Algorithms.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
The minimum power broadcast problem in wireless networks: a simulated annealing approach.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2005

An ant colony system approach for solving the at-least version of the generalized minimum spanning tree problem.
Proceedings of the 2005 IEEE Swarm Intelligence Symposium, 2005

Optimization models for fixed channel assignment in wireless mesh networks with multiple radios.
Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005

Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

K-node connected power efficient topologies in wireless networks: a semidefinite programming approach.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

Agreement in presence of noise: pseudogradients on random geometric networks.
Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

Models and Algorithms for the MPSCP.
Proceedings of the Handbook on Theoretical and Algorithmic Aspects of Sensor, 2005

2004
Optimization methods for minimum power multicasting in wireless networks with sectored antennas.
Proceedings of the 2004 IEEE Wireless Communications and Networking Conference , 2004

Optimization methods for minimum power bidirectional topology construction in wireless networks with sectored antennas.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

2003
Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

r-shrink: a heuristic for improving minimum power broadcast trees in wireless networks.
Proceedings of the Global Telecommunications Conference, 2003

MDLT: a polynomial time optimal algorithm for maximization of time-to-first- failure in energy constrained wireless broadcast networks.
Proceedings of the Global Telecommunications Conference, 2003

2002
Minimum power broadcast trees for wireless networks: optimizing using the viability lemma.
Proceedings of the 2002 International Symposium on Circuits and Systems, 2002


  Loading...