Koning, R., Polevoy, G., Meijer, L., de Laat, C., &; Grosso, P. (2019). Approaches for Collaborative Security Defences in Multi Network Environments. 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) (pp. 113–123).https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9 
LibreCat: /record/17667
DOI: 10.1109/CSCloud/EdgeCom.2019.000-9

Malatyali, M. (2019). Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-766 
LibreCat: /record/18975
DOI: 10.17619/UNIPB/1-766

Feldotto, M. (2019). Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-588 
LibreCat: /record/8080
DOI: 10.17619/UNIPB/1-588

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

Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., &; de Keijzer, B. (2019).https://doi.org/10.1609/aaai.v33i01.33011973__Multi-unit Bilateral Trade. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA.https://doi.org/10.1609/aaai.v33i01.33011973 
LibreCat: /record/5471
DOI: 10.1609/aaai.v33i01.33011973

Feldkord, B., Knollmann, T., Malatyali, M., &; Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer.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, A. (2019). On Scheduling with Setup Times. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-828 
LibreCat: /record/14851
DOI: 10.17619/UNIPB/1-828

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

Feldkord, B., &; Meyer auf der Heide, F. (2019). The Mobile Server Problem. ACM Transactions on Parallel Computing (TOPC), 6(3).https://doi.org/10.1145/3364204 
LibreCat: /record/13873
DOI: 10.1145/3364204

Meyer auf der Heide, F. (2019). Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. Mathematische Semesterberichte, 66(2), 259–260.https://doi.org/10.1007/s00591-019-00249-0 
LibreCat: /record/13937
DOI: 10.1007/s00591-019-00249-0

Kling, P., &; Meyer auf der Heide, F. (2019). Continuous Protocols for Swarm Robotics. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing (Vol. 11340, pp. 317–334). Springer.https://doi.org/10.1007/978-3-030-11072-7‑13 
LibreCat: /record/13939
DOI: 10.1007/978-3-030-11072-7‑13

Markarian, C., &; Meyer auf der Heide, F. (2019). Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems (pp. 315–321). SciTePress.https://doi.org/10.5220/0007369503150321 
LibreCat: /record/13942
DOI: 10.5220/0007369503150321

Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &; Podlipyan, P. (2019). Efficient parallel algorithms for parameterized problems. Theoretical Computer Science, 786, 2–12.https://doi.org/10.1016/j.tcs.2018.11.006 
LibreCat: /record/13946
DOI: 10.1016/j.tcs.2018.11.006

Castenow, J., Kolb, C., &; Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy.https://doi.org/10.1007/978-3-030-24922-9‑26 
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

Feldotto, M., Lenzner, P., Molitor, L., &; Skopalik, A. (2019).  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 (pp. 1949--1951). Montreal QC, Canada: International Foundation for Autonomous Agents and Multiagent Systems.
LibreCat: /record/10281

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

Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., &; Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, &; D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2018.51 
LibreCat: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

Feldkord, B., &; Meyer auf der Heide, F. (2018). Online Facility Location with Mobile Facilities. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 373–381). Wien: ACM.https://doi.org/10.1145/3210377.3210389 
LibreCat: /record/2485
DOI: 10.1145/3210377.3210389

Liedtke, D. J. (2018). Influence of Stationary Robots on Continuous Robot Formation Problems.
LibreCat: /record/25121

Markarian, C. (2018). Online Connected Dominating Set Leasing. ArXiv:1805.02994.
LibreCat: /record/19978

Feldotto, M., Haake, C.-J., Skopalik, A., &; Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6). Irvine, California, USA.https://doi.org/10.1145/3230654.3230659 
LibreCat: /record/2831
DOI: 10.1145/3230654.3230659

Li, S., Markarian, C., &; Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574.https://doi.org/10.1007/s00453-018-0420-y 
LibreCat: /record/2848
DOI: 10.1007/s00453-018-0420-y

Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &; Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems.https://doi.org/10.1007/s00224-017-9836-z 
LibreCat: /record/2849
DOI: 10.1007/s00224-017-9836-z

