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 | Book Chapter | LibreCat-ID: 13939
Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.” Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–34, doi:10.1007/978-3-030-11072-7\_13.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 13942
Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–21, doi:10.5220/0007369503150321.
LibreCat
| DOI
2019 | Journal Article | LibreCat-ID: 13946
Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.” Theoretical Computer Science, vol. 786, 2019, pp. 2–12, doi:10.1016/j.tcs.2018.11.006.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 14539
Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9\_26.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 10281
Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.
LibreCat
| Files available
| Download (ext.)
2019 | Mastersthesis | LibreCat-ID: 10344
Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.
LibreCat
2018 | Conference Paper | LibreCat-ID: 2484
Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
LibreCat
| Files available
| DOI
| arXiv
2018 | Conference Paper | LibreCat-ID: 2485
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.
LibreCat
| Files available
| DOI
2018 | Bachelorsthesis | LibreCat-ID: 25121
Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems. 2018.
LibreCat
| Files available
2018 | Preprint | LibreCat-ID: 19978
Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994, 2018.
LibreCat
2018 | Conference Paper | LibreCat-ID: 2831
Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.
LibreCat
| Files available
| DOI
2018 | Journal Article | LibreCat-ID: 2848
Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.
LibreCat
| Files available
| DOI
2018 | Journal Article | LibreCat-ID: 2849
Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, Springer, 2018, doi:10.1007/s00224-017-9836-z.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 2850
Hamann, Heiko, et al. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” 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, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” 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ürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79, doi:10.1007/s10878-018-0325-3.
LibreCat
| Files available
| DOI
2018 | Bachelorsthesis | LibreCat-ID: 3851
Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.
LibreCat
2018 | Conference Paper | LibreCat-ID: 17651
Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial Optimization and Applications, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.
LibreCat
2018 | Journal Article | LibreCat-ID: 17666
Koning, R., et al. “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, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.” Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.
LibreCat
| Files available
| DOI