Learning deterministic bandit behaviour form compositions
J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018.

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

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

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

Parallel fixed parameter tractable problems
S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn, 2017.

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

Scheduling Access to Shared Space in Multi-robot Systems
Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham, 2017.

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

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

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

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

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

Gathering Anonymous, Oblivious Robots on a Grid
M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017).

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

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

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

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

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

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

Cost-efficient Scheduling on Machines from the Cloud
A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2017) 1168–1194.