STAFF
— Tom Grant MSc BSc
Research Associate
|
G14 Ken Edwards Building
School of Computing and Mathematical Sciences,
University of Leicester,
University Road,
Leicester,
LE1 7RH.
T: +44 (0)116 252 2280
E: tg53 at mcs le ac uk
|
- Algorithmic Graph Theory
- Approximation Algorithms for Combinatorial Optimisation Problems
- Online Algorithms
- Thomas Erlebach, Tom Grant and Frank Kammer.
Maximising Lifetime for Fault-Tolerant Target Coverage in Sensor Networks. (Extended Abstract) DOI: 10.1145/1989493.1989521
In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallel Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011. pp. 187-196, ACM, 2011.
- Thomas Erlebach and Tom Grant.
Scheduling Multicast Transmissions under SINR Constraints. DOI: 10.1007/978-3-642-16988-5_5
In Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers, LNCS volume 6451. pp. 47-61, Springer, 2010.
- Thomas Erlebach, Tom Grant and Frank Kammer.
Maximising Lifetime for Fault-Tolerant Target Coverage in Sensor Networks.
In Sustainable Computing: Informatics and Systems, volume 1, issue 3. pp. 213–225, 2011.
.
|
