Sort by
Refine Your Search
-
Listed
-
Country
-
Employer
- DAAD
- CNRS
- Empa
- Leiden University
- Delft University of Technology (TU Delft)
- Delft University of Technology (TU Delft); 17 Oct ’25 published
- Eindhoven University of Technology (TU/e); yesterday published
- Leibniz
- Leiden University; Leiden
- Leipzig University •
- Monash University
- Nature Careers
- Roma Tre University
- Technical University of Munich
- Umeå University
- Umeå universitet
- University College Dublin
- University of Birmingham;
- University of Southern Denmark
- University of Warwick
- WIAS Berlin
- 11 more »
- « less
-
Field
-
and interdisciplinary data integration develop new AI-based methods, tools, scripts, ontologies and a knowledge graph based on RTG research results and relevant literature provide methodological support
-
the ANR. PhD student in Graph Signal Processing for the Characterization of Multipolar Electrograms of Persistent Atrial Fibrillation. Responsible for a significant proportion of brain strokes, atrial
-
these technologies can only read DNA fragments of limited length. We enable biological interpretation of these sequencing data sets by developing algorithms based on graph theory, discrete optimization and machine
-
Do you want to contribute to surveillance of infectious pathogens using computer science and mathematics? Join the Delft Bioinformatics Lab and work on graph-based algorithms for microbial genomics
-
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
-
) have some exposure to (hyper)graph theory, network science, and/or reaction mechanism/CRN studies. Candidates who do not meet all of these criteria should not feel discouraged. If you are interested in
-
programs. Alternatively, Mathematics, Computer Science, Computer Engineering, Electrical Engineering, or a similar field; Strong mathematical background: basic knowledge of graph theory and excellent
-
a similar field; Strong mathematical background: basic knowledge of graph theory and excellent background in linear algebra, finite fields and rings; Strong background in digital hardware design and
-
, or a similar field; Strong mathematical background: basic knowledge of graph theory and excellent background in linear algebra, finite fields and rings; Strong background in digital hardware design 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