Organization

The scientific program of the conference will include invited talks, contributed talks, problem sessions and enough time around the sessions for informal discussions.

We would like to cover the following list of topics:

  • structural metric graph theory
  • connections with discrete geometry
  • connections with geometric group theory
  • fi nite metric spaces
  • algorithmic aspects of metric graph theory
  • interactions with other fi elds of theoretical computer science (concurrency theory, machine learning, combinatorial optimization).

For each topic, we would like to have invited talks as well as contributed talks for the participants.

PhD students and post-doctoral researchers will be encouraged to propose contributed talks.

We plan to schedule invited lectures in the morning and to use the afternoons for contributed talks as well as problem sessions.

We plan to have around 15 invited talks.