Castenow, Jannik, et al. “The K-Server with Preferences Problem.”10.1145/3490148.3538595__Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
LibreCat: /record/31847
DOI: 10.1145/3490148.3538595
arXiv: 2205.11102

Polevoy, Gleb, and Marcin Dziubiski. “Fair, Individually Rational and Cheap Adjustment.”10.24963/ijcai.2022/64__Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, edited by Luc De Raedt, International Joint Conferences on Artificial Intelligence Organization, 2022, doi:10.24963/ijcai.2022/64.
LibreCat: /record/34040
DOI: 10.24963/ijcai.2022/64

Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.”10.4230/LIPIcs.STACS.2022.28__39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15, doi:10.4230/LIPIcs.STACS.2022.28.
LibreCat: /record/33085
DOI: 10.4230/LIPIcs.STACS.2022.28

Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.”10.4230/LIPIcs.ESA.2022.77__30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:10.4230/LIPIcs.ESA.2022.77.
LibreCat: /record/33491
DOI: 10.4230/LIPIcs.ESA.2022.77

Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.”10.1007/s00453-022-00978-0__Algorithmica, Springer Science and Business Media LLC, 2022, doi:10.1007/s00453-022-00978-0.
LibreCat: /record/31479
DOI: 10.1007/s00453-022-00978-0

Maack, Marten, et al. “Server Cloud Scheduling.”10.1007/978-3-030-92702-8_10__Approximation and Online Algorithms, Springer International Publishing, 2022, doi:10.1007/978-3-030-92702-8_10.
LibreCat: /record/29872
DOI: 10.1007/978-3-030-92702-8_10

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”10.1016/j.ic.2021.104697__Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697.
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time.”10.1007/978-3-030-89240-1_3__Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec et al., vol. 12961, Springer, 2021, pp. 29–44, doi:10.1007/978-3-030-89240-1_3.
LibreCat: /record/23730
DOI: 10.1007/978-3-030-89240-1_3
arXiv: 2010.04424

Bernijazov, Ruslan, et al. “A Meta-Review on Artiû01cial Intelligence in Product Creation.” Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021.
LibreCat: /record/23779

Feldkord, Björn, et al. “Managing Multiple Mobile Resources.”10.1007/s00224-020-10023-8__Theory of Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8.
LibreCat: /record/20683
DOI: 10.1007/s00224-020-10023-8

Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.”10.4230/LIPIcs.STACS.2021.14__Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14.
LibreCat: /record/20817
DOI: 10.4230/LIPIcs.STACS.2021.14

Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.”10.1016/j.tcs.2020.10.037__Theoretical Computer Science, vol. 852, 2021, pp. 41–60, doi:10.1016/j.tcs.2020.10.037.
LibreCat: /record/22510
DOI: 10.1016/j.tcs.2020.10.037

Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.”10.1016/j.tcs.2020.11.009__Theoretical Computer Science, vol. 852, 2021, pp. 29–40, doi:10.1016/j.tcs.2020.11.009.
LibreCat: /record/22511
DOI: 10.1016/j.tcs.2020.11.009

Castenow, Jannik, et al. “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.”10.1007/978-3-030-91081-5_19__Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, edited by C. Johnen et al., vol. 13046, Springer, 2021, pp. 289–304, doi:10.1007/978-3-030-91081-5_19.
LibreCat: /record/26986
DOI: 10.1007/978-3-030-91081-5_19
arXiv: 2109.11856

Maack, Marten, et al. “Full Version -- Server Cloud Scheduling.” ArXiv:2108.02109, 2021.
LibreCat: /record/27778

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

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

Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.”10.1007/978-3-030-64348-5_6__Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, edited by Stéphane10.1007/978-3-030-64348-5_6__Devismes10.1007/978-3-030-64348-5_6__and Neeraj10.1007/978-3-030-64348-5_6__Mittal, vol. 12514, Springer, 2020, pp. 65–80, doi:10.1007/978-3-030-64348-5_6.
LibreCat: /record/19899
DOI: 10.1007/978-3-030-64348-5_6
arXiv: 2010.02043 

Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.”10.4230/LIPIcs.ESA.2020.12__28th Annual European Symposium on Algorithms (ESA 2020), edited by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020, pp. 12:1-12:14, doi:10.4230/LIPIcs.ESA.2020.12.
LibreCat: /record/20159
DOI: 10.4230/LIPIcs.ESA.2020.12

Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &; Luminous Robots with Limited Visibility .”10.1007/978-3-030-64348-5_5__Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane10.1007/978-3-030-64348-5_5__Devismes and Neeraj10.1007/978-3-030-64348-5_5__Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:10.1007/978-3-030-64348-5_5.
LibreCat: /record/20185
DOI: 10.1007/978-3-030-64348-5_5
arXiv: 2010.04424 

Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.”10.1145/3350755.3400281__Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281.
LibreCat: /record/17370
DOI: 10.1145/3350755.3400281
arXiv: 2005.08391

