Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

60 Publications

2018 | Conference Paper | LibreCat-ID: 17651
Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In Combinatorial Optimization and Applications, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.

2018 | Bachelorsthesis | LibreCat-ID: 1188
Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018.

2018 | Conference Paper | LibreCat-ID: 2484
Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.” In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.
LibreCat | Files available | DOI | arXiv

2018 | Bachelorsthesis | LibreCat-ID: 3851
Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.

2017 | Conference Paper | LibreCat-ID: 112
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017.
LibreCat | Files available | DOI | arXiv

2017 | Conference Paper | LibreCat-ID: 59
Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017.
LibreCat | Files available | DOI

2017 | Conference Paper | LibreCat-ID: 66
Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 175--187. LNCS, 2017.
LibreCat | Files available | DOI

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

2017 | Mastersthesis | LibreCat-ID: 1080
Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.

2017 | Bachelorsthesis | LibreCat-ID: 1073
Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017.

Filters and Search Terms



Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed