@inproceedings{319,
  abstract     = {{Services are self-contained and platform independent software components that aim at maximizing software reuse. The automated composition of services to a target software artifact has been tackled with many AI techniques, but existing approaches make unreasonably strong assumptions such as a predefined data flow, are limited to tiny problem sizes, ignore non-functional properties, or assume offline service repositories. This paper presents an algorithm that automatically composes services without making such assumptions. We employ a backward search algorithm that starts from an empty composition and prepends service calls to already discovered candidates until a solution is found. Available services are determined during the search process. We implemented our algorithm, performed an experimental evaluation, and compared it to other approaches.}},
  author       = {{Mohr, Felix and Jungmann, Alexander and Kleine Büning, Hans}},
  booktitle    = {{Proceedings of the 12th IEEE International Conference on Services Computing (SCC)}},
  pages        = {{57----64}},
  title        = {{{Automated Online Service Composition}}},
  doi          = {{10.1109/SCC.2015.18}},
  year         = {{2015}},
}

@phdthesis{270,
  author       = {{Abshoff, Sebastian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}}},
  year         = {{2015}},
}

@inproceedings{271,
  abstract     = {{In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do not have pure Nash equilibria, we consider approximate pure Nash equilibria, in which no player can improve her utility by more than some fixed factor $\alpha$ through unilateral strategy changes. There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits the demand of each player on a specific resource) such that $\alpha$-approximate pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for $\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold $\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard. We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$. For a restricted version of the game, where demands of players only differ slightly from each other (e.g. symmetric games), we show that approximate Nash equilibria can be reached (and thus also be computed) in polynomial time using the best-response dynamic. Finally, we show that a broader class of utility-maximization games (which includes BAGs) converges quickly towards states whose social welfare is close to the optimum.}},
  author       = {{Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}},
  booktitle    = {{Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)}},
  pages        = {{178--189}},
  title        = {{{On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games}}},
  doi          = {{10.1007/978-3-662-48433-3_14}},
  year         = {{2015}},
}

@inproceedings{272,
  abstract     = {{Automated service composition aims at automatically generating software solutions based on services to provide more complex functionality. In this paper, we give an initial overview about why adaptivity becomes increasingly important when aiming for automated composition of service functionality in dynamic and freely accessible environments such as service markets. We systematically derive dependencies among crucial processes such as service composition and service execution in a holistic view. Furthermore, we briefly discuss the influences and effects of changes in the environment according to the derived dependencies, and derive possible future research directions. }},
  author       = {{Jungmann, Alexander}},
  booktitle    = {{Proceedings of the IEEE 11th World Congress on Services (SERVICES)}},
  pages        = {{329----332}},
  title        = {{{On Adaptivity for Automated Composition of Service Functionality}}},
  doi          = {{10.1109/SERVICES.2015.57}},
  year         = {{2015}},
}

@misc{273,
  author       = {{Kohn, Kathlén}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms}}},
  year         = {{2015}},
}

@inproceedings{274,
  abstract     = {{Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.}},
  author       = {{Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}},
  booktitle    = {{Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}},
  editor       = {{Dehne, Frank and Sack, Jörg Rüdiger and Stege, Ulrike}},
  pages        = {{542----553}},
  title        = {{{Non-preemptive Scheduling on Machines with Setup Times}}},
  doi          = {{10.1007/978-3-319-21840-3_45}},
  year         = {{2015}},
}

@inproceedings{275,
  abstract     = {{We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bilò et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the Price of Anarchy.}},
  author       = {{Cord-Landwehr, Andreas and Lenzner, Pascal}},
  booktitle    = {{Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)}},
  pages        = {{248----260}},
  title        = {{{Network Creation Games: Think Global - Act Local}}},
  doi          = {{10.1007/978-3-662-48054-0_21}},
  year         = {{2015}},
}

@misc{276,
  author       = {{Hohenberger, Till}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Network Creation Games with Interest Groups}}},
  year         = {{2015}},
}

@misc{277,
  author       = {{Kothe, Nils}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk}}},
  year         = {{2015}},
}

@misc{278,
  author       = {{Feldmann, Michael}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs}}},
  year         = {{2015}},
}

