Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.
LibreCat: /record/33947
DOI: 10.1016/j.tcs.2022.10.031
arXiv: 2010.04424 

A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility 
J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Schloss Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.
LibreCat: /record/34008
DOI: 10.4230/LIPIcs.OPODIS.2022.15
arXiv: 2206.07567 

Online load balancing on uniform machines with limited migration
M. Maack, Operations Research Letters 51 (2023) 220–225.
LibreCat: /record/44077
DOI: 10.1016/j.orl.2023.02.013

Unifying Gathering Protocols for Swarms of Mobile Robots
J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.
LibreCat: /record/44769
DOI: 10.1007/978-3-031-30448-4_1

Local Protocols for Contracting and Expanding Robot Formation Problems
J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.
LibreCat: /record/45580
DOI: 10.17619/UNIPB/1-1750

Online Algorithms for Allocating Heterogeneous Resources
T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.
LibreCat: /record/45579
DOI: 10.17619/UNIPB/1-1751

On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling
S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023.
LibreCat: /record/45781
DOI: 10.17619/UNIPB/1-1768 

Server Cloud Scheduling
M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).
LibreCat: /record/50458
DOI: 10.1007/s00453-023-01189-x

Scheduling with Many Shared Resources
M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.
LibreCat: /record/50460
DOI: 10.1109/ipdps54959.2023.00049

A Discrete and Continuous Study of the Max-Chain-Formation Problem
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).
LibreCat: /record/29843
DOI: 10.1016/j.ic.2022.104877

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

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

Cardinality Constrained Scheduling in Online Models
L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, 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), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.
LibreCat: /record/33085
DOI: 10.4230/LIPIcs.STACS.2022.28

(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling
M. Maack, S. Pukrop, A.R. Rasmussen, 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, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.
LibreCat: /record/33491
DOI: 10.4230/LIPIcs.ESA.2022.77

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

Server Cloud Scheduling
M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online Algorithms, Springer International Publishing, Cham, 2022.
LibreCat: /record/29872
DOI: 10.1007/978-3-030-92702-8_10

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

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

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

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

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

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

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

The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, 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, Springer, 2021, pp. 289–304.
LibreCat: /record/26986
DOI: 10.1007/978-3-030-91081-5_19
arXiv: 2109.11856

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

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

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

A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.
LibreCat: /record/19899
DOI: 10.1007/978-3-030-64348-5_6
arXiv: 2010.02043 

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

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

The Online Multi-Commodity Facility Location Problem
J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.
LibreCat: /record/17371
DOI: 10.1145/3350755.3400263
arXiv: 2010.02043 

Local Gathering of Mobile Robots in Three Dimensions
M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020.
LibreCat: /record/16968
DOI: 10.1007/978-3-030-54921-3_4
arXiv: arXiv:2005.07495

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

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

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.
LibreCat: /record/15169

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

Approximating Weighted Completion Time for Order Scheduling with Setup Times
S. Pukrop, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.
LibreCat: /record/13868

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

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

Approaches for Collaborative Security Defences in Multi Network Environments
R. Koning, G. Polevoy, L. Meijer, C. de Laat, P. Grosso, 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: /record/17667
DOI: 10.1109/CSCloud/EdgeCom.2019.000-9

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

Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games
M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games, Universität Paderborn, 2019.
LibreCat: /record/8080
DOI: 10.17619/UNIPB/1-588

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

 Multi-unit Bilateral Trade
P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019.
LibreCat: /record/5471
DOI: 10.1609/aaai.v33i01.33011973

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

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

Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels
S. Brandt, C. Jähn, M. Fischer, F. Meyer auf der Heide, ArXiv:1904.08225 (2019).
LibreCat: /record/16341
arXiv: 1904.08225

The Mobile Server Problem
B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (TOPC) 6 (2019).
LibreCat: /record/13873
DOI: 10.1145/3364204

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

Continuous Protocols for Swarm Robotics
P. Kling, F. Meyer auf der Heide, in: Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Springer, 2019, pp. 317–334.
LibreCat: /record/13939
DOI: 10.1007/978-3-030-11072-7‑13

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

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

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

 From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation
M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.
LibreCat: /record/10281

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

Fully-Dynamic Bin Packing with Little Repacking
B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24.
LibreCat: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

Online Facility Location with Mobile Facilities
B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.
LibreCat: /record/2485
DOI: 10.1145/3210377.3210389

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

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

Disaggregating User Evaluations Using the Shapley Value
M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6.
LibreCat: /record/2831
DOI: 10.1145/3230654.3230659

Towards Flexible Demands in Online Leasing Problems. 
S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.
LibreCat: /record/2848
DOI: 10.1007/s00453-018-0420-y

Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks
F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018).
LibreCat: /record/2849
DOI: 10.1007/s00224-017-9836-z

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

An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018.
LibreCat: /record/24396
DOI: 10.1007/978-3-319-94667-2_18

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

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

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

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

Scheduling Shared Continuous Resources on Many-Cores
E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.
LibreCat: /record/63
DOI: 10.1007/s10951-017-0518-0

A Self-Stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.
LibreCat: /record/4563

Brief Announcement: Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.
LibreCat: /record/4565
DOI: 10.1145/3210377.3210663

Brief Announcement: Communication in Systems of Home Based Mobile Agents
F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018.
LibreCat: /record/7570
DOI: 10.1145/3210377.3210662

A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension
M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

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

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

Congestion games with mixed objectives
M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.
LibreCat: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

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

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

Learning deterministic bandit behaviour form compositions
J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018.
LibreCat: /record/1188

Local Strategies for Swarm Formations on a Grid
D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn, 2018.
LibreCat: /record/1209
DOI: 10.17619/UNIPB/1-271

A Dynamic Distributed Data Structure for Top-k and k-Select Queries
B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.
LibreCat: /record/16392
DOI: 10.1007/978-3-319-98355-4_18

Pure Nash equilibria in restricted budget games
M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018).
LibreCat: /record/1369
DOI: 10.1007/s10878-018-0269-7

Parallel fixed parameter tractable problems
S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn, 2017.
LibreCat: /record/19604
DOI: 10.17619/UNIPB/1-252

Leasing with Uncertainty
C. Markarian, in: International Conference on Operations Research (OR), 2017.
LibreCat: /record/2851
DOI: 10.1007/978-3-319-89920-6_57

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

Congestion Games with Complementarities
M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.
LibreCat: /record/112
DOI: 10.1007/978-3-319-57586-5_19
arXiv: 1701.07304

Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games
M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.
LibreCat: /record/113
DOI: 10.1007/978-3-319-71924-5_14
arXiv: 1710.01634

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

Reciprocation Effort Games
G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.
LibreCat: /record/17653

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

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

Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times
A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 207–222.
LibreCat: /record/79
DOI: 10.1007/978-3-319-89441-6

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

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

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

Local Algorithms for the Continuous Gathering Problem
P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität Paderborn, 2017.
LibreCat: /record/703
DOI: 10.17619/UNIPB/1-230

Scheduling with Scarce Resources
S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.
LibreCat: /record/704
DOI: 10.17619/UNIPB/1-231

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