Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.”https://doi.org/10.4230/LIPIcs.STACS.2021.14__In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 14:1-14:17, 2021.https://doi.org/10.4230/LIPIcs.STACS.2021.14 .
LibreCat: /record/20817
DOI: 10.4230/LIPIcs.STACS.2021.14

Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “A Continuous Strategy for Collisionless Gathering.”https://doi.org/10.1016/j.tcs.2020.10.037__Theoretical Computer Science 852 (2021): 41–60.https://doi.org/10.1016/j.tcs.2020.10.037 .
LibreCat: /record/22510
DOI: 10.1016/j.tcs.2020.10.037

Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.”https://doi.org/10.1016/j.tcs.2020.11.009__Theoretical Computer Science 852 (2021): 29–40.https://doi.org/10.1016/j.tcs.2020.11.009 .
LibreCat: /record/22511
DOI: 10.1016/j.tcs.2020.11.009

Castenow, Jannik, Thorsten Götte, Till Knollmann, and Friedhelm Meyer auf der Heide. “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.”https://doi.org/10.1007/978-3-030-91081-5_19__In Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, edited by C. Johnen, E.M. Schiller, and S. Schmid, 13046:289–304. LNCS. Springer, 2021.https://doi.org/10.1007/978-3-030-91081-5_19 .
LibreCat: /record/26986
DOI: 10.1007/978-3-030-91081-5_19
arXiv: 2109.11856

Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Full Version -- Server Cloud Scheduling.” ArXiv:2108.02109, 2021.
LibreCat: /record/27778

Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021.
LibreCat: /record/44234

Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms, 2021.
LibreCat: /record/44233

Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.”https://doi.org/10.1007/978-3-030-64348-5_6__In Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, edited by Stéphanehttps://doi.org/10.1007/978-3-030-64348-5_6__Devismeshttps://doi.org/10.1007/978-3-030-64348-5_6__and Neerajhttps://doi.org/10.1007/978-3-030-64348-5_6__Mittal, 12514:65–80. Lecture Notes in Computer Science (LNCS). Springer, 2020.https://doi.org/10.1007/978-3-030-64348-5_6 .
LibreCat: /record/19899
DOI: 10.1007/978-3-030-64348-5_6
arXiv: 2010.02043 

Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.”https://doi.org/10.4230/LIPIcs.ESA.2020.12__In 28th Annual European Symposium on Algorithms (ESA 2020), edited by Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, 173:12:1-12:14. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.ESA.2020.12 .
LibreCat: /record/20159
DOI: 10.4230/LIPIcs.ESA.2020.12

Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &; Luminous Robots with Limited Visibility .”https://doi.org/10.1007/978-3-030-64348-5_5__In Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphanehttps://doi.org/10.1007/978-3-030-64348-5_5__Devismes and Neerajhttps://doi.org/10.1007/978-3-030-64348-5_5__Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020.https://doi.org/10.1007/978-3-030-64348-5_5 .
LibreCat: /record/20185
DOI: 10.1007/978-3-030-64348-5_5
arXiv: 2010.04424 

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 .
LibreCat: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

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 .
LibreCat: /record/17371
DOI: 10.1145/3350755.3400263
arXiv: 2010.02043 

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 .
LibreCat: /record/16968
DOI: 10.1007/978-3-030-54921-3_4
arXiv: arXiv:2005.07495

Feldkord, Björn. Mobile Resource Allocation. Universität Paderborn, 2020.https://doi.org/10.17619/UNIPB/1-869 .
LibreCat: /record/15631
DOI: 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 .
LibreCat: /record/15025
DOI: 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.
LibreCat: /record/15169

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 .
LibreCat: /record/16299
DOI: 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.
LibreCat: /record/13868

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 .
LibreCat: /record/13770
DOI: 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 .
LibreCat: /record/17432
DOI: 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 .
LibreCat: /record/17667
DOI: 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 .
LibreCat: /record/18975
DOI: 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 .
LibreCat: /record/8080
DOI: 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.
LibreCat: /record/8866

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 .
LibreCat: /record/5471
DOI: 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 .
LibreCat: /record/12870
DOI: 10.1007/978-3-030-39479-0_9
arXiv: 1907.09834

Mäcker, Alexander. On Scheduling with Setup Times. Universität Paderborn, 2019.https://doi.org/10.17619/UNIPB/1-828 .
LibreCat: /record/14851
DOI: 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.
LibreCat: /record/16341
arXiv: 1904.08225

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 .
LibreCat: /record/13873
DOI: 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 .
LibreCat: /record/13937
DOI: 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 .
LibreCat: /record/13939
DOI: 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 .
LibreCat: /record/13942
DOI: 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 .
LibreCat: /record/13946
DOI: 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 .
LibreCat: /record/14539
DOI: 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.
LibreCat: /record/10281

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

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 .
LibreCat: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

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 .
LibreCat: /record/2485
DOI: 10.1145/3210377.3210389

Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems, 2018.
LibreCat: /record/25121

Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994, 2018.
LibreCat: /record/19978

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 .
LibreCat: /record/2831
DOI: 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 .
LibreCat: /record/2848
DOI: 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 .
LibreCat: /record/2849
DOI: 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 .
LibreCat: /record/2850
DOI: 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 .
LibreCat: /record/24396
DOI: 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 .
LibreCat: /record/3551
DOI: 10.1007/s10878-018-0325-3

Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.
LibreCat: /record/3851

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.
LibreCat: /record/17651

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 .
LibreCat: /record/17666
DOI: 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 .
LibreCat: /record/63
DOI: 10.1007/s10951-017-0518-0