• On the number of higher order Delaunay triangulations 

      Dieter Wilhelm, Mitsche; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio (Springer Verlag, 2010)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-k Delaunay ...
    • On the power of mediators 

      Díaz Cort, Josep; Dieter Wilhelm, Mitsche; Rustagi, Navin; Saia, Jared (2009)
      Article
      Accés restringit per política de l'editorial
      We consider a problem at the intersection of distributed computing and game theory, namely: Is it; possible to achieve the "windfall of malice" even without the actual presence of malicious players'? Our answer to this ...
    • On the relation between graph distance and Euclidean distance in random geometric graphs 

      Díaz Cort, Josep; Dieter Wilhelm, Mitsche; Perarnau Llobet, Guillem; Pérez Giménez, Xavier (2016-09-01)
      Article
      Accés obert
      Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) ...
    • Theoretical aspects of graph models for MANETS 

      Díaz Cort, Josep; Dieter Wilhelm, Mitsche; Santi, Paolo (2010-03-01)
      Report de recerca
      Accés obert
      We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, di erent dynamic graph models of MANETs, and nally ...