Professor Henry Foerster joined JCU in 2026. In his research, he focuses on foundational questions regarding the automatic generation of graph embeddings and network visualizations. More precisely, he interested in several aspects: • Theoretic models that describe how we want to embed graphs and that can be analyzed to find theoretically optimal bounds for established quality metrics or time and memory constraints. • Efficient embedding algorithms that can be either exact provably optimal algorithms or efficient heuristic solutions. • User studies that can be used to evaluate the performance of models and algorithms both for human users and generative AI. These three key aspects lay the theoretical foundations for practical graph embedding applications and are co-dependent as new results in one of them often lead to curious follow-up questions in the other two.