J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, vol. 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
LibreCat: /record/18976

P. Briest and C. Raupach, “The car sharing problem,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.
LibreCat: /record/19026
DOI: 10.1145/1989493.1989518

S. Effert, Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn, 2011.
LibreCat: /record/19040

P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011.
LibreCat: /record/23739
DOI: 10.1137/090772988

P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems,” SIAM Journal on Computing, pp. 1554–1586, 2011.
LibreCat: /record/23740
DOI: 10.1137/090752353

A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011.
LibreCat: /record/20709
DOI: 10.1007/978-3-642-18381-2_15

A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.
LibreCat: /record/20710
DOI: 10.1007/978-3-642-22012-8_52

H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization,” in Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.
LibreCat: /record/18193

T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel Out-of-Core Occlusion Culling.” 2011.
LibreCat: /record/18194

B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, and M. Polukarov, “Considerate Equilibrium,” in IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239.
LibreCat: /record/18568

S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks,” in Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.
LibreCat: /record/657
DOI: 10.1007/978-3-642-28209-6_3

K. Swierkot, Complexity Classes for Local Computation. Universität Paderborn, 2011.
LibreCat: /record/663

J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment,” in Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40.
LibreCat: /record/664
DOI: 10.1007/978-3-642-31500-8_4

F. Meyer auf der Heide and R. Rajaraman, Eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011.
LibreCat: /record/667
DOI: 10.1145/1989493

A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189.
LibreCat: /record/16410
DOI: 10.1007/978-3-642-18381-2_15

J. Gehweiler and F. Meyer auf der Heide, “Bin Packing - How Do I Get My Stuff into the Boxes,” in Algorithms Unplugged, Berlin, Heidelberg, 2011, pp. 367–374.
LibreCat: /record/16412
DOI: 10.1007/978-3-642-15328-0_38

R. Rajaraman and F. Meyer auf der Heide, “Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11,” 2011.
LibreCat: /record/16428
DOI: 10.1145/1989493

B. Degener, S. P. Fekete, B. Kempkes, and F. Meyer auf der Heide, “A survey on relay placement with runtime and approximation guarantees,” Computer Science Review, pp. 57–68, 2011.
LibreCat: /record/16447
DOI: 10.1016/j.cosrev.2010.09.005

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-efficient strategies for building short chains of mobile robots locally,” in SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–149.
LibreCat: /record/16451
DOI: 10.1016/j.tcs.2012.10.056

B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, and R. Wattenhofer, “A tight runtime bound for synchronous gathering of autonomous robots with limited visibility,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.
LibreCat: /record/16453
DOI: 10.1145/1989493.1989515

P. Kling and F. Meyer auf der Heide, “Convergence of local communication chain strategies via linear transformations,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.
LibreCat: /record/16454
DOI: 10.1145/1989493.1989517

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building Simple Formations in Large Societies of Tiny Mobile Robots,” Procedia Computer Science, pp. 153–155, 2011.
LibreCat: /record/16455
DOI: 10.1016/j.procs.2011.09.049

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Awareness in Self-organising Robotic Exploration Teams,” in Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011.
LibreCat: /record/16456
DOI: 10.1007/978-3-0348-0130-0_35

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.
LibreCat: /record/16459
DOI: 10.1007/978-3-642-22212-2_13

D. F. Hsu, B. M. Magga, H. C. T. Ho, J. Hromkovic, F. C. M. Lau, and F. Meyer auf der Heide, “EDITORIAL,” Journal of Interconnection Networks, pp. vii–viii, 2011.
LibreCat: /record/17009
DOI: 10.1142/s0219265911002885

A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.
LibreCat: /record/16409
DOI: 10.1007/978-3-642-22012-8_52

P. Briest and H. Röglin, “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers,” in Workshop on Approximation and Online Algorithms (WAOA), 2010, vol. 6534.
LibreCat: /record/19678
DOI: 10.1007/978-3-642-18318-8_5

B. Degener, P. Pietrzyk, and B. Kempkes, “A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ,” in International Parallel &; Distributed Processing Symposium (IPDPS), 2010.
LibreCat: /record/19711
DOI: 10.1109/IPDPS.2010.5470349

M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks,” in Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, vol. 5873, pp. 624--639.
LibreCat: /record/19796
DOI: 10.1007/978-3-642-05118-0_43

