Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Employer
- University of Groningen
- University of Luxembourg
- Delft University of Technology (TU Delft)
- Umeå University
- ;
- ; University of Exeter
- Associação do Instituto Superior Técnico para a Investigação e Desenvolvimento _IST-ID
- Chalmers University of Technology
- ETH Zurich
- ETH Zürich
- IMT Atlantique
- Leiden University
- Leipzig University •
- Monash University
- Nature Careers
- SciLifeLab
- University of Antwerp
- University of Cambridge
- University of Southern Denmark
- VIB
- 10 more »
- « less
-
Field
-
We are offering a PhD position in the field of algorithmic graph theory. The position is a full-time employment with a competitive monthly salary and full social benefits for up to five years. You
-
Apply now The Mathematical Institute (MI) of Leiden University and the Leiden Institute of Advanced Computer Science (LIACS) are looking for a PhD Candidate in Random Graphs and Complex Networks
-
the context of algorithmic problems related to constraint satisfaction and graph homomorphism and isomorphism problems. It brings to bear significant new mathematical (algebraic and topological) methods
-
the context of algorithmic problems related to constraint satisfaction and graph homomorphism and isomorphism problems. It brings to bear significant new mathematical (algebraic and topological) methods
-
covers kinetic theory, non-local diffusion and dynamics on graphs. The precise research direction will be determined together with the successful candidate upon personal background and interests
-
previous experience with e-graphs, or is familiar with theory and algorithms used by, for example, proof assistants, term rewriting systems, optimizing compilers, program analysis tools, constraint solvers
-
, graph theory, satisfiability problems, discrete optimization. Strong interests in chemistry as well as proven competences in programming and ease with formal thinking are a necessity. This PhD project is
-
Theory, Queuing Theory, Age of Information), Network Calculus, Graph Theory, Convex and Non-convex Optimization, Approximation Algorithms. An excellent Master’s degree in Computer Science, Engineering
-
, graph theory, satisfiability problems, discrete optimization. Strong interests in chemistry as well as proven competences in programming and ease with formal thinking are a necessity. This PhD project is
-
) biological knowledge about GRNs from bioinformatics and system biology, (b) graph theory and topological data analysis for network modeling from mathematics, and (c) robust machine learning (ML) and GenAI from