Sort by
Refine Your Search
-
Listed
-
Country
-
Employer
- Empa
- Leiden University
- Umeå University
- CNRS
- DAAD
- Delft University of Technology (TU Delft)
- Delft University of Technology (TU Delft); 17 Oct ’25 published
- Leibniz
- Leiden University; Leiden
- Leipzig University •
- Monash University
- Roma Tre University
- Technical University of Munich
- University College Dublin
- University of Birmingham;
- University of Southern Denmark
- University of Warwick
- WIAS Berlin
- 8 more »
- « less
-
Field
-
department is available at: https://www.umu.se/en/department-of-computing-science/ Project description Graph transformation is a well-established theory that studies computational methods to transform graphs
-
including: * Algorithmic game theory * Approximation algorithms * Automata and formal languages * Combinatorics and graph algorithms * Computational complexity * Logic and games * Online and dynamic
-
the use of hierarchical graph neural networks for modeling multi-scale urban energy systems. By combining advances in Physics-Informed Machine Learning (PIML) and Graph Neural Networks (GNNs) with real
-
probability, allow for the application of tools from probability theory to combinatorial problems and motivate the study of the typical properties of various combinatorial models, such as the Erdős–Rényi random
-
the use of hierarchical graph neural networks for modeling multi-scale urban energy systems. By combining advances in Physics-Informed Machine Learning (PIML) and Graph Neural Networks (GNNs) with real
-
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
-
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
-
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