@techreport{20871,
  abstract     = {{How is merger and acquisition (M&A) success associated with firm internal M&A process organization? The literature thus far acknowledges that unobservable internal firm characteristics are at least as important as observable firm- and deal-specific characteristics in regard to explaining M&A success. Thus, this paper directly asks M&A experts around the globe to shed more light on this important issue. We investigate three indices, capturing the degree of M&A 1) process standardization, 2) process duration, and 3) process attention. Next, we analyze the process participation among four organizational layers, i.e., the functional involvement of the a) top management team, b) headquarters, c) business unit management, and d) business unit functions. We predict and find that all three indices are positively associated with M&A success, while process standardization and attention to deal strategy are of particular importance. Turning to the four organizational layers, a textured analysis shows that, for instance, target valuation should be performed by the headquarters functions but not by the top management team or the business unit. Overall, our findings are important to better understand unexplored M&A success drivers and provide directions for future research. Finally, our results might help practitioners adjust their M&A process organization to further improve their M&A success.}},
  author       = {{Sievers, Sönke and Alexander, Schmitz}},
  keywords     = {{Mergers, Acquisitions, Success, Processes, Organization}},
  pages        = {{73}},
  title        = {{{What matters for organizing M&As successfully?}}},
  doi          = {{10.2139/ssrn.3679155}},
  year         = {{2020}},
}

@techreport{20873,
  author       = {{Sievers, Sönke and Keienburg, Georg and Degen, Dominik and Söllner, Tobias and Kashyrkin, Anton}},
  publisher    = {{The Boston Consulting Group, Inc., M&A Report}},
  title        = {{{Alternative Deals Gain Traction}}},
  year         = {{2020}},
}

@article{20874,
  author       = {{Sievers, Sönke and Degen, Dominik and Kim, Daniel and Kengelbach, Jens}},
  journal      = {{M&A Review}},
  pages        = {{266--271}},
  title        = {{{Downturn M&A: Die Erfolgsstrategie der Stunde?}}},
  year         = {{2020}},
}

@article{20882,
  author       = {{Hoffmann, Christin and Thommes, Kirsten}},
  issn         = {{0167-2681}},
  journal      = {{Journal of Economic Behavior & Organization}},
  pages        = {{49--65}},
  title        = {{{Can digital feedback increase employee performance and energy efficiency in firms? Evidence from a field experiment}}},
  doi          = {{10.1016/j.jebo.2020.09.034}},
  year         = {{2020}},
}

@article{20883,
  abstract     = {{<jats:p>We experimentally compare the consequences for group cooperation of two decision mechanisms involving the extension of group membership. We analyze an exogenous decision (random draw) and an endogenous decision (made by a particular group member) mechanism to extend a temporary agent’s group membership. Our results reveal that the prospect of group membership extension affects not only the temporary but also the permanent group members’ contributions with an endogenous mechanism.</jats:p>}},
  author       = {{Grund, Christian and Harbring, Christine and Thommes, Kirsten and Tilkes, Katja Rebecca}},
  issn         = {{2073-4336}},
  journal      = {{Games}},
  title        = {{{Decisions on Extending Group Membership—Evidence from a Public Good Experiment}}},
  doi          = {{10.3390/g11040061}},
  year         = {{2020}},
}

@article{20888,
  author       = {{Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}},
  issn         = {{1549-6325}},
  journal      = {{ACM Transactions on Algorithms}},
  number       = {{4}},
  pages        = {{1--25}},
  title        = {{{A Complexity Theoretical Study of Fuzzy K-Means}}},
  doi          = {{10.1145/3409385}},
  volume       = {{16}},
  year         = {{2020}},
}