T. Janson, P. Mahlmann, and C. Schindelhauer, “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs,” in Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010.
LibreCat: /record/19824
DOI: 10.1109/icpads.2010.42

H. Miao, C. C. Ooi, X. Wu, and C. Schindelhauer, “Coverage-hole trap model in target tracking using distributed relay-robot network,” in Proceedings of the 2010 ACM Symposium on Applied Computing - SAC ’10, 2010, pp. 1299–1304.
LibreCat: /record/19829
DOI: 10.1145/1774088.1774365

G. Schomaker, S. Oberthur, and M. Kortenjan, “Distributed and dynamic resource management for self-optimizing mechatronic systems,” in 8th IEEE International Conference on Industrial Informatics (INDIN’2010), 2010.
LibreCat: /record/19933
DOI: 10.1109/indin.2010.5549647

H. Hamann, Space-Time Continuous Models of Swarm Robotics Systems: Supporting Global-to-Local Programming. Berlin, Germany: Springer, 2010.
LibreCat: /record/20182
DOI: 10.1007/978-3-642-13377-0

H. Hamann, T. Schmickl, J. Stradner, and K. Crailsheim, “A Hormone-Based Controller for Evolutionary Multi-Modular Robotics: From Single Modules to Gait Learning,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC’10), 2010, pp. 244--251.
LibreCat: /record/20220
DOI: 10.1109/CEC.2010.5585994

T. Schmickl, H. Hamann, J. Stradner, R. Mayet, and K. Crailsheim, “Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller,” in Proc. of the ALife XII Conference, 2010, pp. 648--655.
LibreCat: /record/20222

H. Hamann, J. Stradner, T. Schmickl, and K. Crailsheim, “Artificial Hormone Reaction Networks: Towards Higher Evolvability in  Evolutionary Multi-Modular Robotics,” in Artificial Life XII (ALife XII), Odense, Denmark, 2010, pp. 773–780.
LibreCat: /record/20223
arXiv: 1011.3912

H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry Breaking in Collective Decision-Making,” in From Animals to Animats 11, 2010, vol. 6226, pp. 639–648.
LibreCat: /record/20226
DOI: 10.1007/978-3-642-15193-4_60

S. Kernbach et al., “On Adaptive Self-Organization in Artificial Robot Organisms,” in 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2010.
LibreCat: /record/20258
DOI: 10.1109/computationworld.2009.9

R. Grzablewicz, J. Kutyowski, M. Kutyowski, and W. Pietkiewicz, “Robust Undetectable Interference Watermarks,”10.1007/11424826_55__ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications, 2010, doi:10.1007/11424826_55 .
LibreCat: /record/24282
DOI: 10.1007/11424826_55

S. Samara and G. Schomaker, “Real-time Adaptation and Load Balancing Aware OS Services for Distributed Reconfigurable System on Chip,”10.1109/cit.2010.304__2010, doi:10.1109/cit.2010.304 .
LibreCat: /record/27159
DOI: 10.1109/cit.2010.304

M. Fischer, H. Renken, C. Laroque, G. Schaumann, and W. Dangelmaier, “Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations,” in Proceedings of the 2010 Winter Simulation Conference, 2010.
LibreCat: /record/17422
DOI: 10.1109/wsc.2010.5678906

J. Gehweiler, F. Meyer auf der Heide, and U.-P. Schroeder, A Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf Institut, 2010.
LibreCat: /record/17462

M. J. Blesa et al., Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study. 2010.
LibreCat: /record/17464

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building short chains of mobile robots locally with a bounded stepwidth.” 2010.
LibreCat: /record/17586

R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” in DIALM-PODC, 2010, pp. 33–42.
LibreCat: /record/17665

H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Levi, and S. Kernbach, “Hormone-based Control for Multi-modular Robotics,” in Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, Springer, 2010, pp. 240--263.
LibreCat: /record/18761

M. Bienkowski, Page migration in dynamic networks, vol. 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/18910

M. Dynia, Collective graph exploration, vol. 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/18927

B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” Algorithmica, vol. 57, no. 3, pp. 562–584, 2010.
LibreCat: /record/19011
DOI: 10.1007/s00453-008-9250-7

