@article{59616,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>The activation of C(<jats:italic>sp</jats:italic><jats:sup>3</jats:sup>)−F bonds by the commercially available catalyst B(C<jats:sub>6</jats:sub>F<jats:sub>5</jats:sub>)<jats:sub>3</jats:sub> is reported and applied in reactions with arenes, allylic, vinylic and acetylenic silanes, and olefins to achieve a variety of C−C bond formations (45 examples).</jats:p>}},
  author       = {{Hoppe, Axel and Stepen, Arne J. and Köring, Laura and Paradies, Jan}},
  issn         = {{1615-4150}},
  journal      = {{Advanced Synthesis &amp; Catalysis}},
  keywords     = {{fluoride, bond activation, borane, Lewis acid, C-C bond formation}},
  number       = {{13}},
  pages        = {{2933--2938}},
  publisher    = {{Wiley}},
  title        = {{{Tris(pentafluorophenyl)borane‐Catalyzed Functionalization of Benzylic C−F Bonds}}},
  doi          = {{10.1002/adsc.202400511}},
  volume       = {{366}},
  year         = {{2024}},
}

@article{30511,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Many critical codebases are written in C, and most of them use preprocessor directives to encode variability, effectively encoding software product lines. These preprocessor directives, however, challenge any static code analysis. SPLlift, a previously presented approach for analyzing software product lines, is limited to Java programs that use a rather simple feature encoding and to analysis problems with a finite and ideally small domain. Other approaches that allow the analysis of real-world C software product lines use special-purpose analyses, preventing the reuse of existing analysis infrastructures and ignoring the progress made by the static analysis community. This work presents <jats:sc>VarAlyzer</jats:sc>, a novel static analysis approach for software product lines. <jats:sc>VarAlyzer</jats:sc> first transforms preprocessor constructs to plain C while preserving their variability and semantics. It then solves any given distributive analysis problem on transformed product lines in a variability-aware manner. <jats:sc>VarAlyzer</jats:sc> ’s analysis results are annotated with feature constraints that encode in which configurations each result holds. Our experiments with 95 compilation units of OpenSSL show that applying <jats:sc>VarAlyzer</jats:sc> enables one to conduct inter-procedural, flow-, field- and context-sensitive data-flow analyses on entire product lines for the first time, outperforming the product-based approach for highly-configurable systems.</jats:p>}},
  author       = {{Schubert, Philipp and Gazzillo, Paul and Patterson, Zach and Braha, Julian and Schiebel, Fabian Benedikt and Hermann, Ben and Wei, Shiyi and Bodden, Eric}},
  issn         = {{0928-8910}},
  journal      = {{Automated Software Engineering}},
  keywords     = {{inter-procedural static analysis, software product lines, preprocessor, LLVM, C/C++}},
  number       = {{1}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Static data-flow analysis for software product lines in C}}},
  doi          = {{10.1007/s10515-022-00333-1}},
  volume       = {{29}},
  year         = {{2022}},
}

@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{63991,
  abstract     = {{A series of 1 and 2 nm sized platinum nanoparticles (Pt-NPs) deposited on different support materials, namely, gamma-alumina (gamma-Al2O3), titanium dioxide (TiO2), silicon dioxide (SiO2) and fumed silica are investigated by solid-state NMR and dynamic nuclear polarization enhanced NMR spectroscopy (DNP). DNP signal enhancement factors up to 170 enable gaining deeper insight into the surface chemistry of Pt-NPs. Carbon monoxide is used as a probe molecule to analyze the adsorption process and the surface chemistry on the supported Pt-NPs. The studied systems show significant catalytic activity in carbon monoxide oxidation on their surface at room temperature. The underlying catalytic mechanism is the water-gas shift reaction. In the case of alumina as the support the produced CO2 reacts with the surface to form carbonate, which is revealed by solid-state NMR. A similar carbonate formation is also observed when physical mixtures of neat alumina with silica, fumed silica and titania supported Pt-NPs are studied.}},
  author       = {{Klimavicius, V. and Neumann, S. and Kunz, S. and Gutmann, Torsten and Buntkowsky, G.}},
  issn         = {{2044-4753}},
  journal      = {{Catalysis Science & Technology}},
  keywords     = {{Chemistry, gamma-alumina, hydrogenation, silica, c-13, interactions, metal-catalysts, particle-size, platinum nanoparticles, sites, surface, water-gas shift}},
  number       = {{14}},
  pages        = {{3743–3752}},
  title        = {{{Room temperature CO oxidation catalysed by supported Pt nanoparticles revealed by solid-state NMR and DNP spectroscopy}}},
  doi          = {{10.1039/c9cy00684b}},
  volume       = {{9}},
  year         = {{2019}},
}

@inproceedings{4563,
  abstract     = {{Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.

In this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\mathcal{O}\left(\log ^2 n\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.
}},
  author       = {{Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}},
  booktitle    = {{Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }},
  keywords     = {{greedy routing, ad hoc networks, convex hulls, c-competitiveness}},
  location     = {{Helsinki}},
  publisher    = {{Springer}},
  title        = {{{Competitive Routing in Hybrid Communication Networks}}},
  year         = {{2018}},
}

@article{64010,
  abstract     = {{Seven novel dirhodium coordination polymers (Rh-2-Ln) (n = 1-7) are prepared by employing bitopic ligands to connect dirhodium nodes. The formation of the framework is confirmed by attenuated total reflectance Fourier transform infrared (ATR-FTIR) and H-1 C-13 cross polarization magic angle spinning nuclear magnetic resonance (CP MAS NMR) spectroscopy. Defect sites resulting from incomplete ligand substitution are revealed by F-19 MAS NMR. The random stacking behavior of the frameworks in the obtained solid is analyzed by scanning electron microscopy (SEM) and X-ray diffraction (XRD). The Rh-2/O interaction in neighboring layers is investigated by diffuse reflectance ultra-violet visible light (DR-UV-vis) spectroscopy and X-ray photoelectron spectroscopy (XPS). This interaction is relevant to understand the catalytic behavior of various Rh-2-Ln catalysts in the cyclopropanation of styrene with ethyl diazoacetate (EDA). In this context, the structure-reactivity relationship is discussed by taking into consideration both interlayer Rh-2/O interactions and steric effects of side chains.}},
  author       = {{Liu, J. Q. and Xu, Y. P. and Groszewicz, P. B. and Brodrecht, M. and Fasel, C. and Hofmann, K. and Tan, X. J. and Gutmann, Torsten and Buntkowsky, G.}},
  issn         = {{2044-4753}},
  journal      = {{Catalysis Science & Technology}},
  keywords     = {{Chemistry, asymmetric cyclopropanation, c-h insertion, carbene transformations, carboxylates, catalysts, functionalization, immobilization, metal-organic frameworks, nmr, solid support}},
  number       = {{20}},
  pages        = {{5190–5200}},
  title        = {{{Novel dirhodium coordination polymers: the impact of side chains on cyclopropanation}}},
  doi          = {{10.1039/c8cy01493k}},
  volume       = {{8}},
  year         = {{2018}},
}