Recherche
Petra Wolf, «Kernelizing Temporal Exploration Problems» Abstract: We study the kernelization of exploration problems on temporal graphs. A temporal
/Exposé en anglais/Talk in english/ In this presentation, we will talk about connecting colored points via noncrossing structures. Several problems
/Exposé en anglais/Talk in english/ We study geometric variations of the discriminating code problem. In the discrete version of the problem, a finite
Ultrametrics are representations of data that emphasize hierarchical properties and are widely used in data visualization and clustering. In the
/Exposé en anglais/Talk in english/ We study geometric variations of the discriminating code problem. In the discrete version of the problem, a finite