Castenow, Jannik, et al. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.”10.1145/3350755.3400263__Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400263.
LibreCat: /record/17371
DOI: 10.1145/3350755.3400263
arXiv: 2010.02043 

Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.”10.1007/978-3-030-54921-3_4__Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020, doi: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, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869.
LibreCat: /record/15631
DOI: 10.17619/UNIPB/1-869

Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.”10.1162/evco_a_00266__Evolutionary Computation, vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:10.1162/evco_a_00266.
LibreCat: /record/15025
DOI: 10.1162/evco_a_00266

Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM.
LibreCat: /record/15169

Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”10.1016/j.tcs.2020.02.018__Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018.
LibreCat: /record/16299
DOI: 10.1016/j.tcs.2020.02.018

Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.
LibreCat: /record/13868

Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.”10.1007/s12599-019-00627-x__Business &; Information Systems Engineering, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.
LibreCat: /record/13770
DOI: 10.1007/s12599-019-00627-x

Baswana, Surender, et al. “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.”10.4230/LIPICS.MFCS.2019.65__44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16, doi:10.4230/LIPICS.MFCS.2019.65.
LibreCat: /record/17432
DOI: 10.4230/LIPICS.MFCS.2019.65

Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.”10.1109/CSCloud/EdgeCom.2019.000-9__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–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.
LibreCat: /record/17667
DOI: 10.1109/CSCloud/EdgeCom.2019.000-9

Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. 2019, doi:10.17619/UNIPB/1-766.
LibreCat: /record/18975
DOI: 10.17619/UNIPB/1-766

Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. 2019, doi:10.17619/UNIPB/1-588.
LibreCat: /record/8080
DOI: 10.17619/UNIPB/1-588

Jansen, Klaus, et al. “Scheduling on (Un-)Related Machines with Setup Times.” Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2019, pp. 145–54.
LibreCat: /record/8866

Lazos, Philip, et al. “Multi-Unit Bilateral Trade.”10.1609/aaai.v33i01.33011973__Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019, doi:10.1609/aaai.v33i01.33011973.
LibreCat: /record/5471
DOI: 10.1609/aaai.v33i01.33011973

Feldkord, Björn, et al. “Managing Multiple Mobile Resources.”10.1007/978-3-030-39479-0_9__Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi: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, Alexander. On Scheduling with Setup Times. 2019, doi:10.17619/UNIPB/1-828.
LibreCat: /record/14851
DOI: 10.17619/UNIPB/1-828

Brandt, Sascha, et al. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019.
LibreCat: /record/16341
arXiv: 1904.08225

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”10.1145/3364204__ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 14, 2019, doi:10.1145/3364204.
LibreCat: /record/13873
DOI: 10.1145/3364204

Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln.”10.1007/s00591-019-00249-0__Mathematische Semesterberichte, vol. 66, no. 2, 2019, pp. 259–60, doi:10.1007/s00591-019-00249-0.
LibreCat: /record/13937
DOI: 10.1007/s00591-019-00249-0

Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.”10.1007/978-3-030-11072-7‑13__Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–34, doi:10.1007/978-3-030-11072-7‑13.
LibreCat: /record/13939
DOI: 10.1007/978-3-030-11072-7‑13

Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.”10.5220/0007369503150321__Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–21, doi:10.5220/0007369503150321.
LibreCat: /record/13942
DOI: 10.5220/0007369503150321

Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.”10.1016/j.tcs.2018.11.006__Theoretical Computer Science, vol. 786, 2019, pp. 2–12, doi:10.1016/j.tcs.2018.11.006.
LibreCat: /record/13946
DOI: 10.1016/j.tcs.2018.11.006

Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.”10.1007/978-3-030-24922-9‑26__Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9‑26.
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

Feldotto, Matthias, et al. “From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” 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

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

Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”10.4230/LIPIcs.ICALP.2018.51__45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
LibreCat: /record/2484
DOI: 10.4230/LIPIcs.ICALP.2018.51
arXiv: 1711.01231

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.”10.1145/3210377.3210389__Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.
LibreCat: /record/2485
DOI: 10.1145/3210377.3210389

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

Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994, 2018.
LibreCat: /record/19978

Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.”10.1145/3230654.3230659__Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.
LibreCat: /record/2831
DOI: 10.1145/3230654.3230659

Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .”10.1007/s00453-018-0420-y__Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.
LibreCat: /record/2848
DOI: 10.1007/s00453-018-0420-y

Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.”10.1007/s00224-017-9836-z__Theory of Computing Systems, Springer, 2018, doi:10.1007/s00224-017-9836-z.
LibreCat: /record/2849
DOI: 10.1007/s00224-017-9836-z

