Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Field
-
synthesis, and cellulose‑processing enzyme design. In each of these, the underlying challenges are hard computational problems, such as combinatorial optimization, sampling, and molecular simulation
-
peptidomics at Lund University. The duties include: Planning and conducting experiments. Developing and optimizing methods for sample preparation, peptide enrichment, and fractionation. Performing LC-MS/MS
-
assignment of a research grant, with 1 position, under the project “Distance-based search strategies in combinatorial optimisation”. Where to apply Website https://www.apply.uc.pt/ Requirements Research
-
assignment of a research grant, with 1 position(s), under the project with the title “Multiple neighbourhood exploration in combinatorial optimisation”. Where to apply Website https://www.apply.uc.pt
-
27 Sep 2026 Job Information Organisation/Company Delft University of Technology (TU Delft) Research Field Mathematics » Combinatorial analysis Mathematics » Discrete mathematics Researcher Profile
-
an asset include: • Experience in gas adsorption for storage/separation applications; • Knowledge of high-throughput combinatorial synthesis. Website for additional job details https://emploi.cnrs.fr/Offres
-
specialized domains, such as Tabular Foundation Models. The core principle of these neural network models is that they are optimized for a specific form of data; in the case of tabular data, for instance
-
-dependent uncertainty, convex optimization, and combinatorial optimization. The postdoctoral researcher will have the opportunity to develop new mathematical models, reformulation techniques, and algorithms
-
education institution will be considered an asset, ability to teach, or to quickly prepare to teach, courses related to discrete mathematics, combinatorial optimization, fundamentals of programming
-
Foundation, and the state of Hessen. Further collaboration opportunities at the Department of Mathematics of TU Darmstadt include: • Yann Disser (combinatorial optimization), • Kord Eickmeyer (structural graph