Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.”10.1109/CSCloud/EdgeCom.2019.000-9__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–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.

Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. 2019, doi:10.17619/UNIPB/1-766.

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

Jansen, Klaus, et al. “Scheduling on (Un-)Related Machines with Setup Times.” Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2019, pp. 145–54.

Lazos, Philip, et al. “Multi-Unit Bilateral Trade.”10.1609/aaai.v33i01.33011973__Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019, doi:10.1609/aaai.v33i01.33011973.

Feldkord, Björn, et al. “Managing Multiple Mobile Resources.”10.1007/978-3-030-39479-0_9__Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.

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

Brandt, Sascha, et al. “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.”10.1145/3364204__ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 14, 2019, 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.”10.1007/s00591-019-00249-0__Mathematische Semesterberichte, vol. 66, no. 2, 2019, pp. 259–60, doi:10.1007/s00591-019-00249-0.

Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.”10.1007/978-3-030-11072-7‑13__Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–34, 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.”10.5220/0007369503150321__Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–21, doi:10.5220/0007369503150321.

Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.”10.1016/j.tcs.2018.11.006__Theoretical Computer Science, vol. 786, 2019, pp. 2–12, doi:10.1016/j.tcs.2018.11.006.

Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.”10.1007/978-3-030-24922-9‑26__Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9‑26.

Feldotto, Matthias, et al. “From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.

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

Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”10.4230/LIPIcs.ICALP.2018.51__45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.”10.1145/3210377.3210389__Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi: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, et al. “Disaggregating User Evaluations Using the Shapley Value.”10.1145/3230654.3230659__Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.

Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .”10.1007/s00453-018-0420-y__Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.

Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.”10.1007/s00224-017-9836-z__Theory of Computing Systems, Springer, 2018, doi:10.1007/s00224-017-9836-z.

Hamann, Heiko, et al. “Pick, Pack, &; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.”10.4230/LIPIcs.FUN.2018.22__Ninth International Conference on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.

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

König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”10.1007/s10878-018-0325-3__Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79, doi:10.1007/s10878-018-0325-3.

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

Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial Optimization and Applications, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.

Koning, R., et al. “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, doi:https://doi.org/10.1016/j.future.2018.08.011.

Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.”10.1007/s10951-017-0518-0__Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.

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

Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.

Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.”10.1145/3210377.3210663__Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.

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

Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.”10.1007/978-3-030-19759-9_4__Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi: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, et al. “Congestion Games with Mixed Objectives.”10.1007/s10878-017-0189-y__Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi: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.

Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018.

Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-271.

Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.”10.1007/978-3-319-98355-4_18__Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.

Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”10.1007/s10878-018-0269-7__Journal of Combinatorial Optimization, Springer Nature, 2018, doi:10.1007/s10878-018-0269-7.

Li, Shouwei. Parallel Fixed Parameter Tractable Problems. 2017, doi:10.17619/UNIPB/1-252.

Markarian, Christine. “Leasing with Uncertainty.”10.1007/978-3-319-89920-6_57__International Conference on Operations Research (OR), 2017, doi:10.1007/978-3-319-89920-6_57.

Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.”10.1007/978-3-319-59930-4_12__International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), 2017, doi:10.1007/978-3-319-59930-4_12.

Feldotto, Matthias, et al. “Congestion Games with Complementarities.”10.1007/978-3-319-57586-5_19__Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19.

Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.”10.1007/978-3-319-71924-5_14__Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14.

Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.”10.1007/978-3-319-71150-8_1__Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-71150-8_1.

Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.

Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.

Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.

Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.”10.1007/978-3-319-89441-6__Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6.

Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.”10.1007/978-3-319-59605-1_13__Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–50, doi:10.1007/978-3-319-59605-1_13.

Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.”10.1145/3087556.3087578__Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578.

Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.”10.1007/978-3-319-71147-8_2__Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2.

Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-230.

Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-231.

Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”10.1007/s10878-017-0198-x__Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:10.1007/s10878-017-0198-x.

van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.”10.1109/REW.2017.26__2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, 2017, pp. 379–85, doi:10.1109/REW.2017.26.

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”10.1145/3087556.3087575__Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.

Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”10.1007/978-3-319-62389-4_15__Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.

Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017.

