ProgrammaLezioniDegliStudenti < Algoreti

<a href="WebHome1011" target="_self" title="Home">Home</a>

---+++ <font color="blue" size="+3">Student Lessons' Schedule A.y. 2025-2026</font>



Please select a paper that does not appear here. The schedule will be ready soon.


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

   * *December 1:* [WLC16] Simone Camagna;
   * *December 1:* [Lal16] Andrea Puddu;

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

   * *December 3:* [Cal14] Gianluca Como
   * *December 3:* [Fal07] Federica Sardo

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

   * *December 3:* [N08] Mattia Venuto
   * *December 3:* [M95] Maximilian Alex


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

   * *December 3:* [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

   * *December 10:* [Fal10] Anja Stanic;
   * *December 10:* [HZ14] Laurine Bonin;
   * *December 10:* [HV05] LéoSarcy
   * *December 10:* [Dal10] Victor Lopata

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

   * *December 10:* [Kal14] Giovanni Colasuonno;

4.3. Monitoring by UAVs, i.e., what?

   * *December 10:* [CB05] Daniele Muscillo

--

[[SchedulePreviousYears][Schedule of the Previous Years]]
---+ 

-- %USERSIG{TizianaCalamoneri - 2017-10-25}%

<a href="WebHome1011" target="_self" title="Home">Home</a>

%COMMENT%

   * [[%ATTACHURL%/Prata_MIN-3-AC.pdf][Prata_MIN-3-AC.pdf]]: Prata_MIN-3-AC.pdf
This topic: Algoreti > WebHome1011 > ProgrammaLezioniDegliStudenti
Topic revision: r100 - 2025-12-01 - TizianaCalamoneri