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.https://doi.org/10.17619/UNIPB/1-271 .
LibreCat: /record/1209
DOI: 10.17619/UNIPB/1-271

Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.”https://doi.org/10.1007/978-3-319-98355-4_18__In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham, 2018.https://doi.org/10.1007/978-3-319-98355-4_18 .
LibreCat: /record/16392
DOI: 10.1007/978-3-319-98355-4_18

Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.”https://doi.org/10.1007/s10878-018-0269-7__Journal of Combinatorial Optimization, 2018.https://doi.org/10.1007/s10878-018-0269-7 .
LibreCat: /record/1369
DOI: 10.1007/s10878-018-0269-7

Li, Shouwei. Parallel Fixed Parameter Tractable Problems. Universität Paderborn, 2017.https://doi.org/10.17619/UNIPB/1-252 .
LibreCat: /record/19604
DOI: 10.17619/UNIPB/1-252

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

Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina. “Scheduling Access to Shared Space in Multi-Robot Systems.”https://doi.org/10.1007/978-3-319-59930-4_12__In International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). Cham, 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, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.”https://doi.org/10.1007/978-3-319-57586-5_19__In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017.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, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.”https://doi.org/10.1007/978-3-319-71924-5_14__In Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.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, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.”https://doi.org/10.1007/978-3-319-71150-8_1__In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017.https://doi.org/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.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017.
LibreCat: /record/17653

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

Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
LibreCat: /record/17811

Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.”https://doi.org/10.1007/978-3-319-89441-6__In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 10787:207–22. Lecture Notes in Computer Science. Springer, 2017.https://doi.org/10.1007/978-3-319-89441-6 .
LibreCat: /record/79
DOI: 10.1007/978-3-319-89441-6

Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.”https://doi.org/10.1007/978-3-319-59605-1_13__In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 139–50. LNCS, 2017.https://doi.org/10.1007/978-3-319-59605-1_13 .
LibreCat: /record/82
DOI: 10.1007/978-3-319-59605-1_13

Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.”https://doi.org/10.1145/3087556.3087578__In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017.https://doi.org/10.1145/3087556.3087578 .
LibreCat: /record/59
DOI: 10.1145/3087556.3087578

Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide. “Price Fluctuations in Online Leasing.”https://doi.org/10.1007/978-3-319-71147-8_2__In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 17–31, 2017.https://doi.org/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.https://doi.org/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.https://doi.org/10.17619/UNIPB/1-231 .
LibreCat: /record/704
DOI: 10.17619/UNIPB/1-231

Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.”https://doi.org/10.1007/s10878-017-0198-x__Journal of Combinatorial Optimization 36, no. 4 (2017): 1168–94.https://doi.org/10.1007/s10878-017-0198-x .
LibreCat: /record/706
DOI: 10.1007/s10878-017-0198-x