معرفی
Gerold Jäger is an Associate Professor at Umeå University's Department of Mathematics and Mathematical Statistics. His research focuses on computational combinatorics, graph theory, and combinatorial optimization.
Key work includes tolerance analysis in optimization, metric dimension of graphs, enumeration of combinatorial designs (e.g., Latin rectangles), and game-theoretic strategies for Mastermind variants. Recent publications address set tolerances, super domination in graphs, and row-column designs.
He leads research in discrete mathematics, contributing to algorithms for sensitivity analysis and robust optimization in combinatorial problems.
No awards, students, or lab affiliations are mentioned.
۰مقاله منتشرشده
