A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location
M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.

A continuous strategy for collisionless gathering
S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.

The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 29–40.

The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen, E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer, 2021, pp. 289–304.

Full Version -- Server Cloud Scheduling
M. Maack, F. Meyer auf der Heide, S. Pukrop, ArXiv:2108.02109 (2021).

Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation
T.F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021.

Online k-Facility Reallocation using k-Server Algorithms
S. Pranger, Online K-Facility Reallocation Using k-Server Algorithms, 2021.

A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.

Mincut Sensitivity Data Structures for the Insertion of an Edge
S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.

Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility 
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes, N.  Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.

The Online Multi-Commodity Facility Location Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.

Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.

Local Gathering of Mobile Robots in Three Dimensions
M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020.

Mobile Resource Allocation
B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.

Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets
M.D. Wever, L. van Rooijen, H. Hamann, Evolutionary Computation 28 (2020) 165–193.

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.

Gathering Anonymous, Oblivious Robots on a Grid
J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.

Approximating Weighted Completion Time for Order Scheduling with Setup Times
S. Pukrop, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.

A Case for a New IT Ecosystem: On-The-Fly Computing
H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &; Information Systems Engineering 62 (2020) 467–481.

Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
S. Baswana, S. Gupta, A. Tulsyan, in: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16.

Approaches for Collaborative Security Defences in Multi Network Environments
R. Koning, G. Polevoy, L. Meijer, C. de Laat, P. Grosso, in: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–123.

Big Data: Sublinear Algorithms for Distributed Data Streams
M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams, Universität Paderborn, 2019.

Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games
M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games, Universität Paderborn, 2019.

Scheduling on (Un-)Related Machines with Setup Times
K. Jansen, M. Maack, A. Mäcker, in: Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2019, pp. 145–154.

 Multi-unit Bilateral Trade
P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019.

Managing Multiple Mobile Resources
B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–137.

On Scheduling with Setup Times
A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019.

Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels
S. Brandt, C. Jähn, M. Fischer, F. Meyer auf der Heide, ArXiv:1904.08225 (2019).

The Mobile Server Problem
B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (TOPC) 6 (2019).

Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln
F. Meyer auf der Heide, Mathematische Semesterberichte 66 (2019) 259–260.

Continuous Protocols for Swarm Robotics
P. Kling, F. Meyer auf der Heide, in: Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Springer, 2019, pp. 317–334.

Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location
C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–321.

Efficient parallel algorithms for parameterized problems
F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 786 (2019) 2–12.

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.

 From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation
M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.

Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine
S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine, Universität Paderborn, 2019.

Fully-Dynamic Bin Packing with Little Repacking
B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24.

Online Facility Location with Mobile Facilities
B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.

Influence of Stationary Robots on Continuous Robot Formation Problems
D.J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems, 2018.

Online Connected Dominating Set Leasing
C. Markarian, ArXiv:1805.02994 (2018).

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.

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

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

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

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

Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell
S. Brandt, M. Fischer, in: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Paderborn, 2017, pp. 415–427.

Gathering Anonymous, Oblivious Robots on a Grid
M. Fischer, D. Jung, F. Meyer auf der Heide, in: A. Fernández Anta, T. Jurdzinski, M.A. Mosteiro, Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS, Springer, Vienna, Austria, 2017, pp. 168–181.

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

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

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

Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures
M.K. Heinrich, M. Wahby, M. Divband Soorati, D.N. Hofstadler, P. Zahadat, P. Ayres, K. Stoy, H. Hamann, in: Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016.