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
2023 | Journal Article | LibreCat-ID: 33947
Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science, 939, 261–291. https://doi.org/10.1016/j.tcs.2022.10.031
LibreCat
| DOI
| arXiv
2023 | Conference Paper | LibreCat-ID: 34008
Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In E. Hillel, R. Palmieri, & E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15
LibreCat
| DOI
| arXiv
2023 | Journal Article | LibreCat-ID: 44077
Maack, M. (2023). Online load balancing on uniform machines with limited migration. Operations Research Letters, 51(3), 220–225. https://doi.org/10.1016/j.orl.2023.02.013
LibreCat
| DOI
2023 | Book Chapter | LibreCat-ID: 44769
Castenow, J., Harbig, J., & Meyer auf der Heide, F. (2023). Unifying Gathering Protocols for Swarms of Mobile Robots. In Lecture Notes in Computer Science. Springer International Publishing. https://doi.org/10.1007/978-3-031-30448-4_1
LibreCat
| DOI
2023 | Dissertation | LibreCat-ID: 45580
Castenow, J. (2023). Local Protocols for Contracting and Expanding Robot Formation Problems. https://doi.org/10.17619/UNIPB/1-1750
LibreCat
| DOI
2023 | Dissertation | LibreCat-ID: 45579
Knollmann, T. (2023). Online Algorithms for Allocating Heterogeneous Resources. https://doi.org/10.17619/UNIPB/1-1751
LibreCat
| DOI
2023 | Dissertation | LibreCat-ID: 45781
Pukrop, S. (2023). On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. https://doi.org/10.17619/UNIPB/1-1768
LibreCat
| DOI
2023 | Journal Article | LibreCat-ID: 50458
Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2023). Server Cloud Scheduling. Algorithmica. https://doi.org/10.1007/s00453-023-01189-x
LibreCat
| DOI
2023 | Conference Paper | LibreCat-ID: 50460
Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., & Rau, M. (2023). Scheduling with Many Shared Resources. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps54959.2023.00049
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 29843
Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information and Computation, Article 104877. https://doi.org/10.1016/j.ic.2022.104877
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 31847
Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356. https://doi.org/10.1145/3490148.3538595
LibreCat
| DOI
| arXiv
2022 | Conference Paper | LibreCat-ID: 34040
Polevoy, G., & Dziubiński, M. (2022). Fair, Individually Rational and Cheap Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization. https://doi.org/10.24963/ijcai.2022/64
LibreCat
| DOI
| Download (ext.)
2022 | Conference Paper | LibreCat-ID: 33085
Epstein, L., Lassota, A., Levin, A., Maack, M., & Rohwedder, L. (2022). Cardinality Constrained Scheduling in Online Models. In P. Berenbrink & B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2022.28
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 33491
Maack, M., Pukrop, S., & Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.77
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 31479
Baswana, S., Gupta, S., & Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. Algorithmica. https://doi.org/10.1007/s00453-022-00978-0
LibreCat
| DOI
2022 | Book Chapter | LibreCat-ID: 29872
Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2022). Server Cloud Scheduling. In Approximation and Online Algorithms. Springer International Publishing. https://doi.org/10.1007/978-3-030-92702-8_10
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 21096
Knollmann, T., & Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697. https://doi.org/10.1016/j.ic.2021.104697
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 23730
Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L. Gasieniec, R. Klasing, & T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) (Vol. 12961, pp. 29–44). Springer. https://doi.org/10.1007/978-3-030-89240-1_3
LibreCat
| DOI
| arXiv
2021 | Conference Paper | LibreCat-ID: 23779
Bernijazov, R., Dicks, A., Dumitrescu, R., Foullois, M., Hanselle, J. M., Hüllermeier, E., Karakaya, G., Ködding, P., Lohweg, V., Malatyali, M., Meyer auf der Heide, F., Panzner, M., & Soltenborn, C. (2021). A Meta-Review on Artificial Intelligence in Product Creation. Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21). 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada.
LibreCat
| Download (ext.)
2021 | Journal Article | LibreCat-ID: 20683
Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. Theory of Computing Systems, 65, 943–984. https://doi.org/10.1007/s00224-020-10023-8
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 20817
Bienkowski, M., Feldkord, B., & Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 14:1-14:17). https://doi.org/10.4230/LIPIcs.STACS.2021.14
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22510
Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2021). A continuous strategy for collisionless gathering. Theoretical Computer Science, 852, 41–60. https://doi.org/10.1016/j.tcs.2020.10.037
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22511
Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theoretical Computer Science, 852, 29–40. https://doi.org/10.1016/j.tcs.2020.11.009
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 26986
Castenow, J., Götte, T., Knollmann, T., & Meyer auf der Heide, F. (2021). The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation. In C. Johnen, E. M. Schiller, & S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021 (Vol. 13046, pp. 289–304). Springer. https://doi.org/10.1007/978-3-030-91081-5_19
LibreCat
| DOI
| arXiv
2021 | Preprint | LibreCat-ID: 27778
Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2021). Full Version -- Server Cloud Scheduling. In arXiv:2108.02109.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 44234
Berger, T. F. (2021). Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 44233
Pranger, S. (2021). Online k-Facility Reallocation using k-Server Algorithms.
LibreCat
2020 | Conference Paper | LibreCat-ID: 19899
Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2020). A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In S. Devismes & N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings (Vol. 12514, pp. 65–80). Springer. https://doi.org/10.1007/978-3-030-64348-5_6
LibreCat
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 20159
Baswana, S., Gupta, S., & Knollmann, T. (2020). Mincut Sensitivity Data Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, & P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020) (Vol. 173, pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.12
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 20185
Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility . In S. Devismes & N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings (Vol. 12514, pp. 60–64). Springer. https://doi.org/10.1007/978-3-030-64348-5_5
LibreCat
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 17370
Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3350755.3400281
LibreCat
| Files available
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 17371
Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2020). Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3350755.3400263
LibreCat
| Files available
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 16968
Braun, M., Castenow, J., & Meyer auf der Heide, F. (2020). Local Gathering of Mobile Robots in Three Dimensions. In Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Paderborn: Springer. https://doi.org/10.1007/978-3-030-54921-3_4
LibreCat
| Files available
| DOI
| arXiv
2020 | Dissertation | LibreCat-ID: 15631
Feldkord, B. (2020). Mobile Resource Allocation. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-869
LibreCat
| Files available
| DOI
2020 | Journal Article | LibreCat-ID: 15025
Wever, M. D., van Rooijen, L., & Hamann, H. (2020). Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation, 28(2), 165–193. https://doi.org/10.1162/evco_a_00266
LibreCat
| Files available
| DOI
2020 | Conference Paper | LibreCat-ID: 15169
Castenow, J., Kolb, C., & Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). Kolkata, Indien: ACM.
LibreCat
2020 | Journal Article | LibreCat-ID: 16299
Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 13868
Pukrop, S., Mäcker, A., & Meyer auf der Heide, F. (2020). Approximating Weighted Completion Time for Order Scheduling with Setup Times. In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM).
LibreCat
2020 | Journal Article | LibreCat-ID: 13770
Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering, 62(6), 467–481. https://doi.org/10.1007/s12599-019-00627-x
LibreCat
| Files available
| DOI
2019 | Conference Paper | LibreCat-ID: 17432
Baswana, S., Gupta, S., & Tulsyan, A. (2019). Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) (pp. 65:1--65:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.65
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 17667
Koning, R., Polevoy, G., Meijer, L., de Laat, C., & Grosso, P. (2019). Approaches for Collaborative Security Defences in Multi Network Environments. In 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom) (pp. 113–123). https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9
LibreCat
| DOI
| Download (ext.)
2019 | Dissertation | LibreCat-ID: 18975
Malatyali, M. (2019). Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-766
LibreCat
| Files available
| DOI
2019 | Dissertation | LibreCat-ID: 8080
Feldotto, M. (2019). Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-588
LibreCat
| Files available
| DOI
| Download (ext.)
2019 | Conference Paper | LibreCat-ID: 8866
Jansen, K., Maack, M., & Mäcker, A. (2019). Scheduling on (Un-)Related Machines with Setup Times. In Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 145–154). IEEE.
LibreCat
2019 | Conference Paper | LibreCat-ID: 5471
Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., & de Keijzer, B. (2019). Multi-unit Bilateral Trade. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA. https://doi.org/10.1609/aaai.v33i01.33011973
LibreCat
| Files available
| DOI
2019 | Conference Paper | LibreCat-ID: 12870
Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer. https://doi.org/10.1007/978-3-030-39479-0_9
LibreCat
| DOI
| arXiv
2019 | Dissertation | LibreCat-ID: 14851
Mäcker, A. (2019). On Scheduling with Setup Times. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-828
LibreCat
| Files available
| DOI
2019 | Preprint | LibreCat-ID: 16341 | 
Brandt, S., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2019). Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. ArXiv:1904.08225.
LibreCat
| Download (ext.)
| arXiv
2019 | Journal Article | LibreCat-ID: 13873
Feldkord, B., & Meyer auf der Heide, F. (2019). The Mobile Server Problem. ACM Transactions on Parallel Computing (TOPC), 6(3). https://doi.org/10.1145/3364204
LibreCat
| Files available
| DOI
2019 | Journal Article | LibreCat-ID: 13937
Meyer auf der Heide, F. (2019). Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. Mathematische Semesterberichte, 66(2), 259–260. https://doi.org/10.1007/s00591-019-00249-0
LibreCat
| DOI