Manuela Fischer

Learn More
Thirty-nine hemodialysis patients with permanent central venous catheters were analyzed for bacterial catheter colonization comparing different catheter-lock strategies. The closed needleless Tego connector with sodium chloride lock solution was significantly more frequently colonized with bacteria than the standard catheter caps with antimicrobially active(More)
Responses of biodiversity to changes in both land cover and climate are recognized [1] but still poorly understood [2]. This poses significant challenges for spatial planning as species could shift, contract, expand, or maintain their range inside or outside protected areas [2-4]. We examine this problem in Borneo, a global biodiversity hotspot [5], using(More)
We present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a deterministic distributed rounding method for certain linear programs, which is the first such rounding method, to(More)
Habitat loss and climate change pose a double jeopardy for many threatened taxa, making the identification of optimal habitat for the future a conservation priority. Using a case study of the endangered Bornean orang-utan, we identify environmental refuges by integrating bioclimatic models with projected deforestation and oil-palm agriculture suitability(More)
h indirect adaptive control, there is a range of possibilities<lb>between [he two extremes of applying the certainty equivalence principle,<lb>wtdch ems only be optimal asymptotically, and dual control, which is not<lb>a praeticaf proposition for on-line schemes. Here, it is proposed to design<lb>indirect adaptive controlled using measures of central(More)
We present a deterministic distributed algorithm that computes a (2∆ − 1)-edge-coloring, or even list-edge-coloring, in any n-node graph with maximum degree ∆, in O(log ∆ · logn) rounds. This answers one of the long-standing open questions of distributed graph algorithms from the late 1980s, which asked for a polylogarithmic-time algorithm. See, e.g., Open(More)
We calculate the full O(αs) radiative corrections to the three spin independent and five spin dependent structure functions that describe the angular decay distribution in the decay of a polarized top quark into a W -boson (followed by the decay W+ → l+ + νl or by W + → q̄ + q) and a bottom quark. The angular decay distribution is described in cascade(More)
The dominant contribution to the inclusive decays of B mesons into the charmstrangeness mesons Ds and D ∗ s is expected to be given by the partonic process b→ c + (D s ,D s ). We determine the nonperturbative O(1/mb ) and the O(αs) radiative corrections to b→ c + (D s ,D s ) and thereby to the inclusive decays B̄ → Xc + (D s ,D s ). The new feature of our(More)
The kth power of a cycle is obtained by adding an edge between all pairs of vertices whose distance on the cycle is at most k. In 1962, Pósa conjectured that a graph G on n vertices contains a square of a Hamilton cycle if it has minimum degree δ(G) ≥ 3 n, and, 11 years later, Seymour claimed that δ(G) ≥ k k+1 n is sufficient for the appearance of a kth(More)