of September 2025 in Liverpool UK.
This year's addition spans topics including structural and algorithmic
graph theory, extremal combinatorics, plus logic and foundations of
computer science. In addition to invited talks there is a 4-hour
tutorial by Andrei Krokhin on Constraint Satisfaction Problems.
Date: 2-3 September 2024
Location: University of Liverpool, Ashton Building
Website: https://j-sylvester.github.io/LDMC25.html
Registration: https://forms.gle/sEdSRnYA5VwJn4B38
All are welcome and the event is free of charge, however registration is
required by 25th of August in order to arrange the coffee breaks and
dinner. For more details consult the website.
Invited speakers:
- Candida Bowtell (Birmingham)
- Linda Cook (Amsterdam)
- Jan Dreier (TU Wien)
- Maximilien Gadouleau (Durham)
- Andrei Krokhin (Durham)
- Karolina Okrasa (Oxford)
- Jakub Opršal (Birmingham)
- Sebastian Ordyniak (Leeds)
- Katherine Staden (Open)
- Standa Živný (Oxford)
The event is supported by
- Heilbronn Institute for Mathematical Research
- UKRI/EPSRC Additional Funding Programme for Mathematical Sciences
- School of Computer Science and Informatics, University of Liverpool
Best wishes,
John Sylvester, Linglong Yuan, & Viktor Zamaraev
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
