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
2019 | Conference Paper | LibreCat-ID: 13942
C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location,” in Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019, pp. 315–321.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 14539
J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), L’Aquila, Italy, 2019, pp. 345–348.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 10281
M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation,” in Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, Montreal QC, Canada, 2019, pp. 1949--1951.
LibreCat
| Files available
| Download (ext.)
2019 | Mastersthesis | LibreCat-ID: 10344
S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.
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: 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: 25121
D. J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems. 2018.
LibreCat
| Files available
2018 | Preprint | LibreCat-ID: 19978
C. Markarian, “Online Connected Dominating Set Leasing,” arXiv:1805.02994. 2018.
LibreCat
2018 | Conference Paper | LibreCat-ID: 2831
M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine, California, USA, 2018, pp. 5:1-5:6.
LibreCat
| Files available
| DOI
2018 | Journal Article | LibreCat-ID: 2848
S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574, 2018.
LibreCat
| Files available
| DOI
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 | Conference Paper | LibreCat-ID: 2850
H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “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.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 24396
C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.
LibreCat
| 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 | Bachelorsthesis | LibreCat-ID: 3851
S. Koop, Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.
LibreCat
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 | 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, doi: 10.1007/s10951-017-0518-0.
LibreCat
| Files available
| DOI