@inproceedings{59,
  abstract     = {{We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed).}},
  author       = {{Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander}},
  booktitle    = {{Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
  pages        = {{123----132}},
  title        = {{{Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}}},
  doi          = {{10.1145/3087556.3087578}},
  year         = {{2017}},
}

@misc{5946,
  author       = {{Kühn, Sarah}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Outsourcing und Qualität im Supply Chain - Eine Gleichgewichtsanalyse}}},
  year         = {{2017}},
}

@misc{5950,
  author       = {{Gunning, Justine}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Crowdfunding Plattformen als Vermittler auf zweiseitigen Märkten - Eine mikroökonomische Analyse}}},
  year         = {{2017}},
}

@proceedings{5980,
  editor       = {{Scheideler, Christian and Taghi Hajiaghayi, Mohammad}},
  isbn         = {{978-1-4503-4593-4}},
  publisher    = {{ACM}},
  title        = {{{Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017}}},
  doi          = {{10.1145/3087556}},
  year         = {{2017}},
}

@misc{60,
  author       = {{Niehus, David}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Semantically Secure Attribute-based Searchable Encryption}}},
  year         = {{2017}},
}

@phdthesis{61,
  author       = {{Strothmann, Thim Frederik}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Self-* Algorithms for Distributed Systems}}},
  doi          = {{10.17619/UNIPB/1-150}},
  year         = {{2017}},
}

@misc{62,
  author       = {{Weis, Eduard}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Searchable Encryption}}},
  year         = {{2017}},
}

@article{64,
  abstract     = {{A current trend in networking and cloud computing is to provide compute resources at widely distributed sites; this is exemplified by developments such as Network Function Virtualisation. This paves the way for wide-area service deployments with improved service quality: e.g. user-perceived response times can be reduced by offering services at nearby sites. But always assigning users to the nearest site can be a bad decision if this site is already highly utilised. This paper formalises two related decisions of allocating compute resources at different sites and assigning users to them with the goal of minimising the response times while the total number of resources to be allocated is limited – a non-linear capacitated Facility Location Problem with integrated queuing systems. To efficiently handle its non-linearity, we introduce five linear problem linearisations and adapt the currently best heuristic for a similar scenario to our scenario. All six approaches are compared in experiments for solution quality and solving time. Surprisingly, our best optimisation formulation outperforms the heuristic in both time and quality. Additionally, we evaluate the influence of distributions of available compute resources in the network on the response time: The time was halved for some configurations. The presented formulation techniques for our problem linearisations are applicable to a broader optimisation domain.}},
  author       = {{Keller, Matthias and Karl, Holger}},
  journal      = {{IEEE Transactions on Network and Service Management}},
  number       = {{1}},
  pages        = {{121----135}},
  publisher    = {{IEEE}},
  title        = {{{Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions}}},
  doi          = {{10.1109/TNSM.2016.2611590}},
  year         = {{2017}},
}

@inproceedings{45,
  abstract     = {{The importance of online ratings on sales is widely acknowledged. Firms need to find ways of increasing the number of ratings and rating scores, but how they can achieve this effectively is less well established. In this paper we analyze the impact of an unconditional gift on customers’ rating behavior in an online field experiment. Contrary to prevalent advice, our results suggest that providing a gift is not necessarily beneficial. Younger customers are significantly less likely to rate when exposed to an unconditional gift. Regression analysis reveals that age serves as a moderator and older customers even respond slightly positive to a gift. Having detected a negative effect of gifts on rating behavior provides first indicative evidence of a possible crowding out of intrinsic motivation in the context of online ratings. This has direct implications for practitioners considering the usage of gifts to elicit online ratings.}},
  author       = {{Gutt, Dominik and Schlangenotto, Darius and Kundisch, Dennis}},
  booktitle    = {{Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland}},
  title        = {{{You can’t buy my rating! On the pivotal effect of an unconditional gift on rating behavior}}},
  year         = {{2017}},
}

@misc{46,
  author       = {{Grobbel, Florian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen Softwareanforderungsbeschreibungen}}},
  year         = {{2017}},
}

@phdthesis{4674,
  author       = {{Rose, Anica}},
  publisher    = {{Universität Paderborn}},
  title        = {{{The Performance of Individuals, Teams, and Organizations: Empirical Evidence from the Field}}},
  year         = {{2017}},
}

@misc{47,
  author       = {{Theda, Mona}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Was ist gemeint? Strukturell ambige Sätze als Herausforderung für Parsing-Ansätze}}},
  year         = {{2017}},
}

@inbook{48,
  author       = {{Kundisch, Dennis and Gutt, Dominik}},
  booktitle    = {{Digitale Ökonomie - Wie verändern sich die Märkte?}},
  editor       = {{Hannappel, Sandra and Rehm, Rebekka}},
  title        = {{{Was bedeutet die Transformation der Märkte im digitalen Zeitalter? Ökonomische Grundlagen}}},
  year         = {{2017}},
}

@inproceedings{49,
  abstract     = {{A multiplicity of visual languages have been proposed for representing business models. These languages are claimed to facilitate tasks such as understanding, communicating, and innovating a business model; and have been developed rather independently by scholars from accounting, computer science, information systems, and strategy. Consequently, the existing approaches greatly differ and to some extent contradict each other, for example, regarding their understanding of the business model concept, their terminology, and their visual notations – which means there is little common ground for developing a cumulative stream of research. Therefore, we provide a systematic, cross-disciplinary review of this emerging field and synthesize the pragmatic, semantic, and syntactic foundations of the proposed approaches. Further, we derive an agenda for future research and discuss the challenges that lie ahead to advance the field.}},
  author       = {{John, Thomas and Kundisch, Dennis and Szopinski, Daniel}},
  booktitle    = {{Proceedings of the 38th International Conference on Information Systems (ICIS), Seoul, South Korea}},
  title        = {{{Visual Languages for Modeling Business Models: A Critical Review and Future Research Directions}}},
  year         = {{2017}},
}

@misc{698,
  author       = {{Banh, Ngoc Chi}},
  publisher    = {{Universität Paderborn}},
  title        = {{{As Asynchronous Adaption of a Churn-resistant Overlay Network}}},
  year         = {{2017}},
}

@misc{699,
  author       = {{Sundermeier, Jannik}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions}}},
  year         = {{2017}},
}

@inproceedings{70,
  author       = {{Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}},
  pages        = {{17 -- 31}},
  title        = {{{Price Fluctuations in Online Leasing}}},
  doi          = {{10.1007/978-3-319-71147-8_2}},
  year         = {{2017}},
}

@misc{700,
  author       = {{Knollmann, Till}},
  publisher    = {{Universität Paderborn}},
  title        = {{{A Self-Stabilizing Protocol for Graphs of Diameter Two}}},
  year         = {{2017}},
}

@misc{701,
  author       = {{Götte, Thorsten}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Self-Stabilizing Spanners for Tree Metrics}}},
  year         = {{2017}},
}

@phdthesis{704,
  author       = {{Riechers, Sören}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Scheduling with Scarce Resources}}},
  doi          = {{10.17619/UNIPB/1-231}},
  year         = {{2017}},
}