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.

667 Publications


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

2020 | Conference Paper | LibreCat-ID: 17371
Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2020). 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. https://doi.org/10.1145/3350755.3400263
LibreCat | Files available | DOI
 

2020 | Conference Paper | LibreCat-ID: 16968
Braun, M., Castenow, J., & Meyer auf der Heide, F. (2020). Local Gathering of Mobile Robots in Three Dimensions. In Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Paderborn: Springer. https://doi.org/10.1007/978-3-030-54921-3_4
LibreCat | Files available | DOI | arXiv
 

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

2020 | Dissertation | LibreCat-ID: 15631
Feldkord, B. (2020). Mobile Resource Allocation. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-869
LibreCat | Files available | DOI
 

2020 | Conference Paper | LibreCat-ID: 20159
Baswana, S., Gupta, S., & Knollmann, T. (2020). Mincut Sensitivity Data Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, & P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020) (Vol. 173, pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.12
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 15169
Castenow, J., Kolb, C., & Scheideler, C. (n.d.). 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: ACM.
LibreCat
 

2020 | Journal Article | LibreCat-ID: 16299
Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018
LibreCat | DOI
 

2020 | Preprint | LibreCat-ID: 19899
Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2020). A Discrete and Continuous Study of the Max-Chain-Formation Problem. ArXiv:2010.02043.
LibreCat
 

2019 | Conference Paper | LibreCat-ID: 12870
Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer. https://doi.org/10.1007/978-3-030-39479-0_9
LibreCat | DOI | arXiv
 

2019 | Journal Article | LibreCat-ID: 13873
Feldkord, B., & Meyer auf der Heide, F. (2019). The Mobile Server Problem. ACM Transactions on Parallel Computing (TOPC), 6(3). https://doi.org/10.1145/3364204
LibreCat | Files available | DOI
 

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

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

2019 | Conference Paper | LibreCat-ID: 10281
Feldotto, M., Lenzner, P., Molitor, L., & Skopalik, A. (2019). 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 (pp. 1949--1951). Montreal QC, Canada: International Foundation for Autonomous Agents and Multiagent Systems.
LibreCat | Files available | Download (ext.)
 

2019 | Journal Article | LibreCat-ID: 13937
Meyer auf der Heide, F. (2019). Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. Mathematische Semesterberichte, 66(2), 259–260. https://doi.org/10.1007/s00591-019-00249-0
LibreCat | DOI
 

2019 | Dissertation | LibreCat-ID: 18975
Malatyali, M. (2019). Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-766
LibreCat | Files available | DOI
 

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

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

2019 | Book Chapter | LibreCat-ID: 13939
Kling, P., & Meyer auf der Heide, F. (2019). Continuous Protocols for Swarm Robotics. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing (Vol. 11340, pp. 317–334). Springer. https://doi.org/10.1007/978-3-030-11072-7\_13
LibreCat | DOI
 

2019 | Journal Article | LibreCat-ID: 13770
Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (n.d.). A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering. https://doi.org/10.1007/s12599-019-00627-x
LibreCat | Files available | DOI
 

2019 | Conference Paper | LibreCat-ID: 5471
Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., & de Keijzer, B. (n.d.). Multi-unit Bilateral Trade. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Honolulu, Hawaii, USA.
LibreCat | Files available
 

2019 | Journal Article | LibreCat-ID: 13946
Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2019). Efficient parallel algorithms for parameterized problems. Theoretical Computer Science, 786, 2–12. https://doi.org/10.1016/j.tcs.2018.11.006
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 14539
Castenow, J., Kolb, C., & Scheideler, C. (2019). 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) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\_26
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 13942
Markarian, C., & Meyer auf der Heide, F. (2019). 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 (pp. 315–321). SciTePress. https://doi.org/10.5220/0007369503150321
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 17432
Baswana, S., Gupta, S., & Tulsyan, A. (2019). Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) (pp. 65:1--65:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.65
LibreCat | DOI
 

2019 | Dissertation | LibreCat-ID: 14851
Mäcker, A. (2019). On Scheduling with Setup Times. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-828
LibreCat | Files available | DOI
 

2019 | Journal Article | LibreCat-ID: 15025
Wever, M. D., van Rooijen, L., & Hamann, H. (n.d.). Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation. https://doi.org/10.1162/evco_a_00266
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 7570
Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662
LibreCat | Files available | DOI
 

2018 | Bachelorsthesis | LibreCat-ID: 5404
Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn.
LibreCat
 

2018 | Mastersthesis | LibreCat-ID: 1186
Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn.
LibreCat
 

2018 | Journal Article | LibreCat-ID: 1369
Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-018-0269-7
LibreCat | Files available | DOI
 

2018 | Book Chapter | LibreCat-ID: 16392
Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham. https://doi.org/10.1007/978-3-319-98355-4_18
LibreCat | DOI
 

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

2018 | Journal Article | LibreCat-ID: 2848
Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574. https://doi.org/10.1007/s00453-018-0420-y
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 4375
Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 4565
Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press. https://doi.org/10.1145/3210377.3210663
LibreCat | Files available | DOI
 

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

2018 | Preprint | LibreCat-ID: 19978
Markarian, C. (2018). Online Connected Dominating Set Leasing. ArXiv:1805.02994.
LibreCat
 

2018 | Bachelorsthesis | LibreCat-ID: 1187
Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn.
LibreCat
 

2018 | Journal Article | LibreCat-ID: 2849
Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z
LibreCat | Files available | DOI
 

2018 | Journal Article | LibreCat-ID: 3551
König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018). Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3
LibreCat | Files available | DOI
 

2018 | Journal Article | LibreCat-ID: 669
Feldotto, M., Leder, L., & Skopalik, A. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167. https://doi.org/10.1007/s10878-017-0189-y
LibreCat | Files available | DOI | arXiv
 

2018 | Journal Article | LibreCat-ID: 63
Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., … Süß, T. (2018). Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92. https://doi.org/10.1007/s10951-017-0518-0
LibreCat | Files available | DOI
 

2018 | Bachelorsthesis | LibreCat-ID: 1188
Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 2484
Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51
LibreCat | Files available | DOI | arXiv
 

2018 | Conference Paper | LibreCat-ID: 4411
Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1
LibreCat | Files available | DOI | arXiv
 

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

2018 | Bachelorsthesis | LibreCat-ID: 3851
Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität Paderborn.
LibreCat
 

2018 | Conference Paper | LibreCat-ID: 4563
Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.
LibreCat | Files available
 

2018 | Dissertation | LibreCat-ID: 1209
Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-271
LibreCat | Files available | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed