In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
We study the forward and backward substitution phases of a sparse multifrontal factorization. These phases are often neglected in papers on sparse direct factorization but, in man...
Patrick Amestoy, Iain S. Duff, Abdou Guermouche, T...
Many visual cues for surface reconstruction from known views are sparse in nature, e.g. specularities, surface silhouettes and salient features in an otherwise textureless region....
Abstract— In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the exi...