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.

777 Publications


2022 | Journal Article | LibreCat-ID: 29843
J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem,” Information and Computation, Art. no. 104877, 2022, doi: 10.1016/j.ic.2022.104877.
LibreCat | DOI
 

2022 | Book Chapter | LibreCat-ID: 29872
M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” in Approximation and Online Algorithms, Cham: Springer International Publishing, 2022.
LibreCat | DOI
 

2022 | Journal Article | LibreCat-ID: 31479
S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” Algorithmica, 2022, doi: 10.1007/s00453-022-00978-0.
LibreCat | DOI
 

2021 | Preprint | LibreCat-ID: 27778
M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Full Version -- Server Cloud Scheduling,” arXiv:2108.02109. 2021.
LibreCat
 

2021 | Journal Article | LibreCat-ID: 21096
T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” Information and Computation, 2021.
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 23730
J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time,” in Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Lissabon, 2021, vol. 12961, pp. 29–44, doi: 10.1007/978-3-030-89240-1_3.
LibreCat | DOI | arXiv
 

2021 | Conference Paper | LibreCat-ID: 23779
R. Bernijazov et al., “A Meta-Review on Artificial Intelligence in Product Creation,” presented at the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada, 2021.
LibreCat | Download (ext.)
 

2021 | Journal Article | LibreCat-ID: 20683
B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” Theory of Computing Systems, vol. 65, pp. 943–984, 2021, doi: 10.1007/s00224-020-10023-8.
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 20817
M. Bienkowski, B. Feldkord, and P. Schmidt, “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, pp. 14:1-14:17.
LibreCat | DOI
 

2021 | Journal Article | LibreCat-ID: 22510
S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous strategy for collisionless gathering,” Theoretical Computer Science, vol. 852, pp. 41–60, 2021.
LibreCat | DOI
 

2021 | Journal Article | LibreCat-ID: 22511
S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” Theoretical Computer Science, vol. 852, pp. 29–40, 2021.
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 26986
J. Castenow, T. Götte, T. Knollmann, and F. Meyer auf der Heide, “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation,” in Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Online, 2021, vol. 13046, pp. 289–304, doi: 10.1007/978-3-030-91081-5_19.
LibreCat | DOI | arXiv
 

2020 | Conference Paper | LibreCat-ID: 19899
J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up,” in Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, 2020, vol. 12514, pp. 65–80.
LibreCat | DOI | arXiv
 

2020 | Conference Paper | LibreCat-ID: 20159
S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” in 28th Annual European Symposium on Algorithms (ESA 2020), 2020, vol. 173, pp. 12:1-12:14.
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 20185
J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ,” in Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , 2020, vol. 12514, pp. 60–64.
LibreCat | DOI | arXiv
 

2020 | Conference Paper | LibreCat-ID: 17370
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat | Files available | DOI | arXiv
 

2020 | Conference Paper | LibreCat-ID: 17371
J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “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, 2020.
LibreCat | Files available | DOI | arXiv
 

2020 | Conference Paper | LibreCat-ID: 16968
M. Braun, J. Castenow, and F. Meyer auf der Heide, “Local Gathering of Mobile Robots in Three Dimensions,” in Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Paderborn, 2020.
LibreCat | Files available | DOI | arXiv
 

2020 | Dissertation | LibreCat-ID: 15631
B. Feldkord, Mobile Resource Allocation. Universität Paderborn, 2020.
LibreCat | Files available | DOI
 

2020 | Journal Article | LibreCat-ID: 15025
M. D. Wever, L. van Rooijen, and H. Hamann, “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets,” Evolutionary Computation, vol. 28, no. 2, pp. 165–193, 2020, doi: 10.1162/evco_a_00266.
LibreCat | Files available | DOI
 

2020 | Conference Paper | LibreCat-ID: 15169
J. Castenow, C. Kolb, and C. Scheideler, “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.
LibreCat
 

2020 | Journal Article | LibreCat-ID: 16299
J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” Theoretical Computer Science, vol. 815, pp. 289–309, 2020.
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 13868
S. Pukrop, A. Mäcker, and F. Meyer auf der Heide, “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), 2020.
LibreCat
 

