Recherche
Petri nets constitute a well-studied model to verify and study concurrent systems, among others, and computing the coverability set is one of the most
/Exposé /Talk/ Recent developments in the intersection of structural graph theory, parameterized algorithms, and finite model theory have provided
/Exposé en anglais/Talk in english/ We consider an edge version of the famous (and hard) degree-diameter problem, where one is wondering about the
Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many
Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on
We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that
Petra Wolf, «Kernelizing Temporal Exploration Problems» Abstract: We study the kernelization of exploration problems on temporal graphs. A temporal