Student Lessons' Schedule

Please, select a paper that does not appear here.

1.1. The Routing problem i.e. the minimum cost shortest path

• [WLC16] Simone Camagna;

1.2. The layout of interconnection networks i.e. the orthogonal grid graph drawing

1.3. The problem of infecting a network with a worm i.e. the minimum vertex cover problem

2.1. The frequency assignment problem i.e. a graph coloring problem

2.2. The minimum energy broadcast problem i.e. the minimum spanning tree problem

3.1. The data mule scheduling problem i.e. the traveling salesman problem

• [Cal15] Yunus Mert Aliskan;

3.2. The data Collection in ad-hoc networks i.e. the connected Dominating Set Problem

4.1. The centralized deployment of a mobile sensor network i.e. the minimum cost perfect matching in bipartite graphs

• [Fal10] Anja Stanic;
• [HZ14] Laurine Bonin;

4.2. Self-deployment of a mobile sensor network i.e. the Voronoi Diagram

• [Kal14] Giovanni Colasuonno;

4.3. Monitoring by UAVs i.e. what?

--

Schedule of the Previous Years