Abstract: We give an O(n s-log n) time and O(n s) space algorithm for the continuous ho-motopic one layer routing problem. The main contribution is an extension of the sweep pa-radigm to a universal cover space of the plane. 1. Problem Definition An input of the continuous homotopic one layer

Abstract—Homotopic routing asks for a path going around holes according to a given “threading”. Paths of different homo-topy types can be used to improve load balancing and routing resilience. We propose the first lightweight homotopic routing scheme that generates constant bounded stretch compared

We study the problem of finding non-crossing thick minimum-link rectilinear paths homotopic to a set of input paths in an environment with rectangular obstacles. This problem occurs in the context of map schematization under geometric embedding re-strictions, for example, when schematizing a high

mouse (low dose, LD) of CNT (containing Ni and Y) showed no overt clinical signs. However, 5 of the 9 mice treated with 0.5 mg (high dose, HD) of this product died (2/4 in the 7-d group and 3/5 in the 90-d group). All deaths occurred 4 to 7 days after instillation of the CNT. The deaths were generally

As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing

I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present the work on various conferences, for which I thank him. I would also like to thank Prof. Dr. Roger Wattenhofer, responsible for the Koreferat of this work. Also, Prof. Dr. Oscar Nierstrasz who was willing to be the co-examinator of this work deserves many thanks. Many thanks go to my colleagues of the RVS group and of the IAM for our various interesting discussions about all kinds of topics and for making the institute a very pleasant and friendly place to work at. Special thanks go to David Steiner, Marc Steinemann, Matthias Scheidegger, Florian Baumgartner, Ruy De Oliveira, and Attila Weyland. There are many students who worked with me and helped a lot in developing and implementing. Among them I especially thankful to Thomas Bernoulli,

1. Networking trends 2. QoS over data networks 3. Label switching 4. Gigabit, 10 Gb Ethernet, RPR 5. Storage area networks 6. IP over DWDM 7. Wireless 8. Voice over IP

. R. Karlin, and E. Upfal, SIAM J Comput 29(1) (2000), 180--200; M. Mitzenmacher, Ph.D. Thesis, University of California, Berkeley, August 1996]; we refer to this new algorithm as the Balanced Dynamic Alternative Routing (BDAR) algorithm. While DAR checks alternative routes sequentially until

of breathing route on UA dynamics in the presence of MO. Bilateral anterior magnetic phrenic nerve stimulation was performed 2 s after expiratory onset in 12 healthy male subjects during wakefulness (age, 50 + − 5 years; body mass index, 27.8 + − 2.4 kg/m 2 ) during MB through a mouthpiece and during exclusive

the non-exclusive right to publish the Work electronically and in a non-commercial purpose make it accessible on the Internet. The Author warrants that he/she is the author to the Work, and warrants that the Work does not contain text, pictures or other material that violates copyright law. The Author shall, when transferring the rights of the Work to a third party (for example a publisher or a company); acknowledge the third party about this agreement. If the Author has signed a copyright agreement with a third party regarding the Work, the Author warrants hereby that he/she has obtained any necessary permission from this third party to let Chalmers University of Technology and University of Gothenburg store the Work electronically and make it accessible on the Internet.