2020 | Journal Article | LibreCat-ID: 13770
H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” Business & Information Systems Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi: 10.1007/s12599-019-00627-x.
LibreCat | Files available | DOI
 

2019 | Conference Paper | LibreCat-ID: 17432
S. Baswana, S. Gupta, and A. Tulsyan, “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient,” in 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019, pp. 65:1--65:16.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 17667
R. Koning, G. Polevoy, L. Meijer, C. de Laat, and P. Grosso, “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), 2019, pp. 113–123.
LibreCat | DOI | Download (ext.)
 

2019 | Dissertation | LibreCat-ID: 18975
M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019.
LibreCat | Files available | DOI
 

2019 | Dissertation | LibreCat-ID: 8080
M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn, 2019.
LibreCat | Files available | DOI | Download (ext.)
 

2019 | Conference Paper | LibreCat-ID: 8866
K. Jansen, M. Maack, and A. Mäcker, “Scheduling on (Un-)Related Machines with Setup Times,” in Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2019, pp. 145–154.
LibreCat
 

2019 | Conference Paper | LibreCat-ID: 5471
P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “ Multi-unit Bilateral Trade,” presented at the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi: 10.1609/aaai.v33i01.33011973.
LibreCat | Files available | DOI
 

2019 | Conference Paper | LibreCat-ID: 12870
B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 2019, pp. 120–137.
LibreCat | DOI | arXiv
 

2019 | Dissertation | LibreCat-ID: 14851
A. Mäcker, On Scheduling with Setup Times. Universität Paderborn, 2019.
LibreCat | Files available | DOI
 

2019 | Preprint | LibreCat-ID: 16341 | OA
S. Brandt, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels,” arXiv:1904.08225. 2019.
LibreCat | Download (ext.) | arXiv
 

2019 | Journal Article | LibreCat-ID: 13873
B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 2019.
LibreCat | Files available | DOI
 

2019 | Journal Article | LibreCat-ID: 13937
F. Meyer auf der Heide, “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln,” Mathematische Semesterberichte, vol. 66, no. 2, pp. 259–260, 2019.
LibreCat | DOI
 

2019 | Book Chapter | LibreCat-ID: 13939
P. Kling and F. Meyer auf der Heide, “Continuous Protocols for Swarm Robotics,” in Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–334.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 13942
C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location,” in Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019, pp. 315–321.
LibreCat | DOI
 

2019 | Journal Article | LibreCat-ID: 13946
F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Efficient parallel algorithms for parameterized problems,” Theoretical Computer Science, vol. 786, pp. 2–12, 2019.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 14539
J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), L’Aquila, Italy, 2019, pp. 345–348.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 10281
M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation,” in Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, Montreal QC, Canada, 2019, pp. 1949--1951.
LibreCat | Files available | Download (ext.)
 

2019 | Mastersthesis | LibreCat-ID: 10344
S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 2484
B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prag, 2018, vol. 107, pp. 51:1-51:24.
LibreCat | Files available | DOI | arXiv
 

2018 | Conference Paper | LibreCat-ID: 2485
B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile Facilities,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018, pp. 373–381.
LibreCat | Files available | DOI
 

2018 | Bachelorsthesis | LibreCat-ID: 25121
D. J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems. 2018.
LibreCat | Files available
 

2018 | Preprint | LibreCat-ID: 19978
C. Markarian, “Online Connected Dominating Set Leasing,” arXiv:1805.02994. 2018.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 2831
M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine, California, USA, 2018, pp. 5:1-5:6.
LibreCat | Files available | DOI
 

2018 | Journal Article | LibreCat-ID: 2848
S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574, 2018.
LibreCat | Files available | DOI
 

2018 | Journal Article | LibreCat-ID: 2849
F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” Theory of Computing Systems, 2018.
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 2850
H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in Ninth International Conference on Fun with Algorithms (FUN), 2018.
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 24396
C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed