The Spring School SGT 2018 (School on Graph Theory) will take place on June
11-15, 2018, at Sète (France). It will be dedicated to both combinatorial
and algorithmic aspects of graph theory. Four courses are planned on the
following topics:
- Orientations of planar graphs with applications, by Stefan Felsner (TU
Berlin).
- Input-sensitive enumerations, by Petr Golovach (Univ. Bergen).
- Ideas for approximation algorithms: Matchings, Edge-colorings and the
Travelling Salesman, by András Sebő (G-SCOP, Grenoble).
- Enumerational approach and concepts in theoretical computer science and
engineering, by Takeaki Uno (NII, Tokyo).
*Registrations are now open* at
https://www.lirmm.fr/~goncalves/sgt2018/index.php?n=Main.HomePage
*Early registrations* before May 4.
Note that according to the strike schedule, *the school will not suffer
from SNCF strikes !*
We are waiting for your participation.
**********************************************************
*
* 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
