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, 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
  
  
  