Manuela Fischer

Learn 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)
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)
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)
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)
Locally Checkable Labeling (LCL) problems include essentially all the classic problems of LOCAL distributed algorithms. In a recent enlightening revelation, Chang and Pettie [arXiv 1704.06297] showed that any LCL (on bounded degree graphs) that has an o(log n)-round randomized algorithm can be solved in TLLL(n) rounds, which is the randomized complexity of(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 7 ∆ · log n) 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.,(More)
  • 1