Sort by
Refine Your Search
-
Listed
-
Country
-
Employer
- ; The University of Manchester
- DAAD
- Leibniz
- Leipzig University •
- Molde University College
- Monash University
- Roma Tre University
- Technical University of Munich
- The University of Auckland
- Umeå University
- Universiteit van Amsterdam
- University of Antwerp
- University of Copenhagen
- University of Luxembourg
- VIB
- WIAS Berlin
- 6 more »
- « less
-
Field
-
PhD Position in Theoretical Algorithms or Graph and Network Visualization - Promotionsstelle (m/w/d)
interfaces. Topics of interest include: Planar and geometric graph algorithms Approximation and parameterized algorithms Clustering, embeddings, and structural graph theory Computational complexity and
-
effects. This may include the use of partially identified estimands. An understanding of basic causal inference and graph theory is essential. Principal supervisor Professor Erin Gabriel Start
-
Description Join us in seeking exciting new developments using graph theory in nearest neighbor models for active matter! Do you enjoy working with graph theory, and seeing how functions on graphs can inform
-
use tools such as artificial intelligence/machine learning, graph theory and graph-signal processing, and convex/non-convex optimization. Furthermore, our activities are experimentally driven 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
-
Profile: We seek someone with strong mathematical maturity in control theory, dynamical systems, or applied mathematics. Familiarity with nonlinear systems analysis, graph theory, and formal methods (e.g
-
, specifically modelling the complex interrelations among infrastructure, human operators, and organizational structures using dynamic graphs, system dynamics, Agent Based Models, and discrete event simulations
-
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
-
, tasks have a continuous evolution, and the precedence graph becomes dynamic. There is an initial method proposed in the literature, where a static model is proposed, introducing two states of products