Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &; Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356.https://doi.org/10.1145/3490148.3538595 
LibreCat: /record/31847
DOI: 10.1145/3490148.3538595
arXiv: 2205.11102

Polevoy, G., &; Dziubiski, M. (2022). Fair, Individually Rational and Cheap Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization.https://doi.org/10.24963/ijcai.2022/64 
LibreCat: /record/34040
DOI: 10.24963/ijcai.2022/64

Epstein, L., Lassota, A., Levin, A., Maack, M., &; Rohwedder, L. (2022). Cardinality Constrained Scheduling in Online Models. In P. Berenbrink &; B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2022.28 
LibreCat: /record/33085
DOI: 10.4230/LIPIcs.STACS.2022.28

Maack, M., Pukrop, S., &; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, &; G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ESA.2022.77 
LibreCat: /record/33491
DOI: 10.4230/LIPIcs.ESA.2022.77

Baswana, S., Gupta, S., &; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. Algorithmica.https://doi.org/10.1007/s00453-022-00978-0 
LibreCat: /record/31479
DOI: 10.1007/s00453-022-00978-0

Maack, M., Meyer auf der Heide, F., &; Pukrop, S. (2022). Server Cloud Scheduling. In Approximation and Online Algorithms. Springer International Publishing.https://doi.org/10.1007/978-3-030-92702-8_10 
LibreCat: /record/29872
DOI: 10.1007/978-3-030-92702-8_10

Knollmann, T., &; Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697.https://doi.org/10.1016/j.ic.2021.104697 
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Castenow, J., Harbig, J., Jung, D., Knollmann, T., &; Meyer auf der Heide, F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L. Gasieniec, R. Klasing, &; T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) (Vol. 12961, pp. 29–44). Springer.https://doi.org/10.1007/978-3-030-89240-1_3 
LibreCat: /record/23730
DOI: 10.1007/978-3-030-89240-1_3
arXiv: 2010.04424

Bernijazov, R., Dicks, A., Dumitrescu, R., Foullois, M., Hanselle, J. M., Hüllermeier, E., Karakaya, G., Ködding, P., Lohweg, V., Malatyali, M., Meyer auf der Heide, F., Panzner, M., &; Soltenborn, C. (2021). A Meta-Review on Artiû01cial Intelligence in Product Creation. Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21). 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada.
LibreCat: /record/23779

Feldkord, B., Knollmann, T., Malatyali, M., &; Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. Theory of Computing Systems, 65, 943–984.https://doi.org/10.1007/s00224-020-10023-8 
LibreCat: /record/20683
DOI: 10.1007/s00224-020-10023-8

Bienkowski, M., Feldkord, B., &; Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 14:1-14:17).https://doi.org/10.4230/LIPIcs.STACS.2021.14 
LibreCat: /record/20817
DOI: 10.4230/LIPIcs.STACS.2021.14

Li, S., Markarian, C., Meyer auf der Heide, F., &; Podlipyan, P. (2021). A continuous strategy for collisionless gathering. Theoretical Computer Science, 852, 41–60.https://doi.org/10.1016/j.tcs.2020.10.037 
LibreCat: /record/22510
DOI: 10.1016/j.tcs.2020.10.037

Li, S., Meyer auf der Heide, F., &; Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theoretical Computer Science, 852, 29–40.https://doi.org/10.1016/j.tcs.2020.11.009 
LibreCat: /record/22511
DOI: 10.1016/j.tcs.2020.11.009

Castenow, J., Götte, T., Knollmann, T., &; Meyer auf der Heide, F. (2021). The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation. In C. Johnen, E. M. Schiller, &; S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021 (Vol. 13046, pp. 289–304). Springer.https://doi.org/10.1007/978-3-030-91081-5_19 
LibreCat: /record/26986
DOI: 10.1007/978-3-030-91081-5_19
arXiv: 2109.11856

Maack, M., Meyer auf der Heide, F., &; Pukrop, S. (2021). Full Version -- Server Cloud Scheduling. In arXiv:2108.02109.
LibreCat: /record/27778

Berger, T. F. (2021). Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.
LibreCat: /record/44234

Pranger, S. (2021). Online k-Facility Reallocation using k-Server Algorithms.
LibreCat: /record/44233

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 S. Devismeshttps://doi.org/10.1007/978-3-030-64348-5_6__&; N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings (Vol. 12514, pp. 65–80). Springer.https://doi.org/10.1007/978-3-030-64348-5_6 
LibreCat: /record/19899
DOI: 10.1007/978-3-030-64348-5_6
arXiv: 2010.02043 

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: /record/20159
DOI: 10.4230/LIPIcs.ESA.2020.12

Castenow, J., Harbig, J., Jung, D., Knollmann, T., &; Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &; Luminous Robots with Limited Visibility . In S. Devismes &; N.https://doi.org/10.1007/978-3-030-64348-5_5__Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings  (Vol. 12514, pp. 60–64). Springer.https://doi.org/10.1007/978-3-030-64348-5_5 
LibreCat: /record/20185
DOI: 10.1007/978-3-030-64348-5_5
arXiv: 2010.04424 

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: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

