Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...