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.
LibreCat: /record/2831
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.
LibreCat: /record/2848
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.
LibreCat: /record/2849
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.
LibreCat: /record/2850
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.
LibreCat: /record/24396
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.
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, 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.
LibreCat: /record/17651

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.
LibreCat: /record/17666
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.
LibreCat: /record/63
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.
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

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

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.
LibreCat: /record/4565
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.
LibreCat: /record/7570
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.
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

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

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

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.
LibreCat: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

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

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

Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018.
LibreCat: /record/1188

Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-271.
LibreCat: /record/1209
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.
LibreCat: /record/16392
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.
LibreCat: /record/1369
DOI: 10.1007/s10878-018-0269-7

Li, Shouwei. Parallel Fixed Parameter Tractable Problems. 2017, doi:10.17619/UNIPB/1-252.
LibreCat: /record/19604
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.
LibreCat: /record/2851
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.
LibreCat: /record/24398
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.
LibreCat: /record/112
DOI: 10.1007/978-3-319-57586-5_19
arXiv: 1701.07304

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.
LibreCat: /record/113
DOI: 10.1007/978-3-319-71924-5_14
arXiv: 1710.01634

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

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

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

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.
LibreCat: /record/79
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.
LibreCat: /record/82
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.
LibreCat: /record/59
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.
LibreCat: /record/70
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.
LibreCat: /record/703
DOI: 10.17619/UNIPB/1-230

Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-231.
LibreCat: /record/704
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.
LibreCat: /record/706
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.
LibreCat: /record/97
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.
LibreCat: /record/55
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.
LibreCat: /record/66
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.
LibreCat: /record/695

Gausemeier, Jürgen, et al. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). 2017.
LibreCat: /record/16444

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.
LibreCat: /record/16461
DOI: 10.1007/978-3-319-72050-0_13
arXiv: arXiv:1706.03568 

Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017.
LibreCat: /record/1073

Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.
LibreCat: /record/1074

Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.
LibreCat: /record/1080

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

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

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.
LibreCat: /record/110
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.
LibreCat: /record/16338
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.
LibreCat: /record/16339

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.
LibreCat: /record/16347
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.
LibreCat: /record/16348
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 .
LibreCat: /record/16349
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.
LibreCat: /record/19961
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.
LibreCat: /record/19968
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.
LibreCat: /record/19969
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.
LibreCat: /record/19979
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.
LibreCat: /record/19983
DOI: 10.1007/s10458-015-9323-3

Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.
LibreCat: /record/200

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.
LibreCat: /record/20000
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.
LibreCat: /record/20001
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.
LibreCat: /record/20002
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.
LibreCat: /record/20003

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.
LibreCat: /record/20004
DOI: 10.1007/978-3-319-44427-7_6

Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.
LibreCat: /record/210

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.
LibreCat: /record/215
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.
LibreCat: /record/17655
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.
LibreCat: /record/17656

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.
LibreCat: /record/177
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.
LibreCat: /record/187
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.
LibreCat: /record/207
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.
LibreCat: /record/209
DOI: 10.1007/978-3-319-48749-6_47
arXiv: 1607.05143

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

Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.
LibreCat: /record/5407

Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.
LibreCat: /record/688

Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.
LibreCat: /record/689

Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.
LibreCat: /record/16450
arXiv: 1602.03303

Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.”10.1007/978-3-319-30668-1_18__Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293, doi:10.1007/978-3-319-30668-1_18.
LibreCat: /record/169
DOI: 10.1007/978-3-319-30668-1_18

Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.
LibreCat: /record/1082

Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
LibreCat: /record/154

König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”10.1007/978-3-319-48749-6_41__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41.
LibreCat: /record/157
DOI: 10.1007/978-3-319-48749-6_41

Harks, Tobias, et al. “Routing Games With Progressive Filling.”10.1109/TNET.2015.2468571__IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.
LibreCat: /record/159
DOI: 10.1109/TNET.2015.2468571

Drees, Maximilian, et al. “Strategic Online Facility Location.”10.1007/978-3-319-48749-6_43__Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.
LibreCat: /record/149
DOI: 10.1007/978-3-319-48749-6_43

Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016, doi:10.1145/2942358.
LibreCat: /record/163
DOI: 10.1145/2942358

Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.”10.1007/978-3-319-49487-6_7 __Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 .
LibreCat: /record/16351
DOI: 10.1007/978-3-319-49487-6_7 

Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.”10.1007/978-3-319-53058-1_5 __Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016, doi:10.1007/978-3-319-53058-1_5 .
LibreCat: /record/16358
DOI: 10.1007/978-3-319-53058-1_5 

Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.”10.1145/2935764.2935789__Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.
LibreCat: /record/16359
DOI: 10.1145/2935764.2935789

Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”10.1109/IPDPS.2016.51__Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.
LibreCat: /record/16360
DOI: 10.1109/IPDPS.2016.51

Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.”10.1109/ipdps.2016.91__2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91.
LibreCat: /record/16364
DOI: 10.1109/ipdps.2016.91

Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016.
LibreCat: /record/16396
arXiv: 1609.01184

Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.”10.1007/s10878-015-9915-5__Journal of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
LibreCat: /record/139
DOI: 10.1007/s10878-015-9915-5

Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.”10.1007/978-3-319-42634-1_8__Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.
LibreCat: /record/143
DOI: 10.1007/978-3-319-42634-1_8

Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.”10.1002/cpe.3716__Concurrency and Computation: Practice and Experience, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.
LibreCat: /record/145
DOI: 10.1002/cpe.3716

Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015.
LibreCat: /record/251

Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.”10.1007/978-3-319-16549-3_61__Applications of Evolutionary Computation (EvoApplications 2015), 2015, doi:10.1007/978-3-319-16549-3_61.
LibreCat: /record/19959
DOI: 10.1007/978-3-319-16549-3_61