The program will consist of three long (1h) invited talks, plus 24 contributions from participants in the form of short presentations. The invited speakers are:
- Delia Garijo, U. de Sevilla, Sevilla, Spain
Distances in continuous graphs
This talk will provide an overview of distance-related problems in the context of continuous graphs — a topic that has received a lot of interest recently. Informally, a continuous graph is the infinite set of points determined by the vertices and edges of a graph, where every point along each edge is part of the graph. Thus, distance computation involves considering infinitely many pairs of points.
I will present several ongoing research directions in this area, focusing mainly on algorithmic aspects. These include problems such as computing the diameter and the mean distance of a continuous graph, as well as studying the continuous analogue of the graph diameter augmentation problem.
- Michael Joswig, TU Berlin, Berlin, Germany
Tropical medians by transportation
Fermat-Weber points with respect to an asymmetric tropical distance function are studied. It turns out that they correspond to the optimal solutions of a transportation problem. The results are applied to obtain a new method for computing consensus trees in phylogenetics. This method has several desirable properties; e.g., it is Pareto and co-Pareto on rooted triplets.
This is joint work with Andrei Comăneci.
- Raimund Seidel, U. Saarland, Saarbrücken, Germany
Reading, Writing, Refereeing, and all that: a personal perspective.
Refereeing has influenced my work on a number of occasions quite strongly. I will argue that refereeing is not necessarily just an onerous service duty for the community but can have its own personal benefits (and also pitfalls). I will give some examples.
The list of 24 accepted contributions can be seen here or in the timetable below; clicking on each contributed talk will open the PDF submission of that talk. The timetable itself can be downloaded in PDF [Color, B/W].