Conférences - Théorie des graphes et combinatoire - Royaume-Uni

School of Computing Science, University of Glasgow

The PCC is an established conference organised for, and by, current research students in all areas of combinatorial and discrete mathematics, under the auspices of the British Combinatorial Committee. The PCC is mainly aimed at UK-based students, but is also open to those from abroad.

University of Leeds

International Centre for Mathematical Sciences, Edinburgh; UK

Andrew Ranicki and his theory of algebraic surgery played a central role in linking manifold theory, algebraic K-theory, and its close cousin L-theory. These areas have seen great developments and advances in the last decade from distinct research communities. This workshop will bring together mathematicians working on the topology of high-dimensional manifolds and their automorphisms with those working on the algebraic K-theory (and its cousins hermitian K-theory and L-theory) of rings and ring spectra, in order to share recent progress in these areas and kindle a fresh interaction between them.

Géométrie et topologie,    Algèbre

The Young Researchers in Combinatorics workshop is aimed at PhD students and early-career academics working in Extremal and Probabilistic Combinatorics and related fields. By building an environment without senior researchers, we hope the participants will feel free to contribute their ideas openly, thus preparing them to undertake their own research projects. The workshop consists mostly of working sessions in which participants collaborate on research problems, and a limited number of talks and lectures. We aim to host around 10 invited participants and about 25 PhD students for a week between 19 and 25 July 2020 at ICMS Edinburgh. Accommodation and refreshments are provided for all participants, as well as a conference dinner. A registration fee of 100GBP is payable by all non-invited participants. We expect to start accepting applications in October 2019.

University of Bath

Exact optimization methods, Approximation algorithms, Heuristics, metaheuristics, and hyperheuristics, Decomposition-based algorithms, Column generation, Valid inequalities, Computational complexity, Polyhedral analysis, Interior-point methods, Bilevel programming, Graph theory, Game theory, Applications