Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Field
-
The vacancy is within the group of Associate Prof. Dr. Anna Salvati at the Department of Nanomedicine Drug Targeting of the Groningen Research Institute of Pharmacy (GRIP), Faculty of Science and
-
design up to phased-array implementations (3 vacancies) With its partners, the University of Twente founded POLARIS, a programme running under the Dutch National Growth Fund (NGF). It realises
-
northern Sweden create enormous opportunities and complex challenges. For Umeå University, conducting research about – and in the middle of – a society in transition is key. We also take pride in delivering
-
processing approach based on flow patterning to make meter scale LCEs of complex shapes and actuation modes. ALCEMIST builds on a tight synergistic collaboration between the Experimental Soft Matter Physics
-
, remote sensing observations, and prediction and valuation of forest functions, providing a holistic view on forests as complex systems. See the project website to find out more about the FORFUS doctoral
-
northern Sweden create enormous opportunities and complex challenges. For Umeå University, conducting research about – and in the middle of – a society in transition is key. We also take pride in delivering
-
Engineering, Operations Research, Civil Engineering, Computer Science, Data Science or a related field, from a university/department with a strong international research reputation Strong mathematical and
-
applications as PhD Student Position (f/m/d) (Ref. 25/11) in the Leibniz Junior Research Group “Probabilistic Methods for Dynamic Communication Networks“ (Head: Prof. Dr. B. Jahnel) starting as soon as possible
-
Sustainable Decision Making (Prof. Dr. Clemens Thielen), which is located at the TUM Campus Straubing for Biotechnology and Sustainability (TUMCS) and affiliated with the Department of Mathematics. The expected
-
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