The informal research seminar of the ALGO and AGA groups. Talks last roughly 25 minutes, with five extra minutes allocated for discussion. Many presentations are focussed on recent conference presentations, or practice talks for upcoming conferences. New members are often asked to give an overview of their field of research. Talks given by invited speakers may take up to 45-60 minutes including questions.
To be kept up-to-date about noon seminar presentations, please subscribe to the algoseminar-l mailing list.
Time: Tuesday 12:45-13:15
|Feb 13||Tuesday||MF 13||Sudeshna Kolay|| |
In this talk, we explore the utility of the Veronese Mapping in obtaining upper bounds and/or lower bounds on kernelization algorithms in the field of Parameterized Complexity. In particular, we consider two problems: (i) Subset General Position, where the input is a set of n points and the optimization question is to find the largest subset of points that are in general position, for a fixed definition of general position; (ii) Hitting geometric sets, where the input is a geometric set system and the optimization question is to find the minimum sized subset of the universe that hits all objects of the set system. We study the parameterized decision versions of the problems under natural parameters, and in some cases design tight polynomial kernels. The highlight of this study is the use of Veronese mapping to extend the results for the above problems with respect to families of hyperplanes to results for the problems with respect to families of d-degree polynomials. Not only can this mapping be used to give upper bounds for kernelization algorithms, but sometimes also lower bounds, thereby providing tight kernelization algorithms for several families of problems in one go. This is joint work with Jean-Daniel Boissonnat, Kunal Dutta and Arijit Ghosh.
Time: Tuesday 12:45-13:15
|Jan 16||Tuesday||TBA||Kevin Verbeek||CANCELLED|
|Jan 30||Tuesday |
|MF 14||Robbert Mollevanger|| |
The field of modular robot self-reconfiguration is an exciting and relatively young one. It concerns the hardware for these kinds of robots and the software to make them autonomously reconfigure into different shapes. This talk will give an overview of the field and present current state-of-the-art technologies, mainly focusing on the algorithmic side of things.
|Jan 31||Wednesday |
|MF 15||Bart van der Vecht|| |
Amoebot is a recent model for self-organizing particle systems based on amoeba-like movement. This presentation focuses on research literature where this model has been used for the problem of shape formation. Different approaches to this problem will be presented, as well as common notions such as leader election, movement primitives and shape recovery.
|Feb 1||Thursday |
|MF 4||Marc Verhaegh||CANCELLED|