| Guilherme Dias da Fonseca |
Complexity Results on Untangling Red-Blue Matchings |
|---|---|
| David Mount |
Finding Relevant Points for Nearest-Neighbor Classification |
| Yan Gerard |
Efficient Algorithms for BattleShip |
| Nabil Mustafa |
Monotonic Subsequences: Three Open Problems |
| 10h-12h | Talk |
|---|---|
| Break | |
| 14h30-17h20 | Working in groups |
| Break | |
| 19h-20h | Open problems sessions |