Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Field
-
outstanding research potential in all fields of Discrete Mathematics with emphasis on Structural Graph theory, Extremal Graph Theory, Combinatorial Optimization, Matroid Theory, and Algorithms. This appointment
-
problems. Ability to understand multiple mathematical concepts; read and interpret statistical data; construct charts and graphs; understand and configure complex budgets from $1M-$10M from various sources
-
National Aeronautics and Space Administration (NASA) | Greenbelt, Maryland | United States | 28 days ago
No. 2083, id.2294) and a research team at the University of Glasgow led by Leroy Cronin that utilizes graph theory to explore molecular complexity (Philosophical Transactions of the Royal Society A
-
, for their analysis and optimization, we use tools such as artificial intelligence/machine learning, graph theory and graph-signal processing, and convex/non-convex optimization. Furthermore, our activities
-
University of Warsaw: Faculty of Mathematics, Informatics and Mechanics | Poland | about 2 months ago
systems, cryptography, databases, distributed systems, game theory, graphs, knowledge representation, logic, machine learning, networks, operating systems, programming languages, protocols, security, social
-
University of Warsaw: Faculty of Mathematics, Informatics and Mechanics | Poland | about 2 months ago
systems, game theory, graphs, knowledge representation, logic, machine learning, networks, operating systems, programming languages, protocols, security, social choice, software engineering Deadline
-
for up to 24 months. Successful applicants should be in post by September 2026. About you Applicants will need a PhD degree in Mathematics or similar subject, and knowledge of probability theory, as
-
times of Markov chains, random graphs and trees, random matrix theory, stochastic and Lévy processes in infinite-dimensional spaces, free probability, random sphere packings in high dimensions. About the
-
theory and probabilistic methods, and it hopes to clarify how these two settings, hypergraphs and posets, connect through their shared saturation questions. Combinatorics and mathematics in Umeå
-
. This opening is in discrete mathematics, aligning with the research interests of Prof. Bernard Lidický and Prof. Shira Zerbib. This includes graph theory, discrete geometry, topological combinatorics, extremal