17:15 | Michael Khachay and Katherine Neznakhina |
Polynomial time solvable subclass of the Generalized Traveling Salesman Problem on Grid Clusters |
17:40 | Daniel Khachay, Michael Khachay and Maria Poberiy |
Hitting Set Problem for Axis-Parallel Squares Intersecting a Straight Line is polynomially solvable for any fixed range of square sizes |
18:05 | Konstantin Kobylkin | Stabbing line segments with disks: complexity and approximation algorithms |