@inbook{20891,
  abstract     = {{Today, software systems are rarely developed monolithically, but may be composed of numerous individually developed features. Their modularization facilitates independent development and verification. While feature-based strategies to verify features in isolation have existed for years, they cannot address interactions between features. The problem with feature interactions is that they are typically unknown and may involve any subset of the features. Contrary, a family-based verification strategy captures feature interactions, but does not scale well when features evolve frequently. To the best of our knowledge, there currently exists no approach with focus on evolving features that combines both strategies and aims at eliminating their respective drawbacks. To fill this gap, we introduce Fefalution, a feature-family-based verification approach based on abstract contracts to verify evolving features and their interactions. Fefalution builds partial proofs for each evolving feature and then reuses the resulting partial proofs in verifying feature interactions, yielding a full verification of the complete software system. Moreover, to investigate whether a combination of both strategies is fruitful, we present the first empirical study for the verification of evolving features implemented by means of feature-oriented programming and by comparing Fefalution with another five family-based approaches varying in a set of optimizations. Our results indicate that partial proofs based on abstract contracts exhibit huge reuse potential, but also come with a substantial overhead for smaller evolution scenarios.
}},
  author       = {{Knüppel, Alexander and Krüger, Stefan and Thüm, Thomas and Bubel, Richard and Krieter, Sebastian and Bodden, Eric and Schaefer, Ina}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783030643539}},
  issn         = {{0302-9743}},
  title        = {{{Using Abstract Contracts for Verifying Evolving Features and Their Interactions}}},
  doi          = {{10.1007/978-3-030-64354-6_5}},
  year         = {{2020}},
}

@article{20892,
  author       = {{Bürger, Julius and Riedl, Thomas and Lindner, Jörg K.N.}},
  issn         = {{0304-3991}},
  journal      = {{Ultramicroscopy}},
  title        = {{{Influence of lens aberrations, specimen thickness and tilt on differential phase contrast STEM images}}},
  doi          = {{10.1016/j.ultramic.2020.113118}},
  year         = {{2020}},
}

@article{20893,
  abstract     = {{<jats:p>Block copolymer (BCP) self-assembly is a promising tool for next generation lithography as microphase separated polymer domains in thin films can act as templates for surface nanopatterning with sub-20 nm features. The replicated patterns can, however, only be as precise as their templates. Thus, the investigation of the morphology of polymer domains is of great importance. Commonly used analytical techniques (neutron scattering, scanning force microscopy) either lack spatial information or nanoscale resolution. Using advanced analytical (scanning) transmission electron microscopy ((S)TEM), we provide real space information on polymer domain morphology and interfaces between polystyrene (PS) and polymethylmethacrylate (PMMA) in cylinder- and lamellae-forming BCPs at highest resolution. This allows us to correlate the internal structure of polymer domains with line edge roughnesses, interface widths and domain sizes. STEM is employed for high-resolution imaging, electron energy loss spectroscopy and energy filtered TEM (EFTEM) spectroscopic imaging for material identification and EFTEM thickness mapping for visualisation of material densities at defects. The volume fraction of non-phase separated polymer species can be analysed by EFTEM. These methods give new insights into the morphology of polymer domains the exact knowledge of which will allow to improve pattern quality for nanolithography.</jats:p>}},
  author       = {{Bürger, Julius and Kunnathully, Vinay S. and Kool, Daniel and Lindner, Jörg K. N. and Brassat, Katharina}},
  issn         = {{2079-4991}},
  journal      = {{Nanomaterials}},
  title        = {{{Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM}}},
  doi          = {{10.3390/nano10010141}},
  year         = {{2020}},
}

@article{17995,
  author       = {{Riha, Christian and Buchholz, Sven S. and Chiatti, Olivio and Wieck, Andreas D. and Reuter, Dirk and Fischer, Saskia F.}},
  issn         = {{0003-6951}},
  journal      = {{Applied Physics Letters}},
  title        = {{{Excess noise in      Al x   Ga  1 − xAs/GaAs based quantum rings}}},
  doi          = {{10.1063/5.0002247}},
  year         = {{2020}},
}

@inbook{18014,
  author       = {{El Mesaoudi-Paul, Adil and Weiß, Dimitri and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}},
  booktitle    = {{Learning and Intelligent Optimization. LION 2020.}},
  isbn         = {{9783030535513}},
  issn         = {{0302-9743}},
  pages        = {{216 -- 232}},
  publisher    = {{Springer}},
  title        = {{{Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach}}},
  doi          = {{10.1007/978-3-030-53552-0_22}},
  volume       = {{12096}},
  year         = {{2020}},
}

