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 

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 

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 

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 

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.

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

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 

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 

Liedtke, D. J. (2018). Influence of Stationary Robots on Continuous Robot Formation Problems.

Markarian, C. (2018). Online Connected Dominating Set Leasing. ArXiv:1805.02994.

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 

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 

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 

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 

Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA).https://doi.org/10.1007/978-3-319-94667-2_18 

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 

Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität Paderborn.

Polevoy, G., Trajanovski, S., Grosso, P., &; de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, &; A. Zelikovsky (Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham: Springer International Publishing.

Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., &; Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems.https://doi.org/10.1016/j.future.2018.08.011 

Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., Sgall, J., &; Suess, 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 

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 

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.

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 

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 

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 

Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn.

Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn.

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 

Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn.

Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn.

Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn.

Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-271 

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 

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 

Li, S. (2017). Parallel fixed parameter tractable problems. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-252 

Markarian, C. (2017). Leasing with Uncertainty. In International Conference on Operations Research (OR). Berlin.https://doi.org/10.1007/978-3-319-89920-6_57 

Khaluf, Y., Markarian, C., Simoens, P., &; Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017).https://doi.org/10.1007/978-3-319-59930-4_12 

Feldotto, M., Leder, L., &; Skopalik, A. (2017). Congestion Games with Complementarities. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) (pp. 222--233).https://doi.org/10.1007/978-3-319-57586-5_19 

Feldotto, M., Gairing, M., Kotsialou, G., &; Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In Proceedings of the 13th International Conference on Web and Internet Economics (WINE).https://doi.org/10.1007/978-3-319-71924-5_14 

Polevoy, G., Trajanovski, S., Grosso, P., &; de Laat, C. (2017). Filtering Undesirable Flows in Networks. In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I (pp. 3–17). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-71150-8_1 

Polevoy, G., &; de Weerdt, M. M. (2017). Reciprocation Effort Games. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer.

Polevoy, G., &; de Weerdt, M. M. (2017). Competition between Cooperative Projects. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer.

Fischer, M., Jung, D., &; Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. ArXiv:1702.03400.

Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &; Riechers, S. (2017). 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) (Vol. 10787, pp. 207–222). Springer.https://doi.org/10.1007/978-3-319-89441-6 

Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &; Podlipyan, P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW) (pp. 139–150).https://doi.org/10.1007/978-3-319-59605-1_13 

Kling, P., Mäcker, A., Riechers, S., &; Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 123--132).https://doi.org/10.1145/3087556.3087578 

Feldkord, B., Markarian, C., &; Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 17–31).https://doi.org/10.1007/978-3-319-71147-8_2 

Podlipyan, P. (2017). Local Algorithms for the Continuous Gathering Problem. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-230 

Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-231 

Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &; Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization, 36(4), 1168–1194.https://doi.org/10.1007/s10878-017-0198-x 

van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H., &; Engels, G. (2017). 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) (pp. 379–385). Piscataway, NJ, USA: IEEE.https://doi.org/10.1109/REW.2017.26 

Feldkord, B., &; Meyer auf der Heide, F. (2017). The Mobile Server Problem. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 313–319).https://doi.org/10.1145/3087556.3087575 

Drees, M., Feldotto, M., Riechers, S., &; Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) (pp. 175--187).https://doi.org/10.1007/978-3-319-62389-4_15 

Nowack, J. (2017). On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn.

Gausemeier, J., Bodden, E.,  Dressler, F., Dumitrescu, R., Meyer auf der Heide, F., Scheytt, C., &; Trächtler, A. (2017). Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn.

Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J. S., &; Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In Structural Information and Communication Complexity.https://doi.org/10.1007/978-3-319-72050-0_13 

Nachtigall, S. (2017). Sortieren dynamischer Daten. Universität Paderborn.

Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität Paderborn.

Bürmann, J. (2017). Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn.

Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn.

Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., &; Skopalik, A. (2017). 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) (pp. 462–467).https://doi.org/10.1007/978-3-319-59144-5_32 

John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., &; Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In Proceedings of the 25th European Conference on Information Systems (ECIS) (pp. 2970–2979).

Antoniadis, A., Kling, P., Ott, S., &; Riechers, S. (2017). Continuous Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer Science, 1–13.https://doi.org/10.1016/j.tcs.2017.03.021 

Brandt, S., Fischer, M., Gerges, M., Jähn, C., &; Berssenbrügge, J. (2017). Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In Volume 1: 37th Computers and Information in Engineering Conference (Vol. 1, pp. 91:1-91:10). Cleveland, USA.https://doi.org/10.1115/detc2017-67528 

Brandt, S., &; Fischer, M. (2017). Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 (Vol. 369, pp. 415–427). Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Fischer, M., Jung, D., &; Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro, &; Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS (Vol. 10718, pp. 168–181). Vienna, Austria: Springer.https://doi.org/10.1007/978-3-319-72751-6_13 

Biermeier, F., Feldkord, B., Malatyali, M., &; Meyer auf der Heide, F. (2017). 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) (pp. 285–300). Springer.https://doi.org/10.1007/978-3-319-89441-6_21 

Podlipyan, P., Li, S., Markarian, C., &; Meyer auf der Heide, F. (2017). A Continuous Strategy for Collisionless Gathering. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) (pp. 182–197).https://doi.org/10.1007/978-3-319-72751-6_14  

Wahby, M., Hofstadler, D. N., Heinrich, M. K., Zahadat, P., &; Hamann, H. (2016). 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.https://doi.org/10.1109/saso.2016.8 

Heinrich, M. K., Wahby, M., Divband Soorati, M., Hofstadler, D. N., Zahadat, P., Ayres, P.,https://doi.org/10.1109/fas-w.2016.43__Hamann, H. (2016). Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures. In Proc. of the 1st International Workshop on Self-Organising Construction (SOCO).https://doi.org/10.1109/fas-w.2016.43 

Hamann, H., Khaluf, Y., Botev, J., Divband Soorati, M., Ferrante, E., Kosak, O.,https://doi.org/10.3389/frobt.2016.00014__Zamuda, A. (2016). Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems. Frontiers in Robotics and AI.https://doi.org/10.3389/frobt.2016.00014 

Hamann, H., &; Divband Soorati, M. (2016). Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016).https://doi.org/10.1109/IROS.2016.7759845 

Dorigo, M., Hamann, H., Valentini, G., &; Ferrante, E. (2016). Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems. Journal of Autonomous Agents and Multi-Agent Systems, 30(3), 553–580.https://doi.org/10.1007/s10458-015-9323-3 

Drees, M. (2016). Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn.

Hamann, H., Valentini, G., &; Dorigo, M. (2016). Population Coding: A New Design Paradigm for Embodied Distributed Systems. In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham.https://doi.org/10.1007/978-3-319-44427-7_15 

von Mammen, S., Hamann, H., &; Heider, M. (2016). Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems. In ACM Symposium on Virtual Reality Software and Technology (VRST).https://doi.org/10.1145/2993369.2993400 

Rybá, M., &; Hamann, H. (2016). Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016).https://doi.org/10.1145/2908812.2908815 

Khaluf, Y., &; Hamann, H. (2016). On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations. In ANTS 2016 (Vol. 9882, p. 298).

Valentini, G., Brambilla, D., Hamann, H., &; Dorigo, M. (2016). Collective Perception of Environmental Features in a Robot Swarm. In 10th Int. Conf. on Swarm Intelligence, ANTS 2016.https://doi.org/10.1007/978-3-319-44427-7_6 

Leder, L. (2016). Congestion Games with Mixed Objectives. Universität Paderborn.

Drees, M., Gmyr, R., &; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).https://doi.org/10.1145/2935764.2935783 

Polevoy, G., de Weerdt, M. M., &; Jonker, C. M. (2016). The Game of Reciprocation Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence (Vol. Volume 285: ECAI 2016, pp. 417–425).https://doi.org/10.3233/978-1-61499-672-9-417 

Polevoy, G., de Weerdt, M., &; Jonker, C. (2016). The Convergence of Reciprocation. In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.

Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &; Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 477–488).https://doi.org/10.1007/978-3-319-48749-6_35 

Meyer auf der Heide, F. (Ed.). (2016). Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC).https://doi.org/10.1145/2936716 

Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &; Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 578--592).https://doi.org/10.1007/978-3-319-48749-6_42 

Feldotto, M., Leder, L., &; Skopalik, A. (2016). Congestion Games with Mixed Objectives. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 655--669).https://doi.org/10.1007/978-3-319-48749-6_47 

Bülling, J. (2016). Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden.

Koepe, J. (2016). Price-Based Allocation Games. Universität Paderborn.

Kutzias, D. (2016). Friendship Processes in Network Creation Games. Universität Paderborn.

Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn.

Cord-Landwehr, A., Fischer, M., Jung, D., &; Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303.

Kühne, T., Hamann, H., Arifulina, S., &; Engels, G. (2016). Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) (pp. 278--293).https://doi.org/10.1007/978-3-319-30668-1_18 

Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn.

Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

König, J., Mäcker, A., Meyer auf der Heide, F., &; Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 563--577).https://doi.org/10.1007/978-3-319-48749-6_41 

Harks, T., Höfer, M., Schewior, K., &; Skopalik, A. (2016). Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking, (4), 2553–2562.https://doi.org/10.1109/TNET.2015.2468571 

Drees, M., Feldkord, B., &; Skopalik, A. (2016). Strategic Online Facility Location. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 593--607).https://doi.org/10.1007/978-3-319-48749-6_43 

Dressler, F., &; Meyer auf der Heide, F. (Eds.). (2016). Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Presented at the MobiHoc, Paderborn, Germany: ACM.https://doi.org/10.1145/2942358 

Fischer, M., Jähn, C., Meyer auf der Heide, F., &; Petring, R. (2016). Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann &; P. Sanders (Eds.), Algorithm Engineering (Vol. 9220, pp. 226–244). Springer.https://doi.org/10.1007/978-3-319-49487-6_7