We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
While the history of traditional media in post-conflict peace building efforts is rich and well studied, the potential for interactive new media technologies in this area has gone...
Service-oriented computing proposes services as building blocks which can be composed to complex systems. To reason about the correctness of a service, its communication protocol n...
Learning “the wiki way”, learning through wikis is a form of selfregulated learning that is independent of formal learning settings and takes place in a community of knowledge...
Joachim Kimmerle, Johannes Moskaliuk, Ulrike Cress
Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. co...
Paolo Cignoni, Claudio Montani, Roberto Scopigno, ...