@inbook{16464,
  author       = {{Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Taschenbuch der Algorithmen}},
  isbn         = {{9783540763932}},
  title        = {{{Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“}}},
  doi          = {{10.1007/978-3-540-76394-9_40}},
  year         = {{2008}},
}

@unpublished{16465,
  abstract     = {{For a fixed virtual scene (=collection of simplices) S and given observer
position p, how many elements of S are weakly visible (i.e. not fully occluded
by others) from p? The present work explores the trade-off between query time
and preprocessing space for these quantities in 2D: exactly, in the approximate
deterministic, and in the probabilistic sense. We deduce the EXISTENCE of an
O(m^2/n^2) space data structure for S that, given p and time O(log n), allows
to approximate the ratio of occluded segments up to arbitrary constant absolute
error; here m denotes the size of the Visibility Graph--which may be quadratic,
but typically is just linear in the size n of the scene S. On the other hand,
we present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)
preprocessing time and space with similar approximation properties and query
time O(k*polylog n), where k<n is an arbitrary parameter. We describe an
implementation of this approach and demonstrate the practical benefit of the
parameter k to trade memory for query time in an empirical evaluation on three
classes of benchmark scenes.}},
  author       = {{Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}},
  booktitle    = {{arXiv:0810.0052}},
  title        = {{{Planar Visibility Counting}}},
  year         = {{2008}},
}

@proceedings{16466,
  editor       = {{Meyer auf der Heide, Friedhelm and Shavit, Nir}},
  isbn         = {{978-1-59593-973-9}},
  publisher    = {{ACM}},
  title        = {{{Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08}}},
  doi          = {{10.1145/1378533}},
  year         = {{2008}},
}

