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

Polevoy, G., &; de Weerdt, M. M. (2017). Reciprocation Effort Games. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer.
LibreCat: /record/17653

Polevoy, G., &; de Weerdt, M. M. (2017). Competition between Cooperative Projects. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer.
LibreCat: /record/17654

Fischer, M., Jung, D., &; Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. ArXiv:1702.03400.
LibreCat: /record/17811

Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &; Riechers, S. (2017). Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (Vol. 10787, pp. 207–222). Springer.https://doi.org/10.1007/978-3-319-89441-6 
LibreCat: /record/79
DOI: 10.1007/978-3-319-89441-6

Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &; Podlipyan, P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW) (pp. 139–150).https://doi.org/10.1007/978-3-319-59605-1_13 
LibreCat: /record/82
DOI: 10.1007/978-3-319-59605-1_13

Kling, P., Mäcker, A., Riechers, S., &; Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 123--132).https://doi.org/10.1145/3087556.3087578 
LibreCat: /record/59
DOI: 10.1145/3087556.3087578

Feldkord, B., Markarian, C., &; Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 17–31).https://doi.org/10.1007/978-3-319-71147-8_2 
LibreCat: /record/70
DOI: 10.1007/978-3-319-71147-8_2

Podlipyan, P. (2017). Local Algorithms for the Continuous Gathering Problem. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-230 
LibreCat: /record/703
DOI: 10.17619/UNIPB/1-230

Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-231 
LibreCat: /record/704
DOI: 10.17619/UNIPB/1-231

Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &; Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization, 36(4), 1168–1194.https://doi.org/10.1007/s10878-017-0198-x 
LibreCat: /record/706
DOI: 10.1007/s10878-017-0198-x

van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H., &; Engels, G. (2017). From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW) (pp. 379–385). Piscataway, NJ, USA: IEEE.https://doi.org/10.1109/REW.2017.26 
LibreCat: /record/97
DOI: 10.1109/REW.2017.26

Feldkord, B., &; Meyer auf der Heide, F. (2017). The Mobile Server Problem. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 313–319).https://doi.org/10.1145/3087556.3087575 
LibreCat: /record/55
DOI: 10.1145/3087556.3087575

Drees, M., Feldotto, M., Riechers, S., &; Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) (pp. 175--187).https://doi.org/10.1007/978-3-319-62389-4_15 
LibreCat: /record/66
DOI: 10.1007/978-3-319-62389-4_15

Nowack, J. (2017). On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn.
LibreCat: /record/695

Gausemeier, J., Bodden, E.,  Dressler, F., Dumitrescu, R., Meyer auf der Heide, F., Scheytt, C., &; Trächtler, A. (2017). Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn.
LibreCat: /record/16444

Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J. S., &; Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In Structural Information and Communication Complexity.https://doi.org/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, S. (2017). Sortieren dynamischer Daten. Universität Paderborn.
LibreCat: /record/1073

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

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

Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn.
LibreCat: /record/1081

Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., &; Skopalik, A. (2017). Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST) (pp. 462–467).https://doi.org/10.1007/978-3-319-59144-5_32 
LibreCat: /record/1094
DOI: 10.1007/978-3-319-59144-5_32

John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., &; Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In Proceedings of the 25th European Conference on Information Systems (ECIS) (pp. 2970–2979).
LibreCat: /record/1095

Antoniadis, A., Kling, P., Ott, S., &; Riechers, S. (2017). Continuous Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer Science, 1–13.https://doi.org/10.1016/j.tcs.2017.03.021 
LibreCat: /record/110
DOI: 10.1016/j.tcs.2017.03.021

Brandt, S., Fischer, M., Gerges, M., Jähn, C., &; Berssenbrügge, J. (2017). Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In Volume 1: 37th Computers and Information in Engineering Conference (Vol. 1, pp. 91:1-91:10). Cleveland, USA.https://doi.org/10.1115/detc2017-67528 
LibreCat: /record/16338
DOI: 10.1115/detc2017-67528

Brandt, S., &; Fischer, M. (2017). Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 (Vol. 369, pp. 415–427). Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/16339

Fischer, M., Jung, D., &; Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro, &; Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS (Vol. 10718, pp. 168–181). Vienna, Austria: Springer.https://doi.org/10.1007/978-3-319-72751-6_13 
LibreCat: /record/16347
DOI: 10.1007/978-3-319-72751-6_13

Biermeier, F., Feldkord, B., Malatyali, M., &; Meyer auf der Heide, F. (2017). A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (pp. 285–300). Springer.https://doi.org/10.1007/978-3-319-89441-6_21 
LibreCat: /record/16348
DOI: 10.1007/978-3-319-89441-6_21

Podlipyan, P., Li, S., Markarian, C., &; Meyer auf der Heide, F. (2017). A Continuous Strategy for Collisionless Gathering. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) (pp. 182–197).https://doi.org/10.1007/978-3-319-72751-6_14  
LibreCat: /record/16349
DOI: 10.1007/978-3-319-72751-6_14 

Wahby, M., Hofstadler, D. N., Heinrich, M. K., Zahadat, P., &; Hamann, H. (2016). An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap. In Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems.https://doi.org/10.1109/saso.2016.8 
LibreCat: /record/19961
DOI: 10.1109/saso.2016.8

Heinrich, M. K., Wahby, M., Divband Soorati, M., Hofstadler, D. N., Zahadat, P., Ayres, P.,https://doi.org/10.1109/fas-w.2016.43__Hamann, H. (2016). Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures. In Proc. of the 1st International Workshop on Self-Organising Construction (SOCO).https://doi.org/10.1109/fas-w.2016.43 
LibreCat: /record/19968
DOI: 10.1109/fas-w.2016.43