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
2022 | Conference Paper | LibreCat-ID: 31847
Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The k-Server with Preferences Problem. In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2022:345-356. doi:10.1145/3490148.3538595
LibreCat
| DOI
| arXiv
2022 | Conference Paper | LibreCat-ID: 34040
Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment. In: De Raedt L, ed. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization; 2022. doi: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. Cardinality Constrained Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). Vol 219. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:10.4230/LIPIcs.STACS.2022.28
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 33491
Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:10.4230/LIPIcs.ESA.2022.77
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 31479
Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. Algorithmica. Published online 2022. doi:10.1007/s00453-022-00978-0
LibreCat
| DOI
2022 | Book Chapter | LibreCat-ID: 29872
Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. In: Approximation and Online Algorithms. Springer International Publishing; 2022. doi:10.1007/978-3-030-92702-8_10
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 21096
Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. Published online 2022. doi: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. Gathering a Euclidean Closed Chain of Robots in Linear Time. In: Gasieniec L, Klasing R, Radzik T, eds. Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Vol 12961. LNCS. Springer; 2021:29-44. doi:10.1007/978-3-030-89240-1_3
LibreCat
| DOI
| arXiv
2021 | Conference Paper | LibreCat-ID: 23779
Bernijazov R, Dicks A, Dumitrescu R, et al. A Meta-Review on Artificial Intelligence in Product Creation. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21). ; 2021.
LibreCat
| Download (ext.)
2021 | Journal Article | LibreCat-ID: 20683
Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. Theory of Computing Systems. 2021;65:943–984. doi:10.1007/s00224-020-10023-8
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 20817
Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS). ; 2021:14:1-14:17. doi: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. A continuous strategy for collisionless gathering. Theoretical Computer Science. 2021;852:41-60. doi:10.1016/j.tcs.2020.10.037
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22511
Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theoretical Computer Science. 2021;852:29-40. doi: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. The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation. In: Johnen C, Schiller EM, Schmid S, eds. Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021. Vol 13046. LNCS. Springer; 2021:289-304. doi: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. Full Version -- Server Cloud Scheduling. arXiv:210802109. Published online 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 44234
Berger TF. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.; 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 44233
Pranger S. Online K-Facility Reallocation Using k-Server Algorithms.; 2021.
LibreCat
2020 | Conference Paper | LibreCat-ID: 19899
Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In: Devismes S, Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:65-80. doi:10.1007/978-3-030-64348-5_6
LibreCat
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 20159
Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. In: Grandoni F, Herman G, Sanders P, eds. 28th Annual European Symposium on Algorithms (ESA 2020). Vol 173. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik; 2020:12:1-12:14. doi: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. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility . In: Devismes S, Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings . Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:10.1007/978-3-030-64348-5_5
LibreCat
| DOI
| arXiv