Hamann, Heiko, et al. “Pick, Pack, &; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.”10.4230/LIPIcs.FUN.2018.22__Ninth International Conference on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.
LibreCat: /record/2850
DOI: 10.4230/LIPIcs.FUN.2018.22

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

König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”10.1007/s10878-018-0325-3__Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79, doi:10.1007/s10878-018-0325-3.
LibreCat: /record/3551
DOI: 10.1007/s10878-018-0325-3

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

Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial Optimization and Applications, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.
LibreCat: /record/17651

Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.”https://doi.org/10.1016/j.future.2018.08.011__Future Generation Computer Systems, 2018, doi: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, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.”10.1007/s10951-017-0518-0__Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.
LibreCat: /record/63
DOI: 10.1007/s10951-017-0518-0

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”10.1007/978-3-030-03232-6_1__Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.
LibreCat: /record/4563

Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.”10.1145/3210377.3210663__Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.
LibreCat: /record/4565
DOI: 10.1145/3210377.3210663

Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.”10.1145/3210377.3210662__Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, doi:10.1145/3210377.3210662.
LibreCat: /record/7570
DOI: 10.1145/3210377.3210662

Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.”10.1007/978-3-030-19759-9_4__Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

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

Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.
LibreCat: /record/5404

Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.”10.1007/s10878-017-0189-y__Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:10.1007/s10878-017-0189-y.
LibreCat: /record/669
DOI: 10.1007/s10878-017-0189-y
arXiv: 1607.05143

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

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

Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018.
LibreCat: /record/1188

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

Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.”10.1007/978-3-319-98355-4_18__Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.
LibreCat: /record/16392
DOI: 10.1007/978-3-319-98355-4_18

Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”10.1007/s10878-018-0269-7__Journal of Combinatorial Optimization, Springer Nature, 2018, doi:10.1007/s10878-018-0269-7.
LibreCat: /record/1369
DOI: 10.1007/s10878-018-0269-7

Li, Shouwei. Parallel Fixed Parameter Tractable Problems. 2017, doi:10.17619/UNIPB/1-252.
LibreCat: /record/19604
DOI: 10.17619/UNIPB/1-252

Markarian, Christine. “Leasing with Uncertainty.”10.1007/978-3-319-89920-6_57__International Conference on Operations Research (OR), 2017, doi:10.1007/978-3-319-89920-6_57.
LibreCat: /record/2851
DOI: 10.1007/978-3-319-89920-6_57

Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.”10.1007/978-3-319-59930-4_12__International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), 2017, doi:10.1007/978-3-319-59930-4_12.
LibreCat: /record/24398
DOI: 10.1007/978-3-319-59930-4_12

Feldotto, Matthias, et al. “Congestion Games with Complementarities.”10.1007/978-3-319-57586-5_19__Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19.
LibreCat: /record/112
DOI: 10.1007/978-3-319-57586-5_19
arXiv: 1701.07304

Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.”10.1007/978-3-319-71924-5_14__Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14.
LibreCat: /record/113
DOI: 10.1007/978-3-319-71924-5_14
arXiv: 1710.01634

Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.”10.1007/978-3-319-71150-8_1__Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-71150-8_1.
LibreCat: /record/17652
DOI: 10.1007/978-3-319-71150-8_1

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

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

Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
LibreCat: /record/17811

Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.”10.1007/978-3-319-89441-6__Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6.
LibreCat: /record/79
DOI: 10.1007/978-3-319-89441-6

Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.”10.1007/978-3-319-59605-1_13__Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–50, doi:10.1007/978-3-319-59605-1_13.
LibreCat: /record/82
DOI: 10.1007/978-3-319-59605-1_13

Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.”10.1145/3087556.3087578__Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578.
LibreCat: /record/59
DOI: 10.1145/3087556.3087578

Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.”10.1007/978-3-319-71147-8_2__Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2.
LibreCat: /record/70
DOI: 10.1007/978-3-319-71147-8_2

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

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

Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”10.1007/s10878-017-0198-x__Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:10.1007/s10878-017-0198-x.
LibreCat: /record/706
DOI: 10.1007/s10878-017-0198-x

van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.”10.1109/REW.2017.26__2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, 2017, pp. 379–85, doi:10.1109/REW.2017.26.
LibreCat: /record/97
DOI: 10.1109/REW.2017.26

Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”10.1145/3087556.3087575__Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.
LibreCat: /record/55
DOI: 10.1145/3087556.3087575

Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”10.1007/978-3-319-62389-4_15__Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.
LibreCat: /record/66
DOI: 10.1007/978-3-319-62389-4_15

Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017.
LibreCat: /record/695

Gausemeier, Jürgen, et al. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). 2017.
LibreCat: /record/16444

Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.”10.1007/978-3-319-72050-0_13__Structural Information and Communication Complexity, 2017, doi: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, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017.
LibreCat: /record/1073

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

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

Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.
LibreCat: /record/1081