@phdthesis{14851, author = {{Mäcker, Alexander}}, title = {{{On Scheduling with Setup Times}}}, doi = {{10.17619/UNIPB/1-828}}, year = {{2019}}, } @article{14896, author = {{Dann, Andreas and Hermann, Ben and Bodden, Eric}}, issn = {{0098-5589}}, journal = {{IEEE Transactions on Software Engineering}}, pages = {{1--1}}, title = {{{ModGuard: Identifying Integrity &Confidentiality Violations in Java Modules}}}, doi = {{10.1109/tse.2019.2931331}}, year = {{2019}}, } @inproceedings{15007, author = {{Melnikov, Vitaly and Hüllermeier, Eyke}}, booktitle = {{Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)}}, title = {{{Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA}}}, doi = {{10.1016/j.jmva.2019.02.017}}, year = {{2019}}, } @inproceedings{15011, author = {{Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}}, booktitle = {{Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019}}, editor = {{Hoffmann, Frank and Hüllermeier, Eyke and Mikut, Ralf}}, isbn = {{978-3-7315-0979-0}}, location = {{Dortmund}}, pages = {{135--146}}, publisher = {{KIT Scientific Publishing, Karlsruhe}}, title = {{{Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking}}}, year = {{2019}}, } @techreport{15202, abstract = {{In this paper, we analyze the two-dimensional Nash bargaining solution (NBS) deploying a standard labor market negotiations model (see McDonald and Solow, 1981; Creedy and McDonald, 1991). We show that the two-dimensional bargaining problem can be decomposed into two one-dimensional problems such that the (Cartesian) product of the solutions of these problems replicates the solution of the two-dimensional problem, if the NBS is applied. However, this decomposition fails for any solution concept that does not satisfy the axiom of Independence of Irrelevant Alternatives (IIA axiom). Our decomposition result has significant implications for actual negotiations, as it allows for the decomposition of a multi-issue bargaining problem into a set of simpler problems, in particular a set of single-issue bargaining problems. In this way, the decomposition may help facilitate negotiations in labor markets and also in other environments.}}, author = {{Haake, Claus-Jochen and Upmann, Thorsten and Duman, Papatya}}, keywords = {{Labor market negotiations, Efficient bargains, Nash bargaining solution, Sequential bargaining, Restricted bargaining games}}, publisher = {{CIE Working Paper Series, Paderborn University}}, title = {{{The Decomposability of the Nash Bargaining Solution in Labor Markets}}}, volume = {{128}}, year = {{2019}}, } @techreport{15204, abstract = {{We criticize some conceptual weaknesses in the recent literature on coalitional TUgames and propose, based on our critics, a new definition of dual TU-games that coincides with the one in the literature on the class of super-additive games. We justify our new definition in four alternative ways: 1. Via an adequate definition of ecient payo vectors. 2. Via a modification of the Bondareva-Shapley duality. 3. Via an explicit consideration of \coalition building". 4. Via associating general TU-games to coalition-production economies. Rather than imputations, we base our analysis on a modification of aspirations.}}, author = {{Aslan, Fatma and Duman, Papatya and Trockel, Walter}}, keywords = {{TU-games, duality, core, c-Core, cohesive games, complete game efficiency}}, publisher = {{CIE Working Paper Series, Paderborn University}}, title = {{{Duality for General TU-games Redefined}}}, volume = {{121}}, year = {{2019}}, } @article{13873, author = {{Feldkord, Björn and Meyer auf der Heide, Friedhelm}}, journal = {{ACM Transactions on Parallel Computing (TOPC)}}, number = {{3}}, title = {{{The Mobile Server Problem}}}, doi = {{10.1145/3364204}}, volume = {{6}}, year = {{2019}}, } @inproceedings{13942, author = {{Markarian, Christine and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 8th International Conference on Operations Research and Enterprise Systems}}, pages = {{315--321}}, publisher = {{SciTePress}}, title = {{{Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location}}}, doi = {{10.5220/0007369503150321}}, year = {{2019}}, } @article{13946, author = {{Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}}, journal = {{Theoretical Computer Science}}, pages = {{2--12}}, title = {{{Efficient parallel algorithms for parameterized problems}}}, doi = {{10.1016/j.tcs.2018.11.006}}, volume = {{786}}, year = {{2019}}, } @inproceedings{14017, author = {{Szopinski, Daniel and John, Thomas and Kundisch, Dennis}}, booktitle = {{TREO Talks in conjunction with the 40th International Conference on Information Systems (ICIS)}}, location = {{Munich, Germany}}, title = {{{Teaching business model innovation to large and interdisciplinary IS/IT classes: A didactic approach involving peer feedback via self-recorded video presentations}}}, year = {{2019}}, } @inproceedings{14019, author = {{Szopinski, Daniel}}, location = {{Renningen, Germany}}, title = {{{Activate software-based business model development tools: An exploratory study}}}, year = {{2019}}, } @inproceedings{14539, author = {{Castenow, Jannik and Kolb, Christina and Scheideler, Christian}}, booktitle = {{Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}}, location = {{L'Aquila, Italy}}, pages = {{345--348}}, title = {{{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}}}, doi = {{10.1007/978-3-030-24922-9\_26}}, year = {{2019}}, } @inproceedings{14543, author = {{Szopinski, Daniel and John, Thomas and Kundisch, Dennis}}, location = {{Munich, Germany}}, title = {{{Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback}}}, year = {{2019}}, } @misc{14546, author = {{Hansmeier, Tim}}, publisher = {{Universität Paderborn}}, title = {{{Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers}}}, year = {{2019}}, } @phdthesis{13124, author = {{Dräxler, Sevil}}, publisher = {{Universität Paderborn}}, title = {{{Scaling, placement, and routing for pliable virtualized composed services}}}, year = {{2019}}, } @phdthesis{13125, author = {{Görzen, Thomas}}, publisher = {{Universität Paderborn}}, title = {{{Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd}}}, year = {{2019}}, } @phdthesis{13126, author = {{Khaluf, Lial}}, publisher = {{Universität Paderborn}}, title = {{{Organic Programming of Dynamic Real-Time Applications}}}, year = {{2019}}, } @misc{13128, author = {{Bröcher, Henrik}}, publisher = {{Universität Paderborn}}, title = {{{Rational Secure Multiparty Computation}}}, year = {{2019}}, } @inproceedings{13132, author = {{Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier, Eyke}}, booktitle = {{INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft}}, location = {{Kassel}}, pages = {{ 273--274 }}, publisher = {{Gesellschaft für Informatik e.V.}}, title = {{{From Automated to On-The-Fly Machine Learning}}}, year = {{2019}}, } @inproceedings{13138, abstract = {{Mobile app stores like Apple's AppStore or Google's PlayStore are highly competitive markets for third-party developers wanting to develop successful applications. During the development process, many developers focus on the multitude of product functions but neglect the business model as an equally important part. As a result, developers often fail to meet customer needs, leading to unnecessary development costs and poor market penetration. This, in turn, raises the question of how we intertwine the business model and product functions during the development process to ensure a better alignment between the two. In this paper, we show this intertwined development by adapting the concept of Twin Peaks to the business model and product functions. Based on feature modeling as an abstraction layer, we introduce the concept of a Business Model Decision Line (BMDL) to structure the business model decisions and their relation to product functions structured in a Software Product Line (SPL). The basis of our feature models is the analysis of top listed applications in the app stores of Apple and Google. To create and modify both models, we provide an incremental feature structuring and iterative feature selection process. This combination of abstraction layer and development process supports third-party developers to build successful applications both from a business and a product perspective. }}, author = {{Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}}, booktitle = {{Software Business}}, editor = {{Hyrynsalmi, Sami and Suoranta, Mari and Nguyen-Duc, Anh and Tyrväinen, Pasi and Abrahamsson, Pekka}}, keywords = {{Intertwined Development, Twin Peaks, Feature Model, Business Model, Product Functions}}, location = {{ Jyväskylä}}, number = {{1}}, pages = {{192--207}}, publisher = {{Springer International Publishing}}, title = {{{Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach}}}, doi = {{10.1007/978-3-030-33742-1_16}}, volume = {{370}}, year = {{2019}}, }