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.

126 Publications


2020 | Dissertation | LibreCat-ID: 15631
B. Feldkord, Mobile Resource Allocation. 2020.
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
 

2019 | Dissertation | LibreCat-ID: 8080
M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Paderborn, 2019.
LibreCat | Files available | DOI | Download (ext.)
 

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: 12870
B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 2019, pp. 120–137.
LibreCat | DOI | arXiv
 

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

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 | Journal Article | LibreCat-ID: 13937
F. Meyer auf der Heide, “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln,” Mathematische Semesterberichte, vol. 66, no. 2, pp. 259–260, 2019.
LibreCat | DOI
 

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,” in Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA.
LibreCat | Files available
 

2019 | Book Chapter | LibreCat-ID: 13939
P. Kling and F. Meyer auf der Heide, “Continuous Protocols for Swarm Robotics,” in Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–334.
LibreCat | DOI
 

2019 | Journal Article | LibreCat-ID: 13946
F. N. Abu-Khzam, S. Li, C. Markarian, and F. Meyer auf der Heide, “Efficient parallel algorithms for parameterized problems,” Theoretical Computer Science, vol. 786, pp. 2–12, 2019.
LibreCat | DOI
 

2019 | 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.
LibreCat | Files available | DOI
 

2019 | Dissertation | LibreCat-ID: 14851
A. Mäcker, On Scheduling with Setup Times. 2019.
LibreCat | Files available
 

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
 

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 | Bachelorsthesis | LibreCat-ID: 5404
P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem. 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 | 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 | Mastersthesis | LibreCat-ID: 1186
A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.
LibreCat
 

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
 

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 | 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 | 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: 1187
M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition Game Model. 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 | 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 | 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: 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 | Bachelorsthesis | LibreCat-ID: 1188
J. Kempf, Learning deterministic bandit behaviour form compositions. Universität Paderborn, 2018.
LibreCat
 

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: 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: 3851
S. Koop, Congestion Games mit gewichteten Strategien. 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 | DOI
 

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 | Bachelorsthesis | LibreCat-ID: 5403
M. Geromel, Mobile Facility Leasing. 2018.
LibreCat
 

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 | 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: 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 | 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 | Bachelorsthesis | LibreCat-ID: 1073
S. Nachtigall, Sortieren dynamischer Daten. 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 | 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: 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: 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: 2851
C. Markarian, “Leasing with Uncertainty,” in International Conference on Operations Research (OR), Berlin, 2017.
LibreCat | Files available | DOI
 

2017 | Bachelorsthesis | LibreCat-ID: 1074
S. Pukrop, Robuste Optimierung in Congestion Games. 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 | Dissertation | LibreCat-ID: 703
P. Podlipyan, Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017.
LibreCat
 

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 | Journal Article | LibreCat-ID: 63
E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,” Journal of Scheduling, 2017.
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 | 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 | 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 | Dissertation | LibreCat-ID: 704
S. Riechers, Scheduling with Scarce Resources. Universität Paderborn, 2017.
LibreCat | Files available | DOI
 

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: 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.)
 

2016 | Conference Paper | LibreCat-ID: 143
F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.
LibreCat | Files available | DOI
 

2016 | Conference Paper | LibreCat-ID: 207
A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.
LibreCat | Files available | DOI
 

2016 | Conference (Editor) | LibreCat-ID: 163
F. Dressler and F. Meyer auf der Heide, Eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016.
LibreCat | DOI
 

2016 | Special Issue | LibreCat-ID: 187
F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA 2014, no. 1. 2016.
LibreCat | Files available | DOI
 

2016 | Conference Paper | LibreCat-ID: 149
M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.
LibreCat | Files available | DOI
 

2016 | Mastersthesis | LibreCat-ID: 210
L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn, 2016.
LibreCat
 

2016 | Journal Article | LibreCat-ID: 145
M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, pp. 1655–1677, 2016.
LibreCat | Files available | DOI
 

2016 | Conference Paper | LibreCat-ID: 157
J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577.
LibreCat | Files available | DOI
 