J. Gehweiler and H. Meyerhenke, “A distributed diffusive heuristic for clustering a virtual P supercomputer,” in Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010.
LibreCat: /record/19013
DOI: 10.1109/ipdpsw.2010.5470922

J. Gehweiler and H. Meyerhenke, “On Dynamic Graph Partitioning and Graph Clustering using Diffusion,” in Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010.
LibreCat: /record/19016

M. Thies and J. Gehweiler, Thread Migration and Checkpointing in Java. 2010.
LibreCat: /record/19018

S. Kernbach et al., “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics,” in Artificial Life XII (ALife XII), 2010, pp. 781–788.
LibreCat: /record/19023

P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in Workshop on Internet and Network Economics (WINE), 2010.
LibreCat: /record/19029
DOI: 10.1007/978-3-642-17572-5_37

F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.
LibreCat: /record/1903
DOI: 10.1007/s00287-010-0470-2

P. Briest, S. Chawla, R. Kleinberg, and S. M. Weinberg, “Pricing Randomized Allocations,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.
LibreCat: /record/19033
DOI: 10.1137/1.9781611973075.49

P. Mahlmann, Peer-to-peer networks based on random graphs, vol. 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/19041

B. Degener, Local, distributed approximation algorithms for geometric assignment problems, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/19042

M. Fischer, C. Jähn, and T. Suess, “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation,”10.2312/EGPGV/EGPGV10/043-051__in Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), 2010, pp. 43–51, doi:10.2312/EGPGV/EGPGV10/043-051 .
LibreCat: /record/18136
DOI: 10.2312/EGPGV/EGPGV10/043-051

T. Suess, T. Wiesemann, and M. Fischer, “Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments,”10.1109/nas.2010.52__in 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 2010, pp. 448–456, doi:10.1109/nas.2010.52 .
LibreCat: /record/18289
DOI: 10.1109/nas.2010.52

T. Suess, T. Wiesemann, and M. Fischer, “Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems,” in Augmented &; Virtual Reality in der Produktentstehung, 2010, pp. 39–52.
LibreCat: /record/18290

F. Meyer auf der Heide and C. A. Phillips, “Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10,” 2010.
LibreCat: /record/16414
DOI: 10.1145/1810479

B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in Advances in Visual Computing, Berlin, Heidelberg, 2010.
LibreCat: /record/16505
DOI: 10.1007/978-3-642-17289-2_60

B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.
LibreCat: /record/16365
DOI: 10.1007/978-3-642-13284-1_14

B. Degener, B. Kempkes, and F. Meyer auf der Heide, “A local O(n2) gathering algorithm,” in Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10, 2010.
LibreCat: /record/16401
DOI: 10.1145/1810479.1810523

S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg, 2010.
LibreCat: /record/16403
DOI: 10.1007/978-3-642-14162-1

S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg, 2010.
LibreCat: /record/16404
DOI: 10.1007/978-3-642-14165-2

K. Lürwer-Brüggemeier, Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division, vol. 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19605

M. Mense, On Fault-Tolerant Data Placement in Storage Networks, vol. 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19614

M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, vol. 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19617

O. Bonorden, Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip, vol. 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19618

O. Bonorden, B. Degener, P. Pietrzyk, and B. Kempkes, Complexity and approximation of a geometric local robot assignment problem. 2009.
LibreCat: /record/19722

O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in Algorithmic Aspects of Wireless Sensor Networks, Berlin, Heidelberg: Springer, 2009, pp. 252–262.
LibreCat: /record/19724
DOI: 10.1007/978-3-642-05434-1_25

C. Schindelhauer, P. Mahlmann, and T. Janson, 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. Paderborn, Germany, 2009.
LibreCat: /record/19825

C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless Robots,” Mobile Networks and Applications (MONET), pp. 309–321, 2009.
LibreCat: /record/19830
DOI: 10.1007/s11036-008-0150-5

C. C. Ooi and C. Schindelhauer, “Utilizing detours for energy conservation in mobile wireless networks,” Telecommunication Systems, vol. 43, pp. 25–37, 2009.
LibreCat: /record/19831
DOI: 10.1007/s11235-009-9188-3

C. L. Raptopoulos, S. E. Nikoletseas, and P. G. Spirakis, “Colouring Non-sparse Random Intersection Graphs,” in 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611.
LibreCat: /record/19901
DOI: 10.1007/978-1-4939-2864-4_597

