The PROMIS Project is an ongoing EU Tempus Project for setting up ISC (Informatics as a Second Competence) Master's degrees in Central Asia. We are more specifically concerned with ensuring the vocational aspect of studies and tightening the relationships between companies and universities in this project. To meet these goals we mainly propose to base the curricula organization on both reverse teaching and apprenticeship. As we also want the degrees to be part of an international network many tasks of the project are dedicated to sharing and discussing pedagogical materials and methods between European and Central Asia partners. This paper contains a general presentation of the PROMIS Project and a focus on the organization of pedagogical workshops that are its most important pedagogy sharing task.

We consider the problem of finding a maximum collection of vertex-disjoint paths in undirected, planar graphs from a vertex s to a vertex t. This problem is usually solved using flow techniques, which lead to ${\cal O}(nk)$ and ${\cal O}(n\sqrt{n})$ running times, respectively, where n is the number of vertices and k the maximum number of vertex-disjoint $(s,t)$-paths. The best previously known algorithm is based on a divide-and-conquer approach and has running time ${\cal O}(n\log n)$. The approach presented here is completely different from these methods and yields a linear-time algorithm.