@inproceedings{279,
  abstract     = {{Service discovery in global software markets is performed by brokers who act as intermediaries between service consumers and service providers.In order to discover services, brokers apply service matching for determining whether the specification of a provided service satisfies the consumer's requirements.Brokers can already choose between a lot of different service matching approaches considering different service properties (structural, behavioral, and non-functional properties).Different matching approaches can be combined into configurable matching processes leading to a high matching quality (e.g., accurate matching results). However, this combination and configuration is a manual procedure and has to be repeated for different consumers' or market requirements regarding matching quality. In this paper, we propose our framework MatchBox, which supports a broker in reusing existing matching approaches and combining them in a model-driven way based on a reconfigurable model of the matching process.Using this reconfigurable model, MatchBox takes care of control and data flow between matching approaches and executes the modeled processes automatically.As a case study, we integrated eleven matchers into MatchBox to demonstrate that it remains flexibility and reduces effort for a broker at the same time.}},
  author       = {{Platenius, Marie Christin and Arifulina, Svetlana and Schäfer, Wilhelm}},
  booktitle    = {{Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE'15)}},
  pages        = {{75--84}},
  title        = {{{MatchBox: A Framework for Dynamic Configuration of Service Matching Processes}}},
  doi          = {{10.1145/2737166.2737174}},
  year         = {{2015}},
}

@article{1772,
  author       = {{Torresen, Jim and Plessl, Christian and Yao, Xin}},
  journal      = {{IEEE Computer}},
  keywords     = {{self-awareness, self-expression}},
  number       = {{7}},
  pages        = {{18--20}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Self-Aware and Self-Expressive Systems – Guest Editor's Introduction}}},
  doi          = {{10.1109/MC.2015.205}},
  volume       = {{48}},
  year         = {{2015}},
}

@misc{234,
  author       = {{Menne, Maria Reinhild}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine wettbewerbspolitische Analyse am Fallbeispiel der Adidas AG}}},
  year         = {{2015}},
}

@misc{235,
  author       = {{Strotmeyer, Sebastian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung}}},
  year         = {{2015}},
}

@misc{236,
  author       = {{Neumann, Daniel}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen im Automotive Bereich}}},
  year         = {{2015}},
}

@misc{237,
  author       = {{Ochlast, Kerstin}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Trust Me, I am Certified - Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen}}},
  year         = {{2015}},
}

@inproceedings{239,
  abstract     = {{We report on the construction of the Wikidata Vandalism Corpus WDVC-2015, the first corpus for vandalism in knowledge bases. Our corpus is based on the entire revision history of Wikidata, the knowledge base underlying Wikipedia. Among Wikidata's 24 million manual revisions, we have identified more than 100,000 cases of vandalism. An in-depth corpus analysis lays the groundwork for research and development on automatic vandalism detection in public knowledge bases. Our analysis shows that 58% of the vandalism revisions can be found in the textual portions of Wikidata, and the remainder in structural content, e.g., subject-predicate-object triples. Moreover, we find that some vandals also target Wikidata content whose manipulation may impact content displayed on Wikipedia, revealing potential vulnerabilities. Given today's importance of knowledge bases for information systems, this shows that public knowledge bases must be used with caution.}},
  author       = {{Heindorf, Stefan and Potthast, Martin and Stein, Benno and Engels, Gregor}},
  booktitle    = {{Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15)}},
  pages        = {{831----834}},
  title        = {{{Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis}}},
  doi          = {{10.1145/2766462.2767804}},
  year         = {{2015}},
}

@inproceedings{240,
  abstract     = {{We consider online leasing problems in which demands arrive over time and need to be served by leasing resources. We introduce a new model for these problems such that a resource can be leased for K different durations each incurring a different cost (longer leases cost less per time unit). Each demand i can be served anytime between its arrival ai and its deadline ai+di by a leased resource. The objective is to meet all deadlines while minimizing the total leasing costs. This model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005) in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive where dmax and lmin denote the largest di and the shortest available lease length, respectively. We also extend the SetCoverLeasing problem by deadlines and give a competitive online algorithm which also improves on existing solutions for the original SetCoverLeasing problem.}},
  author       = {{Li, Shouwei and Mäcker, Alexander and Markarian, Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}},
  booktitle    = {{Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)}},
  pages        = {{277----288}},
  title        = {{{Towards Flexible Demands in Online Leasing Problems}}},
  doi          = {{10.1007/978-3-319-21398-9_22}},
  year         = {{2015}},
}

@misc{18003,
  author       = {{Götte, Thorsten}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot}}},
  year         = {{2015}},
}

@misc{18005,
  author       = {{Korfmacher, Christian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Implementierung und Analyse von Cone-DHT}}},
  year         = {{2015}},
}