Castenow, J., Kling, P., Knollmann, T., &; Meyer auf der Heide, F. (2020). 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.https://doi.org/10.1145/3350755.3400263 
LibreCat: /record/17371
DOI: 10.1145/3350755.3400263
arXiv: 2010.02043 

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: /record/16968
DOI: 10.1007/978-3-030-54921-3_4
arXiv: arXiv:2005.07495

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

Wever, M. D., van Rooijen, L., &; Hamann, H. (2020). Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation, 28(2), 165–193.https://doi.org/10.1162/evco_a_00266 
LibreCat: /record/15025
DOI: 10.1162/evco_a_00266

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: /record/15169

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: /record/16299
DOI: 10.1016/j.tcs.2020.02.018

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: /record/13868

Karl, H., Kundisch, D., Meyer auf der Heide, F., &; Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. Business &; Information Systems Engineering, 62(6), 467–481.https://doi.org/10.1007/s12599-019-00627-x 
LibreCat: /record/13770
DOI: 10.1007/s12599-019-00627-x

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: /record/17432
DOI: 10.4230/LIPICS.MFCS.2019.65

Koning, R., Polevoy, G., Meijer, L., de Laat, C., &; Grosso, P. (2019). 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) (pp. 113–123).https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9 
LibreCat: /record/17667
DOI: 10.1109/CSCloud/EdgeCom.2019.000-9

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

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: /record/8080
DOI: 10.17619/UNIPB/1-588

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: /record/8866

Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., &; de Keijzer, B. (2019).https://doi.org/10.1609/aaai.v33i01.33011973__Multi-unit Bilateral Trade. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA.https://doi.org/10.1609/aaai.v33i01.33011973 
LibreCat: /record/5471
DOI: 10.1609/aaai.v33i01.33011973

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: /record/12870
DOI: 10.1007/978-3-030-39479-0_9
arXiv: 1907.09834

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

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: /record/16341
arXiv: 1904.08225

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: /record/13873
DOI: 10.1145/3364204

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: /record/13937
DOI: 10.1007/s00591-019-00249-0

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: /record/13939
DOI: 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 
LibreCat: /record/13942
DOI: 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 
LibreCat: /record/13946
DOI: 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 
LibreCat: /record/14539
DOI: 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.
LibreCat: /record/10281

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

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: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

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: /record/2485
DOI: 10.1145/3210377.3210389

Liedtke, D. J. (2018). Influence of Stationary Robots on Continuous Robot Formation Problems.
LibreCat: /record/25121

Markarian, C. (2018). Online Connected Dominating Set Leasing. ArXiv:1805.02994.
LibreCat: /record/19978

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: /record/2831
DOI: 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 
LibreCat: /record/2848
DOI: 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 
LibreCat: /record/2849
DOI: 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 
LibreCat: /record/2850
DOI: 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 
LibreCat: /record/24396
DOI: 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 
LibreCat: /record/3551
DOI: 10.1007/s10878-018-0325-3

Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität Paderborn.
LibreCat: /record/3851

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.
LibreCat: /record/17651

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 
LibreCat: /record/17666
DOI: 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 
LibreCat: /record/63
DOI: 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 
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

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: /record/4563

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: /record/4565
DOI: 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 
LibreCat: /record/7570
DOI: 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 
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn.
LibreCat: /record/5403

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

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: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

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

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

Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn.
LibreCat: /record/1188

Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-271 
LibreCat: /record/1209
DOI: 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 
LibreCat: /record/16392
DOI: 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 
LibreCat: /record/1369
DOI: 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 
LibreCat: /record/19604
DOI: 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 
LibreCat: /record/2851
DOI: 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 
LibreCat: /record/24398
DOI: 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 
LibreCat: /record/112
DOI: 10.1007/978-3-319-57586-5_19
arXiv: 1701.07304

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 
LibreCat: /record/113
DOI: 10.1007/978-3-319-71924-5_14
arXiv: 1710.01634

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 
LibreCat: /record/17652
DOI: 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.
LibreCat: /record/17653

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

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

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 
LibreCat: /record/79
DOI: 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 
LibreCat: /record/82
DOI: 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 
LibreCat: /record/59
DOI: 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 
LibreCat: /record/70
DOI: 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 
LibreCat: /record/703
DOI: 10.17619/UNIPB/1-230

Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-231 
LibreCat: /record/704
DOI: 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 
LibreCat: /record/706
DOI: 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 
LibreCat: /record/97
DOI: 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 
LibreCat: /record/55
DOI: 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 
LibreCat: /record/66
DOI: 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.
LibreCat: /record/695

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.
LibreCat: /record/16444

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 
LibreCat: /record/16461
DOI: 10.1007/978-3-319-72050-0_13
arXiv: arXiv:1706.03568 

Nachtigall, S. (2017). Sortieren dynamischer Daten. Universität Paderborn.
LibreCat: /record/1073

Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität Paderborn.
LibreCat: /record/1074

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

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