Lesson slides

Please download here the slides that will be projected during the lessons. If possible, do it BEFORE attending the lessons.

They are in an easy-reading style, especially useful for students with specific learning disabilities.

Remember: these slides are useful to follow the order of the topics, but studying only them is definitely not enough to take the exam.

Note: the files contain 2 slides per page. If you prefer another format, please let me know.

0. Introduction to the Course

1. Routing i.e. Shortest Path

2. Layout i.e. Orthogonal Graph Drawing

3. Worm detection/infection i.e. Vertex Cover

4. Frequency assignment i.e. L(h,k)-labeling

5. Min Broadcast i.e. Min Spanning Tree

6. Data Mule i.e. TSP

7. Data Collection i.e. Connected Dominating Set

8. Centralized sensor Deployment i.e. Min Weight Perfect Matching in Bipartite Graphs

9. Distributed sensor Deployment i.e. Voronoi Diagram

10. Monitoring by UAVs i.e. What? Some ongoing research problems

11. Other networks: Some ongoing problems