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.

731 Publications


2018 | Conference Paper | LibreCat-ID: 4565
D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018.
LibreCat | Files available | DOI
 

2018 | Bachelorsthesis | LibreCat-ID: 1187
M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn, 2018.
LibreCat
 

2018 | Journal Article | LibreCat-ID: 2849
F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” Theory of Computing Systems, 2018.
LibreCat | Files available | DOI
 

2018 | Journal Article | LibreCat-ID: 3551
J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1356–1379, 2018.
LibreCat | Files available | DOI
 

2018 | Journal Article | LibreCat-ID: 669
M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018.
LibreCat | Files available | DOI | arXiv
 

2018 | Journal Article | LibreCat-ID: 63
E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,” Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018.
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 17651
G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in Combinatorial Optimization and Applications, 2018, pp. 217–232.
LibreCat
 

2018 | Bachelorsthesis | LibreCat-ID: 1188
J. Kempf, Learning deterministic bandit behaviour form compositions. Universität Paderborn, 2018.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 2484
B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prag, 2018, vol. 107, pp. 51:1-51:24.
LibreCat | Files available | DOI | arXiv
 

2018 | Conference Paper | LibreCat-ID: 4411
T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.
LibreCat | Files available | DOI | arXiv
 

2018 | Conference Paper | LibreCat-ID: 2485
B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile Facilities,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018, pp. 373–381.
LibreCat | Files available | DOI
 

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

2018 | Bachelorsthesis | LibreCat-ID: 5403
M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 4563
D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Helsinki, 2018.
LibreCat | Files available
 

2018 | Dissertation | LibreCat-ID: 1209
D. Jung, Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018.
LibreCat | Files available | DOI
 

2017 | Conference Paper | LibreCat-ID: 112
M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.
LibreCat | Files available | DOI | arXiv
 

2017 | Conference Paper | LibreCat-ID: 16339
S. Brandt and M. Fischer, “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell,” in Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Paderborn, 2017, vol. 369, pp. 415–427.
LibreCat
 

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

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

2017 | Book Chapter | LibreCat-ID: 16461
P. Bemmann et al., “Monitoring of Domain-Related Problems in Distributed Data Streams,” in Structural Information and Communication Complexity, Cham, 2017.
LibreCat | DOI | arXiv
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed