Sort by
Refine Your Search
-
through innovative methods, theory and critical analysis. The fellowship period is 3 years. Starting date as soon as possible and upon individual agreement. An extension of the appointment by up to twelve
-
of early career researchers, supervised by senior experts, collaborating across disciplines to tackle fundamental challenges through innovative methods, theory and critical analysis. The fellowship
-
one or more of the following areas: graph algorithms, parameterized complexity, approximation algorithms, extremal combinatorics, structural graph theory, as well as related fields. Qualifications and
-
for excellent scientists with background and experience in one or more of the following areas: graph algorithms, parameterized complexity, approximation algorithms, extremal combinatorics, structural graph theory
-
degree is awarded within 4 weeks after the application deadline. A solid background in one or more of the following fields are required: Decision theory or statistics AI and machine-learning techniques