Gausemeier, Jürgen, et al. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). 2017.

Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.”10.1007/978-3-319-72050-0_13__Structural Information and Communication Complexity, 2017, doi:10.1007/978-3-319-72050-0_13.

Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017.

Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.

Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.

Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.

Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.”10.1007/978-3-319-59144-5_32__Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–67, doi:10.1007/978-3-319-59144-5_32.

John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–79.

Antoniadis, Antonios, et al. “Continuous Speed Scaling with Variability: A Simple and Direct Approach.”10.1016/j.tcs.2017.03.021__Theoretical Computer Science, Elsevier, 2017, pp. 1–13, doi:10.1016/j.tcs.2017.03.021.

Brandt, Sascha, et al. “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.”10.1115/detc2017-67528__Volume 1: 37th Computers and Information in Engineering Conference, vol. 1, 2017, pp. 91:1-91:10, doi:10.1115/detc2017-67528.

Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell.” Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, vol. 369, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017, pp. 415–27.

Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”10.1007/978-3-319-72751-6_13__Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS, edited by Antonio Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13.

Biermeier, Felix, et al. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.”10.1007/978-3-319-89441-6_21__Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300, doi:10.1007/978-3-319-89441-6_21.

Podlipyan, Pavel, et al. “A Continuous Strategy for Collisionless Gathering.”10.1007/978-3-319-72751-6_14 __Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–97, doi:10.1007/978-3-319-72751-6_14 .

Wahby, Mostafa, et al. “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap.”10.1109/saso.2016.8__Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016, doi:10.1109/saso.2016.8.

Heinrich, Mary Katherine, et al. “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures.”10.1109/fas-w.2016.43__Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016, doi:10.1109/fas-w.2016.43.

Hamann, Heiko, et al. “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-Organizing Systems.”10.3389/frobt.2016.00014__Frontiers in Robotics and AI, 2016, doi:10.3389/frobt.2016.00014.

Hamann, Heiko, and Mohammad Divband Soorati. “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures.”10.1109/IROS.2016.7759845__IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016, doi:10.1109/IROS.2016.7759845.

Dorigo, Marco, et al. “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems.”10.1007/s10458-015-9323-3__Journal of Autonomous Agents and Multi-Agent Systems, vol. 30, no. 3, 2016, pp. 553–80, doi:10.1007/s10458-015-9323-3.

Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.

Hamann, Heiko, et al. “Population Coding: A New Design Paradigm for Embodied Distributed Systems.”10.1007/978-3-319-44427-7_15__10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016, doi:10.1007/978-3-319-44427-7_15.

von Mammen, Sebastian, et al. “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems.”10.1145/2993369.2993400__ACM Symposium on Virtual Reality Software and Technology (VRST), 2016, doi:10.1145/2993369.2993400.

Rybá, Milan, and Heiko Hamann. “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes.”10.1145/2908812.2908815__Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016, doi:10.1145/2908812.2908815.

Khaluf, Yara, and Heiko Hamann. “On the Definition of Self-Organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations.” ANTS 2016, vol. 9882, 2016, p. 298.

Valentini, Gabriele, et al. “Collective Perception of Environmental Features in a Robot Swarm.”10.1007/978-3-319-44427-7_6__10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016, doi:10.1007/978-3-319-44427-7_6.

Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.

Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.”10.1145/2935764.2935783__Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.

Polevoy, Gleb, et al. “The Game of Reciprocation Habits.”10.3233/978-1-61499-672-9-417__Proceedings of the 2016 European Conference on Artificial Intelligence, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.

Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32.

Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.”10.1007/978-3-319-48749-6_35__Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88, doi:10.1007/978-3-319-48749-6_35.

Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.”10.1145/2936716__Transactions on Parallel Computing (TOPC), no. 1, 2016, doi:10.1145/2936716.

Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”10.1007/978-3-319-48749-6_42__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.

Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.”10.1007/978-3-319-48749-6_47__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669, doi:10.1007/978-3-319-48749-6_47.

Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden. 2016.

Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.

Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.