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.

783 Publications


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: 33947
Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2022). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2022.10.031
LibreCat | DOI | arXiv
 

2022 | Conference Paper | LibreCat-ID: 34008
Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (n.d.). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . 26th International Conference on Principles of Distributed Systems (OPODIS) (Accepted). 26th International Conference on Principles of Distributed Systems (OPODIS), Brüssel.
LibreCat | arXiv
 

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
 

2021 | Journal Article | LibreCat-ID: 21096
Knollmann, T., & Scheideler, C. (2021). A self-stabilizing Hashed Patricia Trie. Information and Computation. https://doi.org/10.1016/j.ic.2021.104697
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed