Dear Colleagues,
We have decided to hold the 2020 Moscow Conference on Combinatorics, Graphs Theory and Applications (MoCCA'20), originally scheduled for May 11-15 2020, ONLINE over two weeks:
May 31 - June 4, 2021 and
June 28 - July 2, 2021.
The coming week is the second week of the conference. It is mostly devoted to extremal combinatorics and discrete geometry. The schedule is now fixed. We hope to see many of you!
All the information regarding the up-to date schedule, Zoom links etc. can be found on the website http://mipt2020.combgeo.org/
The aim of the conference is to bring together experts in extremal and additive combinatorics, graph theory, random graphs and complex networks and optimization.
There will be a number of plenary talks, as well as invited mini-symposia talks.
WEEK 2 (June 28
-------------------------------
Plenary speakers include:
-------------------------------
- David Conlon (California Institute of Technology, USA)
- Janos Pach (Renyi Institute, Hungary and MIPT, Russia)
- Jane Gao (University of Waterloo, Canada)
--------------------------------------------------
Invited mini-symposia organizers include:
--------------------------------------------------
- Stefan Glock and Felix Joos (ETH Zurich, Switzerland and University of Heidelberg, Germany)
- Carla Groenland (Utrecht University, Netherlands)
- Zilin Jiang (Arizona State University, USA)
- Oleg Musin (University of Texas Rio Grande Valley, USA and MIPT, Russia)
- Alexandr Polyanskii (MIPT, Russia)
- Liana Yepremyan (LSE, UK)
----------------
Registration
----------------
Is not required, but you can register on the website in order to get updates.
---------------------------
Organizing committee
---------------------------
- Andrey Kupavskii (MIPT Moscow, CNRS France)
- Andrei M. Raigorodskii (MIPT Moscow, Yandex)
**********************************************************
*
* 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/
*
**********************************************************