@inproceedings{6886, author = {{Koch, S. and Kupke, J. and Tomow, D. and Schoppa, M. and Grunow, Paul and Krauter, Stefan}}, booktitle = {{Proceedings of the 26th European Photovoltaic Solar Energy Conference and Exhibition}}, title = {{{Polarisation Effects and Tests for Crystalline Silicon Cells}}}, year = {{2011}}, } @inproceedings{6887, author = {{Böttcher, A. and Horstmann, M. and Grunow, Paul and Pourhashemi, R. and Krauter, Stefan}}, booktitle = {{Proceedings of the 26th European Photovoltaic Solar Energy Conference and Exhibition}}, title = {{{Spectral Mismatch Correction for Micromorph Tandem Modules. }}}, year = {{2011}}, } @inproceedings{6888, author = {{Weber, T. and Albert, A. and Grunow, Paul and Krauter, Stefan}}, booktitle = {{Proceedings of the 26th European Photovoltaic Solar Energy Conference and Exhibition}}, title = {{{Electroluminescence Investigation on Thin Film Modules}}}, year = {{2011}}, } @inproceedings{6889, author = {{Wendlandt, S. and Drobisch, A. and Tomow, D. and Friedrichs, M. and Krauter, Stefan and Grunow, Paul}}, booktitle = {{Proceedings of the ISES Solar Word Congress}}, title = {{{Operating principle of a shadowed c-Si solar cell in PV modules}}}, year = {{2011}}, } @inproceedings{16410, abstract = {{Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version.}}, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)}}, isbn = {{9783642183805}}, issn = {{0302-9743}}, number = {{6543}}, pages = {{178--189}}, publisher = {{Springer}}, title = {{{Collisionless Gathering of Robots with an Extent}}}, doi = {{10.1007/978-3-642-18381-2_15}}, year = {{2011}}, } @inbook{16412, author = {{Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}}, booktitle = {{Algorithms Unplugged}}, isbn = {{9783642153273}}, pages = {{367--374}}, title = {{{Bin Packing - How Do I Get My Stuff into the Boxes}}}, doi = {{10.1007/978-3-642-15328-0_38}}, year = {{2011}}, } @inproceedings{16428, author = {{Rajaraman, Rajmohan and Meyer auf der Heide, Friedhelm}}, isbn = {{9781450307437}}, title = {{{Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11}}}, doi = {{10.1145/1989493}}, year = {{2011}}, } @article{16447, author = {{Degener, Bastian and Fekete, Sándor P. and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, issn = {{1574-0137}}, journal = {{Computer Science Review}}, pages = {{57--68}}, title = {{{A survey on relay placement with runtime and approximation guarantees}}}, doi = {{10.1016/j.cosrev.2010.09.005}}, year = {{2011}}, } @inproceedings{16451, author = {{Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, booktitle = {{SIROCCO '11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity}}, pages = {{138--149}}, title = {{{Energy-efficient strategies for building short chains of mobile robots locally}}}, doi = {{10.1016/j.tcs.2012.10.056}}, year = {{2011}}, } @inproceedings{16453, author = {{Degener, Bastian and Kempkes, Barbara and Langner, Tobias and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Wattenhofer, Roger}}, booktitle = {{Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11}}, isbn = {{9781450307437}}, title = {{{A tight runtime bound for synchronous gathering of autonomous robots with limited visibility}}}, doi = {{10.1145/1989493.1989515}}, year = {{2011}}, }