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.

361 Publications


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
 

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

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

2017 | Conference Paper | LibreCat-ID: 113
M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.
LibreCat | Files available | DOI | arXiv
 

2017 | Conference Paper | LibreCat-ID: 16347
M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” in Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, 2017, vol. 10718, pp. 168–181.
LibreCat | DOI
 

2017 | Conference Paper | LibreCat-ID: 55
B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.
LibreCat | Files available | DOI
 

2017 | Conference Paper | LibreCat-ID: 79
A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “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), 2017, vol. 10787, pp. 207–222.
LibreCat | Files available | DOI
 

2017 | Mastersthesis | LibreCat-ID: 1081
V. R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.
LibreCat
 

2017 | Bachelorsthesis | LibreCat-ID: 1074
S. Pukrop, Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.
LibreCat
 

2017 | Conference Paper | LibreCat-ID: 16348
F. Biermeier, B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “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), 2017, pp. 285–300.
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed