In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
In this paper, we present an efficient way to denoise bivariate data like height fields, color pictures or vector fields, while preserving edges and other features. Mixing surface...
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
Matthias Nieser, Konstantin Poelke, Konrad Polthie...
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
Steve Butler, Mohammad Taghi Hajiaghayi, Robert D....