J. Kempf, Learning deterministic bandit behaviour form compositions. Universität Paderborn, 2018.

D. Jung, Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018.

B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed Data Structure for Top-k and k-Select Queries,” in Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.

M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” Journal of Combinatorial Optimization, 2018.

S. Li, Parallel fixed parameter tractable problems. Universität Paderborn, 2017.

C. Markarian, “Leasing with Uncertainty,” in International Conference on Operations Research (OR), Berlin, 2017.

Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to Shared Space in Multi-robot Systems,”10.1007/978-3-319-59930-4_12__2017, doi:10.1007/978-3-319-59930-4_12 .

M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.

M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.

G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 2017, pp. 3–17.

G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.

G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.

M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” arXiv:1702.03400. 2017.

A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, vol. 10787, pp. 207–222.

F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,” in Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.

P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.

B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.

P. Podlipyan, Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017.

S. Riechers, Scheduling with Scarce Resources. Universität Paderborn, 2017.

A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1168–1194, 2017.

L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” in 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), Lisbon, Portugal, 2017, pp. 379–385.

B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.

M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.

J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017.

J. Gausemeier et al., Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn, 2017.

P. Bemmann et al., “Monitoring of Domain-Related Problems in Distributed Data Streams,” in Structural Information and Communication Complexity, Cham, 2017.

S. Nachtigall, Sortieren dynamischer Daten. Universität Paderborn, 2017.

S. Pukrop, Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.

J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.

V. R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.

M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, and A. Skopalik, “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App,” in Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.

T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.

A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling with Variability: A Simple and Direct Approach,” Theoretical Computer Science, pp. 1–13, 2017.

S. Brandt, M. Fischer, M. Gerges, C. Jähn, and J. Berssenbrügge, “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models,” in Volume 1: 37th Computers and Information in Engineering Conference, Cleveland, USA, 2017, vol. 1, pp. 91:1-91:10.

S. Brandt and M. Fischer, “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell,” in Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Paderborn, 2017, vol. 369, pp. 415–427.

M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” in Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS, 2017, vol. 10718, pp. 168–181.

F. Biermeier, B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, pp. 285–300.

P. Podlipyan, S. Li, C. Markarian, and F. Meyer auf der Heide, “A Continuous Strategy for Collisionless Gathering,” in Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–197.

M. Wahby, D. N. Hofstadler, M. K. Heinrich, P. Zahadat, and H. Hamann, “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap,” in Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016.

M. K. Heinrich et al., “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures,” in Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016.

H. Hamann et al., “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems,” Frontiers in Robotics and AI, 2016.

H. Hamann and M. Divband Soorati, “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures,” in IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016.

M. Dorigo, H. Hamann, G. Valentini, and E. Ferrante, “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems,” Journal of Autonomous Agents and Multi-Agent Systems, vol. 30, no. 3, pp. 553–580, 2016.

M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.

H. Hamann, G. Valentini, and M. Dorigo, “Population Coding: A New Design Paradigm for Embodied Distributed Systems,” in 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016.

S. von Mammen, H. Hamann, and M. Heider, “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems,” in ACM Symposium on Virtual Reality Software and Technology (VRST), 2016.

M. Rybá and H. Hamann, “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016.

Y. Khaluf and H. Hamann, “On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations,” in ANTS 2016, 2016, vol. 9882, p. 298.

G. Valentini, D. Brambilla, H. Hamann, and M. Dorigo, “Collective Perception of Environmental Features in a Robot Swarm,” in 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016.

L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn, 2016.

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.

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.

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.

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.

F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA 2014, no. 1. 2016.

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.

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.

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

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

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

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

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

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.

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

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

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

K. Pfannschmidt, Solving the aggregated bandits problem. Universität Paderborn, 2015.

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.

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.

H. Hamann, “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity,” Artificial Life, pp. 464–480, 2015.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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

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.

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

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.

J. Pautz, Budget Games with priced strategies. Universität Paderborn, 2015.

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

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

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.

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.