Ruth Hoffmann

Dr. Ruth Hoffmann is a Lecturer at the University of St Andrews, affiliated with the School of Computer Science and the St Andrews GAP Centre. Her research focuses on computational combinatorics, graph theory, permutation classes, computational group theory, and formal verification. She has contributed to improving combinatorial search algorithms for graph and group problems, including subgraph isomorphism and stabiliser chains.

Research Interests

• Engineering efficient algorithms for graph and group problems
• Constraint programming applications in permutation enumeration and puzzle solving
• Formal verification of autonomous systems and memory models
• Combinatorial search optimization and algorithm design

Teaching

• Current modules: Foundations of Computation (CS2001), Programming with Data (CS1003)
• Past roles: Overseer of BSc Data Science Graduate Apprenticeship and instructor for Computational Complexity (CS3052) and Information Security Management (IS5104)

Recent Research Trends

Dr. Hoffmann’s recent work emphasizes constraint modeling innovations, including permutation enumeration frameworks and automated puzzle-solving explanations. Her publications address formal verification challenges in autonomous systems and memory consistency protocols, alongside combinatorial search advancements for graph problems. Collaborative projects include EPSRC-funded efforts to enhance group search techniques using graph-based methods.

Grants & Projects

• Enhancing Group Search with Graph Techniques (EPSRC, 2023–2025)
• C3+: Constraint-based Collaboration (EPSRC, 2018)

Labs & Teams

Active contributor to the St Andrews GAP Centre, focusing on computational algebra and combinatorics.