The Combinatorics and Mathematics of Computer Science group at CRM covers a broad spectrum of research areas in discrete mathematics, theoretical computer science, and mathematical logic, including, but not limited to, structural graph theory, discrete geometry, enumerative and asymptotic combinatorics, probabilistic methods, additive combinatorics, extremal combinatorics, analysis of algorithms, computational complexity, proof theory, and finite model theory. This diverse mix of topics enables fruitful collaboration among group members and highlights the group’s interdisciplinary nature.

During tuition periods, the group holds regular weekly seminar meetings where both invited speakers and local researchers present their most recent work. These seminars are intended for mathematicians and graduate students in the area of influence of the city of Barcelona who have an interest in these topics, and aim to promote the exchange of ideas and to keep in touch with ongoing research advances in the field.