Sort by
Refine Your Search
-
interfaces. Topics of interest include: Planar and geometric graph algorithms Approximation and parameterized algorithms Clustering, embeddings, and structural graph theory Computational complexity and
-
. This research direction requires advancements in modern probabilistic tools, including spatial random graphs, random walks, and Markov chains. The position is hosted in the Leibniz Junior Research Group
-
. This research direction requires advancements in modern probabilistic tools, including spatial random graphs, random walks, and Markov chains. The position is hosted in the Leibniz Junior Research Group
-
to model and analyse the intrinsic complexities of these systems. This research direction requires advancements in modern probabilistic tools, including spatial random graphs, random walks, and Markov chains
-
of biomolecules which can only be successfully tackled by employing a variety of different theoretical methods. In this respect, this joint graduate college brings together the expertise in analytical theory from