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.

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.

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.

VisibilityAware Progressive Farthest Point Sampling on the GPU
S. Brandt, C. Jähn, M. Fischer, F. Meyer auf der Heide, Computer Graphics Forum 38 (2019) 413–424.

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.

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.

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.

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.

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.

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.