S. E. Nikoletseas, C. L. Raptopoulos, and P. G. Spirakis, “Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions,” in  Proceedings of IPDPS - IEEE International Parallel &; Distributed Processing Symposium, 2009, pp. 1--11.
LibreCat: /record/19904
DOI: 10.1109/IPDPS.2009.5161002

D. Deveci, M. Kortenjan, and G. Schomaker, “Distributed Heterogeneous Hashing and Deterministic Dynamical Decompositions,” in  Parallel and Distributed Computing and Systems, Nr. 21, 2009.
LibreCat: /record/19934

J. Stradner, H. Hamann, T. Schmickl, and K. Crailsheim, “Analysis and implementation of an Artificial Homeostatic Hormone System: A first case study in robotic hardware,” in 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2009.
LibreCat: /record/20254
DOI: 10.1109/iros.2009.5354056

T. Schmickl, H. Hamann, H. Wörn, and K. Crailsheim, “Two different approaches to a macroscopic model of a bio-inspired robotic swarm,” Robotics and Autonomous Systems, vol. 6, no. 9, pp. 913–921, 2009.
LibreCat: /record/20255
DOI: 10.1016/j.robot.2009.06.002

H. Hamann, I. Troch, and F. Breitenecker, “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System,” in MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.
LibreCat: /record/20259

F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,” Public Service Review: Science and Technology, vol. 04, 2009.
LibreCat: /record/17453

P. Briest, “Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems),” it - Information Technology, vol. 51, no. 1, pp. 62–65, 2009.
LibreCat: /record/19031
DOI: 10.1524/itit.2009.0524

P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with Computationally Bounded Consumers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.
LibreCat: /record/23744
DOI: 10.1007/978-3-642-10841-9_6

C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification and Validation during Simulation Runtime,” in European Simulation and Modelling Conference (ESM 2009), 2009.
LibreCat: /record/18138

T. Suess, M. Fischer, D. Huber, C. Laroque, and W. Dangelmaier, “Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen,” in Augmented &; Virtual Reality in der Produktentstehung, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.
LibreCat: /record/18291

M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” in Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206.
LibreCat: /record/18346

J. Kutyowski and F. Meyer auf der Heide, “Optimal strategies for maintaining a chain of relays between an explorer and a base camp,” Theoretical Computer Science, pp. 3391–3405, 2009.
LibreCat: /record/16429
DOI: 10.1016/j.tcs.2008.04.010

J. Mehler and F. Meyer auf der Heide, “Power-aware online file allocation in mobile ad hoc networks,” in Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09, 2009.
LibreCat: /record/16430
DOI: 10.1145/1583991.1584072

F. Meyer auf der Heide and M. A. Bender, Eds., Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09. 2009.
LibreCat: /record/16431
DOI: 10.1145/1583991

M. Bienkowski, J. Byrka, M. Korzeniowski, and F. Meyer auf der Heide, “Optimal algorithms for page migration in dynamic networks,” Journal of Discrete Algorithms, pp. 545–569, 2009.
LibreCat: /record/16398
DOI: 10.1016/j.jda.2008.07.006

G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous Networks, vol. 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
LibreCat: /record/19615

P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.
LibreCat: /record/19686
DOI: 10.1007/978-3-540-70575-8_66

P. Briest, P. Krysta, and M. Babaioff, “On the Approximability of Combinatorial Exchange Problems,” in Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), 2008.
LibreCat: /record/19687
DOI: https://doi.org/10.1007/978-3-540-79309-0_9

P. Briest, P. W. Goldberg, and H. Roeglin, Approximate Equilibria in Games with Few Players. 2008.
LibreCat: /record/19688
arXiv: 0804.4524 

C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,” in The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, 2008, no. 222, pp. 1–22.
LibreCat: /record/19812

C. C. Ooi and C. Schindelhauer, “Detours Save Energy in Mobile Wireless Networks,” in MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), 2008.
LibreCat: /record/19813
DOI: 10.1007/978-0-387-84839-6_6

C. C. Ooi and C. Schindelhauer, “Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots,” in ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008.
LibreCat: /record/19832
DOI: 10.1007/978-3-642-00644-9_4

P. Pietrzyk, Lokale Strategien zur Optimierung von Kommunikationsketten. 2008.
LibreCat: /record/19950