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.
792 Publications
2018 | Conference Paper | LibreCat-ID: 2831
Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations Using the Shapley Value. In: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018). ; 2018:5:1-5:6. doi:10.1145/3230654.3230659
LibreCat
| Files available
| DOI
2018 | Journal Article | LibreCat-ID: 2848
Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online Leasing Problems. . Algorithmica. 2018;80(5):1556–1574. doi:10.1007/s00453-018-0420-y
LibreCat
| Files available
| DOI
2018 | Journal Article | LibreCat-ID: 2849
Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. 2018. doi:10.1007/s00224-017-9836-z
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 2850
Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In: Ninth International Conference on Fun with Algorithms (FUN). ; 2018. doi:10.4230/LIPIcs.FUN.2018.22
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 24396
Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. In: International Workshop on Combinatorial Algorithms (IWOCA). ; 2018. doi:10.1007/978-3-319-94667-2_18
LibreCat
| DOI
2018 | Journal Article | LibreCat-ID: 3551
König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization. 2018;36(4):1356-1379. doi:10.1007/s10878-018-0325-3
LibreCat
| Files available
| DOI
2018 | Bachelorsthesis | LibreCat-ID: 3851
Koop S. Congestion Games mit gewichteten Strategien. Universität Paderborn; 2018.
LibreCat
2018 | Conference Paper | LibreCat-ID: 17651
Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. Combinatorial Optimization and Applications. Cham: Springer International Publishing; 2018:217-232.
LibreCat
2018 | Journal Article | LibreCat-ID: 17666
Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. 2018. doi:https://doi.org/10.1016/j.future.2018.08.011
LibreCat
| DOI
2018 | Journal Article | LibreCat-ID: 63
Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling. 2018;21(1):77-92. doi:10.1007/s10951-017-0518-0
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 4411
Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1
LibreCat
| Files available
| DOI
| arXiv
2018 | Conference Paper | LibreCat-ID: 4563
Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.
LibreCat
| Files available
2018 | Conference Paper | LibreCat-ID: 4565
Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 7570
Meyer auf der Heide F, Schaefer JS. 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. ACM Press; 2018. doi:10.1145/3210377.3210662
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 4375
Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. 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). ; 2018. doi:10.1007/978-3-030-19759-9_4
LibreCat
| Files available
| DOI
2018 | Bachelorsthesis | LibreCat-ID: 5403
Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 5404
Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn; 2018.
LibreCat
2018 | Journal Article | LibreCat-ID: 669
Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. Journal of Combinatorial Optimization. 2018;36(4):1145-1167. doi:10.1007/s10878-017-0189-y
LibreCat
| Files available
| DOI
| arXiv
2018 | Mastersthesis | LibreCat-ID: 1186
Kemper A. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn; 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 1187
Nachtigall M. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn; 2018.
LibreCat