@book{17566,
  author       = {{Meyer auf der Heide, Friedhelm}},
  isbn         = {{ISBN 978-3-939350-41-5}},
  publisher    = {{Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn}},
  title        = {{{The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS)"}}},
  volume       = {{222}},
  year         = {{2008}},
}

@inproceedings{19689,
  author       = {{Briest, Patrick and Krysta, Piotr}},
  booktitle    = {{Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)}},
  title        = {{{Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing}}},
  year         = {{2007}},
}

@inproceedings{19725,
  author       = {{Bonorden, Olaf}},
  booktitle    = {{2007 IEEE International Parallel and Distributed Processing Symposium}},
  isbn         = {{1424409098}},
  title        = {{{Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations}}},
  doi          = {{10.1109/ipdps.2007.370330}},
  year         = {{2007}},
}

@inproceedings{19809,
  abstract     = {{For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless communication, e.g. caused by a multimedia application like video surveillance. This robot is connected to a radio base station and moves with constant speed from a given starting point on the plane to a target point. The task is to find the best path such that the energy consumption for mobility and the communication is optimized. This is motivated by the fact that the energy
consumption of radio devices increases polynomially (at least to
the power of two) with the transmission distance. We introduce efficient approximation algorithms finding the optimal path given the starting point, the target point and the position of the radio stations. We exemplify the influence of the communication cost by a starting scenario with one radio station. We study the performance of the proposed algorithm in simulation, compare it with the scenario without applying our approach, and present the results.}},
  author       = {{Ooi, Chia Ching and Schindelhauer, Christian}},
  booktitle    = {{ROBOCOMM'07: Proc. of the 1st International Conference on Robot Communication and Coordination}},
  issn         = {{1383-469X}},
  pages        = {{309--321}},
  title        = {{{Minimal Energy Path Planning for Wireless Robots}}},
  doi          = {{10.1007/s11036-008-0150-5}},
  year         = {{2007}},
}

@inproceedings{19853,
  author       = {{Schomaker, Gunnar}},
  booktitle    = {{Advanced Information Networking and Applications (AINA-07)}},
  isbn         = {{0769528465}},
  issn         = {{1550-445X}},
  pages        = {{331--339}},
  title        = {{{DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments}}},
  doi          = {{10.1109/aina.2007.59}},
  volume       = {{21}},
  year         = {{2007}},
}

@inproceedings{24276,
  abstract     = {{We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource.
Basing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm.
}},
  author       = {{Bienkowski, Marcin and Kutyłowski, Jarosław}},
  booktitle    = {{Lecture Notes in Computer Science}},
  issn         = {{0302-9743}},
  title        = {{{The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces}}},
  doi          = {{10.1007/978-3-540-73951-7_30}},
  year         = {{2007}},
}

@book{24366,
  abstract     = {{Dieses Buch beschäftigt sich mit Algorithmen und Methoden der Peer-to-Peer-Netzwerke und gibt einen Einblick in die aktuelle Forschung.

Ursprünglich waren Peer-to-Peer-Netzwerke nur für File-Sharing konzipiert. Mittlerweile hat sich Peer-to-Peer zum Paradigma für Rechnernetzwerke entwickelt. Ziel dieses Buches ist es, dem Leser ein grundlegendes Verständnis der Techniken hinter den aktuellen Peer-to-Peer-Netzwerken aufzuzeigen und im nächsten Schritt Algorithmen vorzustellen, die vielleicht erst in einigen Jahren umgesetzt werden.

Das Buch richtet sich in erster Linie an Informatiker (Studenten ab dem 5. Semester). Aber auch interessierte Nichtinformatiker können von diesem Buch profitieren, wobei grundlegende Kenntnisse aus den Bereichen der Mathematik und Informatik vorausgesetzt werden. Die Ziele, Kernaussagen und Ergebnisse sollten jedoch auch ohne akademischen Hintergrund klar werden.}},
  author       = {{Mahlmann, Peter and Schindelhauer, Christian}},
  isbn         = {{9783540339915}},
  publisher    = {{Springer}},
  title        = {{{Peer-to-Peer-Netzwerke}}},
  doi          = {{10.1007/978-3-540-33992-2}},
  year         = {{2007}},
}

@article{17567,
  author       = {{Leonardi, Stefano and Mahlmann, Peter and Meyer auf der Heide, Friedhelm and Spirakis, Paul G. and Weikum, Gerhard}},
  journal      = {{e-Strategies, www.britishpublishers.com}},
  title        = {{{Guarding our digital society's well-being}}},
  volume       = {{3-10-2007}},
  year         = {{2007}},
}

@inproceedings{18928,
  author       = {{Dynia, Miroslaw and Łopuszański, Jakub and Schindelhauer, Christian}},
  booktitle    = {{Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)}},
  isbn         = {{9783540729181}},
  pages        = {{37---- 46}},
  title        = {{{Why Robots Need Maps}}},
  doi          = {{10.1007/978-3-540-72951-8_5}},
  year         = {{2007}},
}

@inproceedings{18929,
  author       = {{Dynia, Miroslaw and Korzeniowski, Miroslaw and Kutyłowski, Jarosław}},
  booktitle    = {{Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}},
  isbn         = {{9783540695066}},
  issn         = {{0302-9743}},
  pages        = {{260----271}},
  title        = {{{Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs}}},
  doi          = {{10.1007/978-3-540-69507-3_21}},
  volume       = {{4362}},
  year         = {{2007}},
}

@phdthesis{18931,
  author       = {{Kutylowski, Jaroslaw}},
  title        = {{{Using Mobile Relays for Ensuring Connectivity in Sparse Networks}}},
  year         = {{2007}},
}

@unpublished{18933,
  author       = {{Kutylowski, Jaroslaw}},
  title        = {{{Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries}}},
  year         = {{2007}},
}

@inproceedings{20374,
  author       = {{Dorigo, Marco and Hamann, Heiko and Szymanski, Marc and Wörn, Heinz and Shi, Yuhui}},
  booktitle    = {{IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5}},
  pages        = {{310----315}},
  publisher    = {{IEEE Press}},
  title        = {{{Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics}}},
  doi          = {{10.1109/SIS.2007.367953}},
  year         = {{2007}},
}

@inproceedings{20431,
  author       = {{Hamann, Heiko and Wörn, Heinz and Sahin, Erol and Spears, Winfield and Winfield, Winfield}},
  booktitle    = {{Swarm Robotics - Second SAB 2006 International Workshop}},
  pages        = {{43----55}},
  title        = {{{An analytical and spatial model of foraging in a swarm of robots}}},
  doi          = {{10.1007/978-3-540-71541-2_4}},
  volume       = {{4433}},
  year         = {{2007}},
}

@inproceedings{20432,
  abstract     = {{Designing and implementing artificial self-organizing systems is a challenging task since they typically behave non- intuitive and only little theoretical foundations exist. Predicting a system of many components with a huge amount of interactions is beyond human skills. The currently common use of simulations for design support is not satisfying, as it is time-consuming and the results are most likely sub- optimal. In this work, we present the derivation of an analytical, time-, and space-continuous model for a swarm of autonomous robots based on the Fokker-Planck equation. While the motion model is in most parts physically motivated, the communication model is based on a heuristic approach. A showcase application to a recently proposed scenario of collective perception in a huge swarm of robots with very limited abilities is given and the simulation results are compared to the model. Despite the high level of abstraction, the prediction discrepancies are small and the parameters can be mapped one-to-one from the model to the control algorithm. Finally, we give an outlook on the capabilities of the proposed model, discuss its limitations, and suggest an improvement that could reduce the number of empirically determined parameters.}},
  author       = {{Hamann, Heiko and Wörn, Heinz}},
  booktitle    = {{First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)}},
  isbn         = {{0769529062}},
  pages        = {{23----31}},
  title        = {{{A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support}}},
  doi          = {{10.1109/saso.2007.3}},
  year         = {{2007}},
}

@article{20433,
  author       = {{Hamann, Heiko and Wörn, Heinz and Nagy, Marius and Nagy, Naya}},
  journal      = {{Parallel Processing Letters}},
  number       = {{3}},
  pages        = {{287----298}},
  title        = {{{Embodied Computation}}},
  volume       = {{17}},
  year         = {{2007}},
}

@inproceedings{20434,
  abstract     = {{Current research in Micro, Nano and Swarm Robots as results of the European projects Miniman, MiCRoN and I-SWARM will be presented. First, the design and the control of 5 to 10cm3 sized mobile micro robots with five degrees of freedom will be shown. They can handle miniaturized parts as for example an optical component or a biological cell with a size in the micrometre-area with an accuracy of 100nm under a microscope or a raster-electron microscope. Second, the design and the control of a 1cm3-sized mobile untethered micro robot will be demonstrated. Here, the robot consists of five parts: the Piezzo locomotion module, the micro control unit, the communication unit, the navigation system and the micro gripper. The mobile robot can be guided and positioned in an arena with an accuracy of 5 micrometre and can be programmed and controlled over the wireless communication unit. Third, the design and the control of 3 × 3 × 3 mm3 sized micro-/nanorobots with 2 degrees of freedom will be presented. The transmission of energy and the communication between the robots is realized via infrared. The robot controller is fully integrated and has limited functionalities. Via basic sensors communication functions and elementary rules and behaviours the micro robot can act in a swarm consisting of hundreds and thousands of robots. Future applications could be monitoring-, inspection-, exploring-tasks etc. of big areas or objects.}},
  author       = {{Hamann, Heiko and Szymanski, Marc and Wörn, Heinz and Estana, Ramon and Xie, Ming and Dubowsky, Steven}},
  booktitle    = {{Advances in Climbing and walking robots. Proceedings of 10th International Conference (CLAWAR'07), Singapore, July 16-18}},
  pages        = {{15----24}},
  title        = {{{From Micro to Nano and Swarm Robotics}}},
  doi          = {{10.1142/9789812770189_0003}},
  year         = {{2007}},
}