› An improved (strongly polynomial) combinatorial algorithm for the nucleolus in Convex Games - Giacomo Maggiorano, Université de Lausanne = University of Lausanne
09:30-09:50 (20min)
› Global One-sided Parabolic Approximations for MINLP - Adrian G¨oß, University of Technology Nuremberg (UTN)
09:50-10:10 (20min)
› Generalized list matrix partition problems from the viewpoint of graph width parameters - Flavia Bonomo, Universidad de Buenos Aires
17:00-18:00 (1h)
Chargement... 
Main lecture room
