Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.”10.1145/2935764.2935783__Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.

Polevoy, Gleb, et al. “The Game of Reciprocation Habits.”10.3233/978-1-61499-672-9-417__Proceedings of the 2016 European Conference on Artificial Intelligence, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.

Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32.

Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.”10.1007/978-3-319-48749-6_35__Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88, doi:10.1007/978-3-319-48749-6_35.

Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.”10.1145/2936716__Transactions on Parallel Computing (TOPC), no. 1, 2016, doi:10.1145/2936716.

Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”10.1007/978-3-319-48749-6_42__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.

Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.”10.1007/978-3-319-48749-6_47__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669, doi:10.1007/978-3-319-48749-6_47.

Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden. 2016.

Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.

Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.

Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.

Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.

Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.”10.1007/978-3-319-30668-1_18__Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293, doi:10.1007/978-3-319-30668-1_18.

Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.

Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.

König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”10.1007/978-3-319-48749-6_41__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41.

Harks, Tobias, et al. “Routing Games With Progressive Filling.”10.1109/TNET.2015.2468571__IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.

Drees, Maximilian, et al. “Strategic Online Facility Location.”10.1007/978-3-319-48749-6_43__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.

Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016, doi:10.1145/2942358.

Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.”10.1007/978-3-319-49487-6_7 __Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 .

Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.”10.1007/978-3-319-53058-1_5 __Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016, doi:10.1007/978-3-319-53058-1_5 .

Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.”10.1145/2935764.2935789__Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.

Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”10.1109/IPDPS.2016.51__Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.

Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.”10.1109/ipdps.2016.91__2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91.

Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016.

Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.”10.1007/s10878-015-9915-5__Journal of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.

Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.”10.1007/978-3-319-42634-1_8__Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.

Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.”10.1002/cpe.3716__Concurrency and Computation: Practice and Experience, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.

Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015.

Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.”10.1007/978-3-319-16549-3_61__Applications of Evolutionary Computation (EvoApplications 2015), 2015, doi:10.1007/978-3-319-16549-3_61.

Hamann, Heiko, et al. “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids.”10.1109/ssci.2015.158__Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015, doi:10.1109/ssci.2015.158.

Hamann, Heiko. “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity.”10.1162/artl_a_00186__Artificial Life, 2015, pp. 464–80, doi:10.1162/artl_a_00186.

Wahby, Mostafa, et al. “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings.”10.4108/eai.3-12-2015.2262877__Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015, doi:10.4108/eai.3-12-2015.2262877.

Wahby, Mostafa, et al. “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion.” Proceedings. 25. Computational Intelligence Workshop, 2015.

Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.”10.1145/2739480.2754676__Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), ACM, 2015, pp. 153–60, doi:10.1145/2739480.2754676.

Hamann, Heiko, et al. “Evolving Collective Behaviors With Diverse But Predictable Sensor States.”10.7551/978-0-262-33027-5-ch036__13th European Conference on Artificial Life (ECAL 2015), MIT Press, 2015, p. 174, doi:10.7551/978-0-262-33027-5-ch036.

Hamann, Heiko, et al. “Probabilistic Modeling of Swarming Systems.”10.1007/978-3-662-43505-2_74__Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–31, doi:10.1007/978-3-662-43505-2_74.

Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error Detection and Correction.” First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.

Hamann, Heiko, et al. “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms.” Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–17.

Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes in Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood Sizes.”10.1007/s11721-015-0108-8__Swarm Intelligence, 2015, pp. 153–76, doi:10.1007/s11721-015-0108-8.

Dorigo, Marco, et al. “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off.” Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.

Dorigo, Marco, et al. “Self-Organized Collective Decisions in a Robot Swarm.” AAAI-15 Video Proceedings, 2015.

Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.”10.1145/2767386.2767454__Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.

Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015.

Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.”10.1145/2614687__Transactions on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.

Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015.

Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015.

Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn, 2015.

Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.”10.1007/978-3-662-48433-3_14__Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14.

Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.”10.1007/978-3-319-21840-3_45__Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.