Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.”https://doi.org/10.1145/3350755.3400281__In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.https://doi.org/10.1145/3350755.3400281 .

Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.”https://doi.org/10.1145/3350755.3400263__In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.https://doi.org/10.1145/3350755.3400263 .

Braun, Michael, Jannik Castenow, and Friedhelm Meyer auf der Heide. “Local Gathering of Mobile Robots in Three Dimensions.”https://doi.org/10.1007/978-3-030-54921-3_4__In Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Springer, 2020.https://doi.org/10.1007/978-3-030-54921-3_4 .

Feldkord, Björn. Mobile Resource Allocation. Universität Paderborn, 2020.https://doi.org/10.17619/UNIPB/1-869 .

Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.”https://doi.org/10.1162/evco_a_00266__Evolutionary Computation 28, no. 2 (2020): 165–193.https://doi.org/10.1162/evco_a_00266 .

Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM, n.d.

Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.”https://doi.org/10.1016/j.tcs.2020.02.018__Theoretical Computer Science 815 (2020): 289–309.https://doi.org/10.1016/j.tcs.2020.02.018 .

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

Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.”https://doi.org/10.1007/s12599-019-00627-x__Business &; Information Systems Engineering 62, no. 6 (2020): 467–81.https://doi.org/10.1007/s12599-019-00627-x .

Baswana, Surender, Shiv Gupta, and Ayush Tulsyan. “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.”https://doi.org/10.4230/LIPICS.MFCS.2019.65__In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 65:1--65:16. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019.https://doi.org/10.4230/LIPICS.MFCS.2019.65 .

Koning, Ralph, Gleb Polevoy, Lydia Meijer, Cees de Laat, and Paola Grosso. “Approaches for Collaborative Security Defences in Multi Network Environments.”https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9__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), 113–23. 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.https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9 .

Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019.https://doi.org/10.17619/UNIPB/1-766 .

Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn, 2019.https://doi.org/10.17619/UNIPB/1-588 .

Jansen, Klaus, Marten Maack, and Alexander Mäcker. “Scheduling on (Un-)Related Machines with Setup Times.” In Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 145–54. IEEE, 2019.

Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser, and Bart de Keijzer. “Multi-Unit Bilateral Trade.”https://doi.org/10.1609/aaai.v33i01.33011973__In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019.https://doi.org/10.1609/aaai.v33i01.33011973 .

Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.”https://doi.org/10.1007/978-3-030-39479-0_9__In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 120–37. Springer, 2019.https://doi.org/10.1007/978-3-030-39479-0_9 .

Mäcker, Alexander. On Scheduling with Setup Times. Universität Paderborn, 2019.https://doi.org/10.17619/UNIPB/1-828 .

Brandt, Sascha, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019.

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”https://doi.org/10.1145/3364204__ACM Transactions on Parallel Computing (TOPC) 6, no. 3 (2019).https://doi.org/10.1145/3364204 .

Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln.”https://doi.org/10.1007/s00591-019-00249-0__Mathematische Semesterberichte 66, no. 2 (2019): 259–60.https://doi.org/10.1007/s00591-019-00249-0 .

Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.”https://doi.org/10.1007/978-3-030-11072-7‑13__In Distributed Computing by Mobile Entities, Current Research in Moving and Computing, 11340:317–34. Lecture Notes in Computer Science. Springer, 2019.https://doi.org/10.1007/978-3-030-11072-7‑13 .

Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.”https://doi.org/10.5220/0007369503150321__In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 315–21. SciTePress, 2019.https://doi.org/10.5220/0007369503150321 .

Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized Problems.”https://doi.org/10.1016/j.tcs.2018.11.006__Theoretical Computer Science 786 (2019): 2–12.https://doi.org/10.1016/j.tcs.2018.11.006 .

Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.”https://doi.org/10.1007/978-3-030-24922-9‑26__In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019.https://doi.org/10.1007/978-3-030-24922-9‑26 .

Feldotto, Matthias, Pascal  Lenzner, Louise Molitor, and Alexander Skopalik. “From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 1949--1951. International Foundation for Autonomous Agents and Multiagent Systems, 2019.

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

Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amithttps://doi.org/10.4230/LIPIcs.ICALP.2018.51__Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.”https://doi.org/10.4230/LIPIcs.ICALP.2018.51__In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.https://doi.org/10.4230/LIPIcs.ICALP.2018.51 .

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.”https://doi.org/10.1145/3210377.3210389__In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 373–81. ACM, 2018.https://doi.org/10.1145/3210377.3210389 .

Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems, 2018.

Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994, 2018.

Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.”https://doi.org/10.1145/3230654.3230659__In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 5:1-5:6, 2018.https://doi.org/10.1145/3230654.3230659 .

Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards Flexible Demands in Online Leasing Problems. .”https://doi.org/10.1007/s00453-018-0420-y__Algorithmica 80, no. 5 (2018): 1556–1574.https://doi.org/10.1007/s00453-018-0420-y .

Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.”https://doi.org/10.1007/s00224-017-9836-z__Theory of Computing Systems, 2018.https://doi.org/10.1007/s00224-017-9836-z .

Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, &; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.”https://doi.org/10.4230/LIPIcs.FUN.2018.22__In Ninth International Conference on Fun with Algorithms (FUN), 2018.https://doi.org/10.4230/LIPIcs.FUN.2018.22 .

Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.”https://doi.org/10.1007/978-3-319-94667-2_18__In International Workshop on Combinatorial Algorithms (IWOCA). Cham, 2018.https://doi.org/10.1007/978-3-319-94667-2_18 .

König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.”https://doi.org/10.1007/s10878-018-0325-3__Journal of Combinatorial Optimization 36, no. 4 (2018): 1356–79.https://doi.org/10.1007/s10878-018-0325-3 .

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

Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In Combinatorial Optimization and Applications, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.

Koning, R., B. de Graaff, Gleb Polevoy, R. Meijer, C. de Laat, and P. Grosso. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.”https://doi.org/10.1016/j.future.2018.08.011__Future Generation Computer Systems, 2018.https://doi.org/10.1016/j.future.2018.08.011 .

Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.”https://doi.org/10.1007/s10951-017-0518-0__Journal of Scheduling 21, no. 1 (2018): 77–92.https://doi.org/10.1007/s10951-017-0518-0 .

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”https://doi.org/10.1007/978-3-030-03232-6_1__In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018.https://doi.org/10.1007/978-3-030-03232-6_1 .

Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018.

Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.”https://doi.org/10.1145/3210377.3210663__In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018.https://doi.org/10.1145/3210377.3210663 .

Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.”https://doi.org/10.1145/3210377.3210662__In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press, 2018.https://doi.org/10.1145/3210377.3210662 .

Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.”https://doi.org/10.1007/978-3-030-19759-9_4__In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.https://doi.org/10.1007/978-3-030-19759-9_4 .

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

Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.

Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.”https://doi.org/10.1007/s10878-017-0189-y__Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67.https://doi.org/10.1007/s10878-017-0189-y .

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

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