2016 | Bachelorsthesis | LibreCat-ID: 5406
J. Bülling, Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden. 2016.
LibreCat
 

2016 | Mastersthesis | LibreCat-ID: 688
D. Kutzias, Friendship Processes in Network Creation Games. Universität Paderborn, 2016.
LibreCat
 

2016 | Conference Paper | LibreCat-ID: 209
M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.
LibreCat | Files available | DOI | arXiv
 

2016 | Bachelorsthesis | LibreCat-ID: 1082
T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.
LibreCat
 

2016 | Journal Article | LibreCat-ID: 139
S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” Journal of Combinatorial Optimization, no. 4, pp. 1197--1216, 2016.
LibreCat | Files available | DOI
 

2016 | Conference Paper | LibreCat-ID: 177
F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.
LibreCat | Files available | DOI
 

2016 | Bachelorsthesis | LibreCat-ID: 5407
J. Koepe, Price-Based Allocation Games. 2016.
LibreCat
 

2016 | Mastersthesis | LibreCat-ID: 689
J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.
LibreCat
 

2016 | Dissertation | LibreCat-ID: 154
A. Cord Landwehr, Selfish Network Creation - On Variants of Network Creation Games. Universität Paderborn, 2016.
LibreCat | Files available
 

2016 | Journal Article | LibreCat-ID: 159
T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” IEEE/ACM Transactions on Networking, no. 4, pp. 2553–2562, 2016.
LibreCat | Files available | DOI
 

2016 | Dissertation | LibreCat-ID: 200
M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.
LibreCat | Files available
 

2015 | Mastersthesis | LibreCat-ID: 251
K. Pfannschmidt, Solving the aggregated bandits problem. Universität Paderborn, 2015.
LibreCat
 

2015 | Dissertation | LibreCat-ID: 270
S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn, 2015.
LibreCat | Files available
 

2015 | Conference Paper | LibreCat-ID: 275
A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global - Act Local,” in Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.
LibreCat | Files available | DOI
 

2015 | Conference Paper | LibreCat-ID: 240
S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards Flexible Demands in Online Leasing Problems,” in Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288.
LibreCat | Files available | DOI
 

2015 | Conference Paper | LibreCat-ID: 271
M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.
LibreCat | Files available | DOI | arXiv
 

2015 | Bachelorsthesis | LibreCat-ID: 277
N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn, 2015.
LibreCat
 

2015 | Bachelorsthesis | LibreCat-ID: 316
J. Pautz, Budget Games with priced strategies. Universität Paderborn, 2015.
LibreCat
 

2015 | Dissertation | LibreCat-ID: 317
C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015.
LibreCat | Files available
 

2015 | Conference Paper | LibreCat-ID: 266
C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.
LibreCat | Files available | DOI
 

2015 | Dissertation | LibreCat-ID: 267
C. Markarian, Online Resource Leasing. Universität Paderborn, 2015.
LibreCat | Files available
 

2015 | Conference Paper | LibreCat-ID: 274
A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive Scheduling on Machines with Setup Times,” in Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.
LibreCat | Files available | DOI
 

2015 | Journal Article | LibreCat-ID: 320
I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” Transactions on Economics and Computation, vol. 3, no. 1, 2015.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 453
M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 395
S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 459
S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 435
A. Antoniadis et al., “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules,” in Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74.
LibreCat | Files available | DOI
 

2014 | Bachelorsthesis | LibreCat-ID: 373
D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014.
LibreCat
 

2014 | Conference Paper | LibreCat-ID: 380
A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service in Network Creation Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–428.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 412
M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.
LibreCat | Files available | DOI | arXiv
 

2014 | Dissertation | LibreCat-ID: 431
P. Kling, Energy-efficient Scheduling Algorithms. Universität Paderborn, 2014.
LibreCat | Files available
 

2014 | Conference Paper | LibreCat-ID: 462
M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex Infinitely Repeated Games,” in Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–630.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 455
C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria in weighted congestion games,” in Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–257.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 379
S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms for Set Cover Leasing Problems,” in Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34.
LibreCat | Files available | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed