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, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:10.1016/j.tcs.2022.10.031.
LibreCat
| DOI
| arXiv
2023 | Conference Paper | LibreCat-ID: 34008
Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023, p. 15:1–15:25, doi:10.4230/LIPIcs.OPODIS.2022.15.
LibreCat
| DOI
| arXiv
2023 | Journal Article | LibreCat-ID: 44077
Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” Operations Research Letters, vol. 51, no. 3, Elsevier BV, 2023, pp. 220–25, doi:10.1016/j.orl.2023.02.013.
LibreCat
| DOI
2023 | Book Chapter | LibreCat-ID: 44769
Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile Robots.” Lecture Notes in Computer Science, Springer International Publishing, 2023, doi:10.1007/978-3-031-30448-4_1.
LibreCat
| DOI
2023 | Dissertation | LibreCat-ID: 45580
Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems. 2023, doi:10.17619/UNIPB/1-1750.
LibreCat
| DOI
2023 | Dissertation | LibreCat-ID: 45579
Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources. 2023, doi:10.17619/UNIPB/1-1751.
LibreCat
| DOI
2023 | Dissertation | LibreCat-ID: 45781
Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. 2023, doi:10.17619/UNIPB/1-1768 .
LibreCat
| DOI
2023 | Journal Article | LibreCat-ID: 50458
Maack, Marten, et al. “Server Cloud Scheduling.” Algorithmica, Springer Science and Business Media LLC, 2023, doi:10.1007/s00453-023-01189-x.
LibreCat
| DOI
2023 | Conference Paper | LibreCat-ID: 50460
Deppert, Max A., et al. “Scheduling with Many Shared Resources.” 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023, doi:10.1109/ipdps54959.2023.00049.
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 29843
Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” Information and Computation, 104877, Elsevier BV, 2022, doi:10.1016/j.ic.2022.104877.
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 31847
Castenow, Jannik, et al. “The K-Server with Preferences Problem.” Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
LibreCat
| DOI
| arXiv
2022 | Conference Paper | LibreCat-ID: 34040
Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, edited by Luc De Raedt, 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, Leah, et al. “Cardinality Constrained Scheduling in Online Models.” 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15, doi:10.4230/LIPIcs.STACS.2022.28.
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 33491
Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:10.4230/LIPIcs.ESA.2022.77.
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 31479
Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” Algorithmica, Springer Science and Business Media LLC, 2022, doi:10.1007/s00453-022-00978-0.
LibreCat
| DOI
2022 | Book Chapter | LibreCat-ID: 29872
Maack, Marten, et al. “Server Cloud Scheduling.” 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, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 23730
Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time.” Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec et al., vol. 12961, Springer, 2021, pp. 29–44, doi:10.1007/978-3-030-89240-1_3.
LibreCat
| DOI
| arXiv
2021 | Conference Paper | LibreCat-ID: 23779
Bernijazov, Ruslan, et al. “A Meta-Review on Artificial Intelligence in Product Creation.” Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021.
LibreCat
| Download (ext.)
2021 | Journal Article | LibreCat-ID: 20683
Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Theory of Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 20817
Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14.
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22510
Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” Theoretical Computer Science, vol. 852, 2021, pp. 41–60, doi:10.1016/j.tcs.2020.10.037.
LibreCat
| DOI
2021 | Journal Article | LibreCat-ID: 22511
Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” Theoretical Computer Science, vol. 852, 2021, pp. 29–40, doi:10.1016/j.tcs.2020.11.009.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 26986
Castenow, Jannik, et al. “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.” Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, edited by C. Johnen et al., vol. 13046, Springer, 2021, pp. 289–304, doi:10.1007/978-3-030-91081-5_19.
LibreCat
| DOI
| arXiv
2021 | Preprint | LibreCat-ID: 27778
Maack, Marten, et al. “Full Version -- Server Cloud Scheduling.” ArXiv:2108.02109, 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 44234
Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 44233
Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms. 2021.
LibreCat
2020 | Conference Paper | LibreCat-ID: 19899
Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, edited by Stéphane Devismes and Neeraj Mittal, vol. 12514, Springer, 2020, pp. 65–80, doi:10.1007/978-3-030-64348-5_6.
LibreCat
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 20159
Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” 28th Annual European Symposium on Algorithms (ESA 2020), edited by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020, pp. 12:1-12:14, doi:10.4230/LIPIcs.ESA.2020.12.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 20185
Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility .” Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes and Neeraj Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:10.1007/978-3-030-64348-5_5.
LibreCat
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 17370
Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281.
LibreCat
| Files available
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 17371
Castenow, Jannik, et al. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400263.
LibreCat
| Files available
| DOI
| arXiv
2020 | Conference Paper | LibreCat-ID: 16968
Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.” Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020, doi:10.1007/978-3-030-54921-3_4.
LibreCat
| Files available
| DOI
| arXiv
2020 | Dissertation | LibreCat-ID: 15631
Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869.
LibreCat
| Files available
| DOI
2020 | Journal Article | LibreCat-ID: 15025
Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation, vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:10.1162/evco_a_00266.
LibreCat
| Files available
| DOI
2020 | Conference Paper | LibreCat-ID: 15169
Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM.
LibreCat
2020 | Journal Article | LibreCat-ID: 16299
Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 13868
Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.
LibreCat
2020 | Journal Article | LibreCat-ID: 13770
Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.
LibreCat
| Files available
| DOI
2019 | Conference Paper | LibreCat-ID: 17432
Baswana, Surender, et al. “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.” 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16, doi:10.4230/LIPICS.MFCS.2019.65.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 17667
Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.” 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.
LibreCat
| DOI
| Download (ext.)
2019 | Dissertation | LibreCat-ID: 18975
Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. 2019, doi:10.17619/UNIPB/1-766.
LibreCat
| Files available
| DOI
2019 | Dissertation | LibreCat-ID: 8080
Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. 2019, doi:10.17619/UNIPB/1-588.
LibreCat
| Files available
| DOI
| Download (ext.)
2019 | Conference Paper | LibreCat-ID: 8866
Jansen, Klaus, et al. “Scheduling on (Un-)Related Machines with Setup Times.” Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2019, pp. 145–54.
LibreCat
2019 | Conference Paper | LibreCat-ID: 5471
Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019, doi:10.1609/aaai.v33i01.33011973.
LibreCat
| Files available
| DOI
2019 | Conference Paper | LibreCat-ID: 12870
Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.
LibreCat
| DOI
| arXiv
2019 | Dissertation | LibreCat-ID: 14851
Mäcker, Alexander. On Scheduling with Setup Times. 2019, doi:10.17619/UNIPB/1-828.
LibreCat
| Files available
| DOI
2019 | Preprint | LibreCat-ID: 16341 | 
Brandt, Sascha, et al. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019.
LibreCat
| Download (ext.)
| arXiv
2019 | Journal Article | LibreCat-ID: 13873
Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 14, 2019, doi:10.1145/3364204.
LibreCat
| Files available
| DOI
2019 | Journal Article | LibreCat-ID: 13937
Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln.” Mathematische Semesterberichte, vol. 66, no. 2, 2019, pp. 259–60, doi:10.1007/s00591-019-00249-0.
LibreCat
| DOI