Disaggregating User Evaluations Using the Shapley Value
M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6.

Towards Flexible Demands in Online Leasing Problems. 
S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.

Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks
F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018).

Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets
H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018.

An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018.

Scheduling with interjob communication on parallel processors
J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379.

Congestion Games mit gewichteten Strategien
S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn, 2018.

Removing Undesirable Flows by Edge Deletion
G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma, A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International Publishing, Cham, 2018, pp. 217–232.

Measuring the efficiency of SDN mitigations against attacks on computer infrastructures
R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future Generation Computer Systems (2018).

Scheduling Shared Continuous Resources on Many-Cores
E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.

A Self-Stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.

Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.

Brief Announcement: Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.

Brief Announcement: Communication in Systems of Home Based Mobile Agents
F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018.

A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension
M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.

Mobile Facility Leasing
M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.

Online Algorithmen für das k-Page Migration Problem
P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.

Congestion games with mixed objectives
M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.

Pure Nash Equilibria in Robust Congestion Games via Potential Functions
A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions, Universität Paderborn, 2018.

Scenario-driven Strategy Analysis in a n-player Composition Game Model
M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018.

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.

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

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

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

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

Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)
J. Gausemeier, E. Bodden, F.  Dressler, R. Dumitrescu, F. Meyer auf der Heide, C. Scheytt, A. Trächtler, Wissenschaftsforum Intelligente Technische Systeme (WInTeSys), Paderborn, 2017.

Monitoring of Domain-Related Problems in Distributed Data Streams
P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.

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

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

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

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