Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
We present a system for interactive shape and appearance editing of 3D point-sampled geometry. By generalizing conventional 2D pixel editors, our system supports a great variety o...
Matthias Zwicker, Mark Pauly, Oliver Knoll, Markus...
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
We study finite bisimulations of dynamical systems in Rn defined by Pfaffian maps. The pure existence of finite bisimulations for a more general class of o-minimal systems was show...
Abstract— In the present paper we consider uniform inputto-state stability of reaction-diffusion equations and compare it with its finite dimensional counterpart without diffusi...