M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
LibreCat: /record/215
DOI: 10.1145/2935764.2935783

G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation Habits,” in Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, vol. Volume 285: ECAI 2016, pp. 417–425.
LibreCat: /record/17655
DOI: 10.3233/978-1-61499-672-9-417

G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,” in Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 2016, pp. 1431–1432.
LibreCat: /record/17656

F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.
LibreCat: /record/177
DOI: 10.1007/978-3-319-48749-6_35

F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA 2014, no. 1. 2016.
LibreCat: /record/187
DOI: 10.1145/2936716

A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.
LibreCat: /record/207
DOI: 10.1007/978-3-319-48749-6_42

M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.
LibreCat: /record/209
DOI: 10.1007/978-3-319-48749-6_47
arXiv: 1607.05143

J. Bülling, Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden. 2016.
LibreCat: /record/5406

J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016.
LibreCat: /record/5407

D. Kutzias, Friendship Processes in Network Creation Games. Universität Paderborn, 2016.
LibreCat: /record/688

J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.
LibreCat: /record/689

A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” arXiv:1602.03303. 2016.
LibreCat: /record/16450
arXiv: 1602.03303

T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application,” in Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.
LibreCat: /record/169
DOI: 10.1007/978-3-319-30668-1_18

T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.
LibreCat: /record/1082

A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
LibreCat: /record/154

J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577.
LibreCat: /record/157
DOI: 10.1007/978-3-319-48749-6_41

T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” IEEE/ACM Transactions on Networking, no. 4, pp. 2553–2562, 2016.
LibreCat: /record/159
DOI: 10.1109/TNET.2015.2468571

M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.
LibreCat: /record/149
DOI: 10.1007/978-3-319-48749-6_43

F. Dressler and F. Meyer auf der Heide, Eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016.
LibreCat: /record/163
DOI: 10.1145/2942358

M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering Aspects of Real-Time Rendering Algorithms,” in Algorithm Engineering, 2016, vol. 9220, pp. 226–244.
LibreCat: /record/16351
DOI: 10.1007/978-3-319-49487-6_7 

S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” in Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), 2016.
LibreCat: /record/16358
DOI: 10.1007/978-3-319-53058-1_5 

A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 301–312.
LibreCat: /record/16359
DOI: 10.1145/2935764.2935789

S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” in Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 2016, pp. 689–699.
LibreCat: /record/16360
DOI: 10.1109/IPDPS.2016.51

A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams,” in 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016.
LibreCat: /record/16364
DOI: 10.1109/ipdps.2016.91

A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” arXiv:1609.01184. 2016.
LibreCat: /record/16396
arXiv: 1609.01184

S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” Journal of Combinatorial Optimization, no. 4, pp. 1197--1216, 2016.
LibreCat: /record/139
DOI: 10.1007/s10878-015-9915-5

F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.
LibreCat: /record/143
DOI: 10.1007/978-3-319-42634-1_8

M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, pp. 1655–1677, 2016.
LibreCat: /record/145
DOI: 10.1002/cpe.3716

K. Pfannschmidt, Solving the aggregated bandits problem. Universität Paderborn, 2015.
LibreCat: /record/251

M. Wahby and H. Hamann, “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking,” in Applications of Evolutionary Computation (EvoApplications 2015), 2015.
LibreCat: /record/19959
DOI: 10.1007/978-3-319-16549-3_61

H. Hamann et al., “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids,” in Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015.
LibreCat: /record/19960
DOI: 10.1109/ssci.2015.158

H. Hamann, “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity,” Artificial Life, pp. 464–480, 2015.
LibreCat: /record/19962
DOI: 10.1162/artl_a_00186

M. Wahby, A. Weinhold, and H. Hamann, “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings,” in Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS), 2015.
LibreCat: /record/19966
DOI: 10.4108/eai.3-12-2015.2262877

M. Wahby, M. Divband Soorati, S. von Mammen, and H. Hamann, “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion,” in Proceedings. 25. Computational Intelligence Workshop, 2015.
LibreCat: /record/19967

H. Hamann and M. Divband Soorati, “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), 2015, pp. 153–160.
LibreCat: /record/19980
DOI: 10.1145/2739480.2754676

H. Hamann, T. Schmickl, and P. Zahadat, “Evolving Collective Behaviors With Diverse But Predictable Sensor States,” in 13th European Conference on Artificial Life (ECAL 2015), 2015, p. 174.
LibreCat: /record/19988
DOI: 10.7551/978-0-262-33027-5-ch036

H. Hamann, N. Correll, J. Kacprzyk, and W. Pedrycz, “Probabilistic Modeling of Swarming Systems,” in Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–1431.
LibreCat: /record/19989
DOI: 10.1007/978-3-662-43505-2_74

H. Ding and H. Hamann, “Dependability in Swarm Robotics: Error Detection and Correction,” in First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.
LibreCat: /record/19990

H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, and F. Wotawa, “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms,” in Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–217.
LibreCat: /record/19991

G. Valentini and H. Hamann, “Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes,” Swarm Intelligence, pp. 153–176, 2015.
LibreCat: /record/19992
DOI: 10.1007/s11721-015-0108-8

M. Dorigo, H. Hamann, and G. Valentini, “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off,” in Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.
LibreCat: /record/20005

M. Dorigo, H. Hamann, and G. Valentini, “Self-organized collective decisions in a robot swarm,” in AAAI-15 Video Proceedings, 2015.
LibreCat: /record/20006

C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.
LibreCat: /record/266
DOI: 10.1145/2767386.2767454

C. Markarian, Online Resource Leasing. Universität Paderborn, 2015.
LibreCat: /record/267

I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” Transactions on Economics and Computation, vol. 3, no. 1, 2015.
LibreCat: /record/320
DOI: 10.1145/2614687

J. Pautz, Budget Games with priced strategies. Universität Paderborn, 2015.
LibreCat: /record/316

C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015.
LibreCat: /record/317

S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn, 2015.
LibreCat: /record/270

M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.
LibreCat: /record/271
DOI: 10.1007/978-3-662-48433-3_14
arXiv: 1507.02908

A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive Scheduling on Machines with Setup Times,” in Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.
LibreCat: /record/274
DOI: 10.1007/978-3-319-21840-3_45