We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
Accurate and robust interference detection and ray-tracing of subdivision surfaces requires safe linear approximations. Approximation of the limit surface by the subdivided contro...
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
Haowen Chan, Hsu-Chun Hsiao, Adrian Perrig, Dawn S...
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...
Andreas W. M. Dress, Christoph Flamm, Guido Fritzs...