@unpublished{18017,
  abstract     = {{We consider an extension of the contextual multi-armed bandit problem, in
which, instead of selecting a single alternative (arm), a learner is supposed
to make a preselection in the form of a subset of alternatives. More
specifically, in each iteration, the learner is presented a set of arms and a
context, both described in terms of feature vectors. The task of the learner is
to preselect $k$ of these arms, among which a final choice is made in a second
step. In our setup, we assume that each arm has a latent (context-dependent)
utility, and that feedback on a preselection is produced according to a
Plackett-Luce model. We propose the CPPL algorithm, which is inspired by the
well-known UCB algorithm, and evaluate this algorithm on synthetic and real
data. In particular, we consider an online algorithm selection scenario, which
served as a main motivation of our problem setting. Here, an instance (which
defines the context) from a certain problem class (such as SAT) can be solved
by different algorithms (the arms), but only $k$ of these algorithms can
actually be run.}},
  author       = {{El Mesaoudi-Paul, Adil and Bengs, Viktor and Hüllermeier, Eyke}},
  booktitle    = {{arXiv:2002.04275}},
  title        = {{{Online Preselection with Context Information under the Plackett-Luce  Model}}},
  year         = {{2020}},
}

@inbook{18020,
  author       = {{Graf-Schlattmann, Marcel and Meister, Dorothee M. and Oevel, Gudrun and Wilde, Melanie}},
  booktitle    = {{Zeitschrift für Hochschulentwicklung}},
  pages        = {{19 -- 39}},
  title        = {{{Kollektive Veränderungsbereitschaft als zentraler Erfolgsfaktor von Digitalisierungsprozessen an Hochschulen}}},
  year         = {{2020}},
}

@inproceedings{18021,
  author       = {{Yigitbas, Enes and Tejedor, Christopher Bernal and Engels, Gregor}},
  booktitle    = {{Proceedings of the Mensch und Computer 2020 (MuC ’20)}},
  title        = {{{Experiencing and Programming the ENIAC in VR}}},
  year         = {{2020}},
}

@inproceedings{18022,
  author       = {{Augstein, Mirjam and Buschek, Daniel and Herder, Eelco and Loepp, Benedikt and Yigitbas, Enes and Ziegler, Jürgen}},
  booktitle    = {{Proceedings of the Mensch und Computer 2020 (MuC ’20)}},
  publisher    = {{ACM}},
  title        = {{{UCAI 2020 - 1st International Workshop on User-Centered Artificial Intelligence}}},
  year         = {{2020}},
}

@inproceedings{18038,
  author       = {{Böttcher, Stefan and Hartel, Rita and Peeters, Sven}},
  booktitle    = {{Proceedings of The International Workshop on Semantic Big Data}},
  isbn         = {{9781450379748}},
  title        = {{{QSGG: query simulation in grammar-compressed graphs}}},
  doi          = {{10.1145/3391274.3393638}},
  year         = {{2020}},
}

@inproceedings{18039,
  author       = {{Böttcher, Stefan and Hartel, Rita and Peeters, Sven}},
  booktitle    = {{2020 Data Compression Conference (DCC) (Poster)}},
  isbn         = {{9781728164571}},
  title        = {{{Pattern Search in Grammar-Compressed Graphs}}},
  doi          = {{10.1109/dcc47342.2020.00054}},
  year         = {{2020}},
}

@misc{18066,
  author       = {{Skowronek, Michael}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}}},
  year         = {{2020}},
}

@misc{18085,
  author       = {{Heimann, Jonas}},
  title        = {{{Distributed Key Generation for Attribute-Based Signatures}}},
  year         = {{2020}},
}

@inproceedings{18109,
  author       = {{Yigitbas, Enes and Jovanovikj, Ivan and Scholand, Janis and Engels, Gregor}},
  booktitle    = {{Proceedings of the 26th ACM Symposium on Virtual Reality Software and Technology (VRST)}},
  publisher    = {{ACM}},
  title        = {{{VR Training for Warehouse Management }}},
  year         = {{2020}},
}