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
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
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 | Bachelorsthesis | LibreCat-ID: 44234
T. F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 44233
S. Pranger, Online k-Facility Reallocation using k-Server Algorithms. 2021.
LibreCat
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: 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 | 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: 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 | 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 | 
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 | 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 | 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
2018 | Journal Article | LibreCat-ID: 3551
J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1356–1379, 2018.
LibreCat
| Files available
| DOI
2018 | Bachelorsthesis | LibreCat-ID: 3851
S. Koop, Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.
LibreCat
2018 | Conference Paper | LibreCat-ID: 17651
G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in Combinatorial Optimization and Applications, 2018, pp. 217–232.
LibreCat
2018 | Journal Article | LibreCat-ID: 63
E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,” Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018, doi: 10.1007/s10951-017-0518-0.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 4411
T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.
LibreCat
| Files available
| DOI
| arXiv
2018 | Conference Paper | LibreCat-ID: 4563
D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Helsinki, 2018.
LibreCat
| Files available
2018 | Conference Paper | LibreCat-ID: 4565
D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 7570
F. Meyer auf der Heide and J. S. Schaefer, “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, 2018.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 4375
M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “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, 2018.
LibreCat
| Files available
| DOI
2018 | Bachelorsthesis | LibreCat-ID: 5403
M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 5404
P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem. Universität Paderborn, 2018.
LibreCat
2018 | Journal Article | LibreCat-ID: 669
M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018.
LibreCat
| Files available
| DOI
| arXiv
2018 | Mastersthesis | LibreCat-ID: 1186
A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 1187
M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn, 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 1188
J. Kempf, Learning deterministic bandit behaviour form compositions. Universität Paderborn, 2018.
LibreCat
2018 | Dissertation | LibreCat-ID: 1209
D. Jung, Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018.
LibreCat
| Files available
| DOI
2018 | Journal Article | LibreCat-ID: 1369
M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” Journal of Combinatorial Optimization, 2018.
LibreCat
| Files available
| DOI
2017 | Dissertation | LibreCat-ID: 19604
S. Li, Parallel fixed parameter tractable problems. Universität Paderborn, 2017.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 2851
C. Markarian, “Leasing with Uncertainty,” in International Conference on Operations Research (OR), Berlin, 2017.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 24398
Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to Shared Space in Multi-robot Systems,” 2017, doi: 10.1007/978-3-319-59930-4_12.
LibreCat
| DOI
2017 | Conference Paper | LibreCat-ID: 112
M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.
LibreCat
| Files available
| DOI
| arXiv
2017 | Conference Paper | LibreCat-ID: 113
M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.
LibreCat
| Files available
| DOI
| arXiv
2017 | Conference Paper | LibreCat-ID: 17652
G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 2017, pp. 3–17.
LibreCat
| DOI
2017 | Conference Paper | LibreCat-ID: 17653
G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.
LibreCat
2017 | Conference Paper | LibreCat-ID: 17654
G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017.
LibreCat
2017 | Preprint | LibreCat-ID: 17811
M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” arXiv:1702.03400. 2017.
LibreCat
2017 | Conference Paper | LibreCat-ID: 79
A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, vol. 10787, pp. 207–222.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 82
F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,” in Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 59
P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 70
B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.
LibreCat
| Files available
| DOI
2017 | Dissertation | LibreCat-ID: 703
P. Podlipyan, Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017.
LibreCat
| Files available
| DOI
2017 | Dissertation | LibreCat-ID: 704
S. Riechers, Scheduling with Scarce Resources. Universität Paderborn, 2017.
LibreCat
| Files available
| DOI
2017 | Journal Article | LibreCat-ID: 706
A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1168–1194, 2017.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 97
L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” in 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), Lisbon, Portugal, 2017, pp. 379–385.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 55
B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 66
M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.
LibreCat
| Files available
| DOI
2017 | Bachelorsthesis | LibreCat-ID: 695
J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017.
LibreCat
2017 | Book | LibreCat-ID: 16444
J. Gausemeier et al., Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn, 2017.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 1073
S. Nachtigall, Sortieren dynamischer Daten. Universität Paderborn, 2017.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 1074
S. Pukrop, Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.
LibreCat
2017 | Mastersthesis | LibreCat-ID: 1080
J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.
LibreCat
2017 | Mastersthesis | LibreCat-ID: 1081
V. R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.
LibreCat
2017 | Conference Paper | LibreCat-ID: 1094
M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, and A. Skopalik, “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App,” in Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 1095 |
T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.
LibreCat
| Files available
| Download (ext.)
2017 | Journal Article | LibreCat-ID: 110
A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling with Variability: A Simple and Direct Approach,” Theoretical Computer Science, pp. 1–13, 2017.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 16338
S. Brandt, M. Fischer, M. Gerges, C. Jähn, and J. Berssenbrügge, “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models,” in Volume 1: 37th Computers and Information in Engineering Conference, Cleveland, USA, 2017, vol. 1, pp. 91:1-91:10.
LibreCat
| DOI
2017 | Conference Paper | LibreCat-ID: 16339
S. Brandt and M. Fischer, “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell,” in Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Paderborn, 2017, vol. 369, pp. 415–427.
LibreCat
2017 | Conference Paper | LibreCat-ID: 16347
M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” in Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, 2017, vol. 10718, pp. 168–181.
LibreCat
| DOI
2017 | Conference Paper | LibreCat-ID: 16348
F. Biermeier, B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, pp. 285–300.
LibreCat
| DOI
2017 | Conference Paper | LibreCat-ID: 16349
P. Podlipyan, S. Li, C. Markarian, and F. Meyer auf der Heide, “A Continuous Strategy for Collisionless Gathering,” in Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–197.
LibreCat
| DOI
2016 | Conference Paper | LibreCat-ID: 19961
M. Wahby, D. N. Hofstadler, M. K. Heinrich, P. Zahadat, and H. Hamann, “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap,” in Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016.
LibreCat
| DOI