Sort by
Refine Your Search
-
Inria, the French national research institute for the digital sciences | Villers les Nancy, Lorraine | France | 10 days ago
: the even bicolor Wang tilesets. Preprint, 2025 [3] Hoyrup. Local generation of languages. Preprint, 2026. [4] Hoyrup. When a graph generates its own colorings. Preprint, 2026. Where to apply Website https
-
mathematics (or closely related discipline) is a requirement by the start of the position. Enthusiasm for topics in probabilistic and extremal combinatorics and/or structural graph theory. Prior experience in
-
calculus, gradients, stochastic optimisation, conditioning. Discrete mathematics and graph theory. Typed and attributed graphs and hypergraphs, subgraph matching and isomorphism, graph rewriting
-
://dimag.ibs.re.kr/ Successful candidates for the research fellowship positions will be new or recent PhDs with outstanding research potential in all fields of Discrete Mathematics with emphasis on Structural Graph
-
into insight). To tackle this, the research blends ideas from knowledge graphs, stream processing, database theory, logic, edge and cloud computing, and Artificial Intelligence into a single coherent framework
-
University of Darmstadt seeks candidates at the earliest possible date for two Professorships for Algorithmic Graph Theory and Logic. The positions are limited to a period of six years and come without
-
. During the PhD, you will work on topics at the intersection of probabilistic and extremal combinatorics, structural graph theory and algorithms. We study problems on discrete structures such as graphs
-
and Mathematical Statistics at Umeå University (Sweden) is offering a postdoctoral scholarship within the project “Bounds for Pancake Sorting and Analysis of the Pancake Graph”. The scholarship is tax
-
research in discrete mathematics, deliver outstanding teaching, and support the development of undergraduate and postgraduate students. Research areas of interest include combinatorics, graph theory, design
-
discrete-mathematical theory with mechanistic and interpretable models of molecular fragmentation processes. Strong programming skills in Python-based scientific computing, including NetworkX-style graph