Dario Ascari (University of the Basque Country)
Maria Ana Barbosa (University of Porto)
Ruiwen Dong (University of Oxford)
Damian Osajda (University of Wroclaw)
Kaitlin Ragosta (University of the Basque Country)
Sarah Rees (University of Newcastle)
____________________________________________________________________
This session focuses on the interplay between Geometric and Algorithmic Group Theory. It aims to explore recent developments concerning the relationship between the geometry of groups and their algorithmic behaviour, with particular emphasis on the solvability and complexity of decision problems. With its classical origins in the Word, Conjugacy, and Isomorphism Problems, Algorithmic Group Theory now addresses a broad range of computational questions about groups. Frequently studied topics include equations over groups, subgroups, homomorphisms, and dynamical phenomena. The scope of the session includes both theoretical developments and computational methods, ranging from the study of geometric constructions and combinatorial techniques to the development of practical algorithms for investigating infinite groups. This combination of geometric, combinatorial, and computational approaches often provides deeper insight into the structure of groups and yields purely algebraic results. Connections with related areas of geometry, group dynamics, formal language theory, and combinatorics will also be explored. By bringing together these perspectives, the session aims to reflect the vitality of current research in the field and to provide a platform for presenting new results on the geometric and algorithmic aspects of discrete groups.