Hamann, H., Markarian, C., Meyer auf der Heide, F., &; Wahby, M. (2018). Pick, Pack, &; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In Ninth International Conference on Fun with Algorithms (FUN).https://doi.org/10.4230/LIPIcs.FUN.2018.22 
LibreCat: /record/2850
DOI: 10.4230/LIPIcs.FUN.2018.22

Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA).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., Mäcker, A., Meyer auf der Heide, F., &; Riechers, S. (2018). Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization, 36(4), 1356–1379.https://doi.org/10.1007/s10878-018-0325-3 
LibreCat: /record/3551
DOI: 10.1007/s10878-018-0325-3

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

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

Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., &; Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems.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, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., Sgall, J., &; Suess, T. (2018). Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92.https://doi.org/10.1007/s10951-017-0518-0 
LibreCat: /record/63
DOI: 10.1007/s10951-017-0518-0

Knollmann, T., &; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &; P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham.https://doi.org/10.1007/978-3-030-03232-6_1 
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

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

Jung, D., Kolb, C., Scheideler, C., &; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press.https://doi.org/10.1145/3210377.3210663 
LibreCat: /record/4565
DOI: 10.1145/3210377.3210663

Meyer auf der Heide, F., &; Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. Vienna: ACM Press.https://doi.org/10.1145/3210377.3210662 
LibreCat: /record/7570
DOI: 10.1145/3210377.3210662

Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki.https://doi.org/10.1007/978-3-030-19759-9_4 
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn.
LibreCat: /record/5403

Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn.
LibreCat: /record/5404

Feldotto, M., Leder, L., &; Skopalik, A. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167.https://doi.org/10.1007/s10878-017-0189-y 
LibreCat: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn.
LibreCat: /record/1186

Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn.
LibreCat: /record/1187

Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn.
LibreCat: /record/1188

Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-271 
LibreCat: /record/1209
DOI: 10.17619/UNIPB/1-271

Feldkord, B., Malatyali, M., &; Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham.https://doi.org/10.1007/978-3-319-98355-4_18 
LibreCat: /record/16392
DOI: 10.1007/978-3-319-98355-4_18

Drees, M., Feldotto, M., Riechers, S., &; Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization.https://doi.org/10.1007/s10878-018-0269-7 
LibreCat: /record/1369
DOI: 10.1007/s10878-018-0269-7

Li, S. (2017). Parallel fixed parameter tractable problems. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-252 
LibreCat: /record/19604
DOI: 10.17619/UNIPB/1-252

Markarian, C. (2017). Leasing with Uncertainty. In International Conference on Operations Research (OR). Berlin.https://doi.org/10.1007/978-3-319-89920-6_57 
LibreCat: /record/2851
DOI: 10.1007/978-3-319-89920-6_57

Khaluf, Y., Markarian, C., Simoens, P., &; Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017).https://doi.org/10.1007/978-3-319-59930-4_12 
LibreCat: /record/24398
DOI: 10.1007/978-3-319-59930-4_12

Feldotto, M., Leder, L., &; Skopalik, A. (2017). Congestion Games with Complementarities. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) (pp. 222--233).https://doi.org/10.1007/978-3-319-57586-5_19 
LibreCat: /record/112
DOI: 10.1007/978-3-319-57586-5_19
arXiv: 1701.07304

Feldotto, M., Gairing, M., Kotsialou, G., &; Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In Proceedings of the 13th International Conference on Web and Internet Economics (WINE).https://doi.org/10.1007/978-3-319-71924-5_14 
LibreCat: /record/113
DOI: 10.1007/978-3-319-71924-5_14
arXiv: 1710.01634

Polevoy, G., Trajanovski, S., Grosso, P., &; de Laat, C. (2017). Filtering Undesirable Flows in Networks. In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I (pp. 3–17). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-71150-8_1 
LibreCat: /record/17652
DOI: 10.1007/978-3-319-71150-8_1