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

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

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

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

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

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

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

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

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

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

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

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

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

Kutzias, D. (2016). Friendship Processes in Network Creation Games. Universität Paderborn.
LibreCat: /record/688

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

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

Markarian, C. (2015). Online Resource Leasing. Universität Paderborn.
LibreCat: /record/267

Jähn, C. (2015). Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn.
LibreCat: /record/317

Abshoff, S. (2015). On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn.
LibreCat: /record/270

Petring, R. (2014). Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit. Universität Paderborn.
LibreCat: /record/19039

Kling, P. (2014). Energy-efficient Scheduling Algorithms. Universität Paderborn.
LibreCat: /record/431

Eikel, B. (2013). Spherical visibility samplingf: preprocessed visibility for occlusion culling in complex 3D scenes. Universität Paderborn.
LibreCat: /record/17440

Pietrzyk, P. (2013). Local and Online Algorithms for Facility Location. Universität Paderborn.
LibreCat: /record/514

Kempkes, B. (2012). Local strategies for robot formation problems (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/601

Korzeniowski, M. (2011). Dynamic Load Balancing in Peer-to-Peer Networks (Vol. 289). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19619

Mehler, J. (2011). Power-Aware Online File Allocation in Dynamic Networks (Vol. 287). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18974

Effert, S. (2011). Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn.
LibreCat: /record/19040

Swierkot, K. (2011). Complexity Classes for Local Computation. Universität Paderborn.
LibreCat: /record/663

Bienkowski, M. (2010). Page migration in dynamic networks (Vol. 282). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18910

Dynia, M. (2010). Collective graph exploration (Vol. 284). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18927

Mahlmann, P. (2010). Peer-to-peer networks based on random graphs (Vol. 283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19041

Degener, B. (2010). Local, distributed approximation algorithms for geometric assignment problems (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19042

Lürwer-Brüggemeier, K. (2009). Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division (Vol. 261). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19605

Mense, M. (2009). On Fault-Tolerant Data Placement in Storage Networks (Vol. 260). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19614

Kortenjan, M. (2009). Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes (Vol. 258). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19617

Bonorden, O. (2009). Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip (Vol. 257). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19618

Schomaker, G. (2008). Distributed Resource Allocation and Management in Heterogeneous Networks (Vol. 259). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19615

Klein, J. (2006). Efficient Collision Detection for Point and Polygon Based Models (Vol. 186). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19612

Rührup, S. (2006). Position-based Routing Strategies (Vol. 203). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19613

Damerow, V. (2006). Average and Smoothed Complexity of Geometric Structures (Vol. 190). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18972

Volbert, K. (2005). Geometric Spanners for Topology Control in Wireless Networks (Vol. 168). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19611

Fischer, M. (2005). Design, analysis, and evaluation of a data structure for distributed virtual environments (Vol. 164). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/17413

Räcke, H. (2005). Data Management and Routing in General Networks (Vol. 154). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18967

Salzwedel, K. (2004). Data Distribution Algorithms for Storage Networks (Vol. 153). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19616

Sohler, C. (2003). Property Testing and Geometry (Vol. 119). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18573

Ziegler, M. (2002). Zur Berechenbarkeit reeller geometrischer Probleme (Vol. 115). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18169

Schröder, K. (2001). Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing (Vol. 89). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19622