@article{34092,
  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 and Kool, Daniel and Lindner, Jörg and Brassat, Katharina}},
  issn         = {{2079-4991}},
  journal      = {{Nanomaterials}},
  keywords     = {{General Materials Science, General Chemical Engineering}},
  number       = {{1}},
  publisher    = {{MDPI AG}},
  title        = {{{Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM}}},
  doi          = {{10.3390/nano10010141}},
  volume       = {{10}},
  year         = {{2020}},
}

@inproceedings{35786,
  author       = {{Scheer, D. and Laubenstein, Désirée}},
  location     = {{Universität zu Köln}},
  title        = {{{Optimierung von Organisationsstrukturen für die emotionale und soziale Entwicklung? Wissenschaftliche Begleitung des Projekts „Geschwisterklassen“ - online.}}},
  year         = {{2020}},
}

@inproceedings{35791,
  author       = {{Scheer, D. and Laubenstein, Désirée}},
  location     = {{Potsdam}},
  title        = {{{Auswirkungen der Corona-Schulschließungen auf Schülerinnen und Schüler mit und ohne Förderbedarf der emotionalen und sozialen Entwicklung (COFESE) - online.}}},
  year         = {{2020}},
}

@inproceedings{46319,
  abstract     = {{The detection of orchestrated and potentially manipulative campaigns in social media is far more meaningful than an- alyzing single account behaviour but also more challenging in terms of pattern recognition, data processing, and com- putational complexity. While supervised learning methods need an enormous amount of reliable ground truth data to find rather inflexible patterns, classical unsupervised learn- ing techniques need a lot of computational power to handle large amount of data. This makes them infeasible for real- time analysis. In this work, we demonstrate the applicability of text stream clustering for the real-time detection of coordi- nated campaigns.}},
  author       = {{Assenmacher, D and Adam, L and Trautmann, Heike and Grimme, C}},
  booktitle    = {{Proceedings of the Florida Artificial Intelligence Research Society Conference}},
  title        = {{{Towards Real-Time and Unsupervised Campaign Detection in Social Media}}},
  year         = {{2020}},
}

@inproceedings{46320,
  abstract     = {{The identification of coordinated campaigns within Social Media is a complex task that is often hindered by missing labels and large amounts of data that have to be processed. We propose a new two-phase framework that uses unsupervised stream clustering for detecting suspicious trends over time in a first step. Afterwards, traditional offline analyses are applied to distinguish between normal trend evolution and malicious manipulation attempts. We demonstrate the applicability of our framework in the context of the final days of the Brexit in 2019/2020.}},
  author       = {{Assenmacher, D and Clever, L and Pohl, JS and Trautmann, Heike and Grimme, C}},
  booktitle    = {{Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis}},
  editor       = {{Meiselwitz, G}},
  isbn         = {{978-3-030-49570-1}},
  pages        = {{201–214}},
  publisher    = {{Springer International Publishing}},
  title        = {{{A Two-Phase Framework for Detecting Manipulation Campaigns in Social Media}}},
  doi          = {{10.1007/978-3-030-49570-1_14}},
  year         = {{2020}},
}

@article{37831,
  abstract     = {{<jats:p> Zusammenfassung. Die vorliegende Studie befasst sich mit der Übersetzung und Validierung des englischsprachigen Sport Emotion Questionnaire (SEQ; Jones et al., 2005 ), der vorwettbewerblichen Emotionen von Sporttreibenden misst. In einer ersten Teilstudie wurde mittels einer Hin-Rück-Übersetzung und des Bilingual-Retest-Verfahrens ( n = 32) eine deutsche Version des SEQ (SEQ-d) erzeugt. In Studie 2 (Tennisspieler/innen, n = 116) zeigte sich jedoch eine vom Original abweichende Faktorstruktur, woraufhin der SEQ-d als dreidimensionale Kurzskala entwickelt wurde. Diese wurde in Studie 3 (Läufern/innen, n = 271) validiert. Die Kurzskala besitzt einen akzeptablen Fit (CFI = .950, RMSEA = .069, SRMR = .063) und eine interne Konsistenz von α = .84 (negative Emotionen), α = .86 (positive Emotionen), α = .87 (Anspannung). Durch Korrelationen mit anderen Emotionsmerkmalen konnte die konvergente Validität bestätigt werden. Die Kriteriumsvalidität wurde anhand wettkampf- und personenbezogener Zusatzparameter untersucht (bspw. Alter, Wettkampferfahrung…). Mit der deutschsprachigen Version des SEQ liegt ein ökonomisches und validiertes Messinstrument zur Erfassung vorwettbewerblicher Emotionen vor. </jats:p>}},
  author       = {{Wetzel, Änne and Weigelt, Matthias and Klingsieck, Katrin Birte}},
  issn         = {{0012-1924}},
  journal      = {{Diagnostica}},
  keywords     = {{Clinical Psychology}},
  number       = {{4}},
  pages        = {{246--257}},
  publisher    = {{Hogrefe Publishing Group}},
  title        = {{{Übersetzung und Validierung einer deutschsprachigen Version des Sport Emotion Questionnaire (SEQ)}}},
  doi          = {{10.1026/0012-1924/a000255}},
  volume       = {{66}},
  year         = {{2020}},
}

@article{29112,
  abstract     = {{<jats:p> Zusammenfassung. Die vorliegende Studie befasst sich mit der Übersetzung und Validierung des englischsprachigen Sport Emotion Questionnaire (SEQ; Jones et al., 2005 ), der vorwettbewerblichen Emotionen von Sporttreibenden misst. In einer ersten Teilstudie wurde mittels einer Hin-Rück-Übersetzung und des Bilingual-Retest-Verfahrens ( n = 32) eine deutsche Version des SEQ (SEQ-d) erzeugt. In Studie 2 (Tennisspieler/innen, n = 116) zeigte sich jedoch eine vom Original abweichende Faktorstruktur, woraufhin der SEQ-d als dreidimensionale Kurzskala entwickelt wurde. Diese wurde in Studie 3 (Läufern/innen, n = 271) validiert. Die Kurzskala besitzt einen akzeptablen Fit (CFI = .950, RMSEA = .069, SRMR = .063) und eine interne Konsistenz von α = .84 (negative Emotionen), α = .86 (positive Emotionen), α = .87 (Anspannung). Durch Korrelationen mit anderen Emotionsmerkmalen konnte die konvergente Validität bestätigt werden. Die Kriteriumsvalidität wurde anhand wettkampf- und personenbezogener Zusatzparameter untersucht (bspw. Alter, Wettkampferfahrung…). Mit der deutschsprachigen Version des SEQ liegt ein ökonomisches und validiertes Messinstrument zur Erfassung vorwettbewerblicher Emotionen vor. </jats:p>}},
  author       = {{Wetzel, Änne and Weigelt, Matthias and Klingsieck, Katrin B.}},
  issn         = {{0012-1924}},
  journal      = {{Diagnostica}},
  pages        = {{246--257}},
  title        = {{{Übersetzung und Validierung einer deutschsprachigen Version des Sport Emotion Questionnaire (SEQ)}}},
  doi          = {{10.1026/0012-1924/a000255}},
  year         = {{2020}},
}

@article{23468,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>The value of models is well recognised in product and systems engineering. Modelling languages and diagrams are used to capture mental models and to handle model complexity. Literature research indicates that there are only very few approaches to utilise the potential of virtual and augmented reality for supporting tasks in model based (systems) engineering. The paper at hand contributes a new morphology of intuitive interaction for Immersive Abstraction as a holistic approach to extend that coverage. It presents a holistic framework to categorise solutions and future research directions.</jats:p>}},
  author       = {{Gräßler, Iris and Pottebaum, Jens}},
  issn         = {{2633-7762}},
  journal      = {{Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020}},
  pages        = {{1295--1304}},
  publisher    = {{Cambridge University Press}},
  title        = {{{Immersive Abstraction: A new Morphology of Intuitive Interaction with System Models}}},
  doi          = {{10.1017/dsd.2020.158}},
  volume       = {{Band 1}},
  year         = {{2020}},
}

@inproceedings{16790,
  author       = {{Krings, Sarah Claudia and Yigitbas, Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor}},
  booktitle    = {{Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)}},
  isbn         = {{978-1-4503-7984-7/20/06}},
  title        = {{{Development Framework for Context-Aware Augmented Reality Applications}}},
  doi          = {{10.1145/3393672.3398640}},
  year         = {{2020}},
}

@inproceedings{48847,
  abstract     = {{Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that EAs can solve the graph coloring problem for bipartite graphs more efficiently by using dynamic optimization. In our approach the graph instance is given incrementally such that the EA can reoptimize its coloring when a new edge introduces a conflict. We show that, when edges are inserted in a way that preserves graph connectivity, Randomized Local Search (RLS) efficiently finds a proper 2-coloring for all bipartite graphs. This includes graphs for which RLS and other EAs need exponential expected time in a static optimization scenario. We investigate different ways of building up the graph by popular graph traversals such as breadth-first-search and depth-first-search and analyse the resulting runtime behavior. We further show that offspring populations (e. g. a (1 + {$\lambda$}) RLS) lead to an exponential speedup in {$\lambda$}. Finally, an island model using 3 islands succeeds in an optimal time of {$\Theta$}(m) on every m-edge bipartite graph, outperforming offspring populations. This is the first example where an island model guarantees a speedup that is not bounded in the number of islands.}},
  author       = {{Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-7128-5}},
  keywords     = {{dynamic optimization, evolutionary algorithms, running time analysis, theory}},
  pages        = {{1277–1285}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization}}},
  doi          = {{10.1145/3377930.3390174}},
  year         = {{2020}},
}

@inproceedings{48851,
  abstract     = {{Several important optimization problems in the area of vehicle routing can be seen as variants of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the Traveling Thief Problem (TTP) has gained increasing interest over the last 5 years. In this paper, we investigate the effect of weights on such problems, in the sense that the cost of traveling increases with respect to the weights of nodes already visited during a tour. This provides abstractions of important TSP variants such as the Traveling Thief Problem and time dependent TSP variants, and allows to study precisely the increase in difficulty caused by weight dependence. We provide a 3.59-approximation for this weight dependent version of TSP with metric distances and bounded positive weights. Furthermore, we conduct experimental investigations for simple randomized local search with classical mutation operators and two variants of the state-of-the-art evolutionary algorithm EAX adapted to the weighted TSP. Our results show the impact of the node weights on the position of the nodes in the resulting tour.}},
  author       = {{Bossek, Jakob and Casel, Katrin and Kerschke, Pascal and Neumann, Frank}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-7128-5}},
  keywords     = {{dynamic optimization, evolutionary algorithms, running time analysis, theory}},
  pages        = {{1286–1294}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics}}},
  doi          = {{10.1145/3377930.3390243}},
  year         = {{2020}},
}

@inproceedings{48845,
  abstract     = {{In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier.}},
  author       = {{Bossek, Jakob and Grimme, Christian and Trautmann, Heike}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-7128-5}},
  keywords     = {{decision making, dynamic optimization, evolutionary algorithms, multi-objective optimization, vehicle routing}},
  pages        = {{166–174}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Dynamic Bi-Objective Routing of Multiple Vehicles}}},
  doi          = {{10.1145/3377930.3390146}},
  year         = {{2020}},
}

@inproceedings{48850,
  abstract     = {{Sequential model-based optimization (SMBO) approaches are algorithms for solving problems that require computationally or otherwise expensive function evaluations. The key design principle of SMBO is a substitution of the true objective function by a surrogate, which is used to propose the point(s) to be evaluated next. SMBO algorithms are intrinsically modular, leaving the user with many important design choices. Significant research efforts go into understanding which settings perform best for which type of problems. Most works, however, focus on the choice of the model, the acquisition function, and the strategy used to optimize the latter. The choice of the initial sampling strategy, however, receives much less attention. Not surprisingly, quite diverging recommendations can be found in the literature. We analyze in this work how the size and the distribution of the initial sample influences the overall quality of the efficient global optimization (EGO) algorithm, a well-known SMBO approach. While, overall, small initial budgets using Halton sampling seem preferable, we also observe that the performance landscape is rather unstructured. We furthermore identify several situations in which EGO performs unfavorably against random sampling. Both observations indicate that an adaptive SMBO design could be beneficial, making SMBO an interesting test-bed for automated algorithm design.}},
  author       = {{Bossek, Jakob and Doerr, Carola and Kerschke, Pascal}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-7128-5}},
  keywords     = {{continuous black-box optimization, design of experiments, initial design, sequential model-based optimization}},
  pages        = {{778–786}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB}}},
  doi          = {{10.1145/3377930.3390155}},
  year         = {{2020}},
}

@inproceedings{48846,
  abstract     = {{We consider a dynamic bi-objective vehicle routing problem, where a subset of customers ask for service over time. Therein, the distance traveled by a single vehicle and the number of unserved dynamic requests is minimized by a dynamic evolutionary multi-objective algorithm (DEMOA), which operates on discrete time windows (eras). A decision is made at each era by a decision-maker, thus any decision depends on irreversible decisions made in foregoing eras. To understand effects of sequences of decision-making and interactions/dependencies between decisions made, we conduct a series of experiments. More precisely, we fix a set of decision-maker preferences D and the number of eras n{$<$}inf{$>$}t{$<$}/inf{$>$} and analyze all $|D|\^{n_t}$ combinations of decision-maker options. We find that for random uniform instances (a) the final selected solutions mainly depend on the final decision and not on the decision history, (b) solutions are quite robust with respect to the number of unvisited dynamic customers, and (c) solutions of the dynamic approach can even dominate solutions obtained by a clairvoyant EMOA. In contrast, for instances with clustered customers, we observe a strong dependency on decision-making history as well as more variance in solution diversity.}},
  author       = {{Bossek, Jakob and Grimme, Christian and Rudolph, Günter and Trautmann, Heike}},
  booktitle    = {{2020 IEEE Congress on Evolutionary Computation (CEC)}},
  pages        = {{1–8}},
  publisher    = {{IEEE Press}},
  title        = {{{Towards Decision Support in Dynamic Bi-Objective Vehicle Routing}}},
  doi          = {{10.1109/CEC48606.2020.9185778}},
  year         = {{2020}},
}

@inproceedings{48879,
  abstract     = {{Evolving diverse sets of high quality solutions has gained increasing interest in the evolutionary computation literature in recent years. With this paper, we contribute to this area of research by examining evolutionary diversity optimisation approaches for the classical Traveling Salesperson Problem (TSP). We study the impact of using different diversity measures for a given set of tours and the ability of evolutionary algorithms to obtain a diverse set of high quality solutions when adopting these measures. Our studies show that a large variety of diverse high quality tours can be achieved by using our approaches. Furthermore, we compare our approaches in terms of theoretical properties and the final set of tours obtained by the evolutionary diversity optimisation algorithm.}},
  author       = {{Do, Anh Viet and Bossek, Jakob and Neumann, Aneta and Neumann, Frank}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-7128-5}},
  keywords     = {{diversity maximisation, evolutionary algorithms, travelling salesperson problem}},
  pages        = {{681–689}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Evolving Diverse Sets of Tours for the Travelling Salesperson Problem}}},
  doi          = {{10.1145/3377930.3389844}},
  year         = {{2020}},
}

@inproceedings{48895,
  abstract     = {{Evolutionary algorithms (EAs) are general-purpose problem solvers that usually perform an unbiased search. This is reasonable and desirable in a black-box scenario. For combinatorial optimization problems, often more knowledge about the structure of optimal solutions is given, which can be leveraged by means of biased search operators. We consider the Minimum Spanning Tree (MST) problem in a single- and multi-objective version, and introduce a biased mutation, which puts more emphasis on the selection of edges of low rank in terms of low domination number. We present example graphs where the biased mutation can significantly speed up the expected runtime until (Pareto-)optimal solutions are found. On the other hand, we demonstrate that bias can lead to exponential runtime if "heavy" edges are necessarily part of an optimal solution. However, on general graphs in the single-objective setting, we show that a combined mutation operator which decides for unbiased or biased edge selection in each step with equal probability exhibits a polynomial upper bound - as unbiased mutation - in the worst case and benefits from bias if the circumstances are favorable.}},
  author       = {{Roostapour, Vahid and Bossek, Jakob and Neumann, Frank}},
  booktitle    = {{Proceedings of the 2020 Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-7128-5}},
  keywords     = {{biased mutation, evolutionary algorithms, minimum spanning tree problem, runtime analysis}},
  pages        = {{551–559}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem}}},
  doi          = {{10.1145/3377930.3390168}},
  year         = {{2020}},
}

@inbook{49831,
  author       = {{Diedrich, Alena}},
  booktitle    = {{Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext}},
  editor       = {{Bremer, Kai and Elit, Stefan and Kroucheva, Katerina}},
  publisher    = {{Metzler}},
  title        = {{{Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang der Titanic}}},
  year         = {{2020}},
}

@article{45726,
  author       = {{Martin, K. D. and Kim, J. J. and Palmatier, R. W. and Steinhoff, Lena and Stewart, D. W. and Walker, B. A. and Wang, Y. and Weaven, S. K.}},
  journal      = {{Journal of Retailing}},
  number       = {{4}},
  pages        = {{474--489}},
  title        = {{{Data Privacy in Retail}}},
  doi          = {{https://doi.org/10.1016/j.jretai.2020.08.003}},
  volume       = {{96}},
  year         = {{2020}},
}

@inproceedings{16852,
  author       = {{Groth, Stefan and Grünewald, Daniel and Teich, Jürgen and Hannig, Frank}},
  booktitle    = {{Proceedings of the 17th ACM International Conference on Computing Frontiers (CF '2020)}},
  location     = {{Catania, Sicily, Italy}},
  publisher    = {{ACM}},
  title        = {{{A Runtime System for Finite Element Methods in a Partitioned Global Address Space}}},
  doi          = {{10.1145/3387902.3392628}},
  year         = {{2020}},
}

@article{47476,
  abstract     = {{Digital data on tangible and intangible cultural assets is an essential part of daily life, communication and experience. It has a lasting influence on the perception of cultural identity as well as on the interactions between research, the cultural economy and society. Throughout the last three decades, many cultural heritage institutions have contributed a wealth of digital representations of cultural assets (2D digital reproductions of paintings, sheet music, 3D digital models of sculptures, monuments, rooms, buildings), audio-visual data (music, film, stage performances), and procedural research data such as encoding and annotation formats. The long-term preservation and FAIR availability of research data from the cultural heritage domain is fundamentally important, not only for future academic success in the humanities but also for the cultural identity of individuals and society as a whole. Up to now, no coordinated effort for professional research data management on a national level exists in Germany. NFDI4Culture aims to fill this gap and create a user-centered, research-driven infrastructure that will cover a broad range of research domains from musicology, art history and architecture to performance, theatre, film, and media studies.</jats:p>
          <jats:p>The research landscape addressed by the consortium is characterized by strong institutional differentiation. Research units in the consortium's community of interest comprise university institutes, art colleges, academies, galleries, libraries, archives and museums. This diverse landscape is also characterized by an abundance of research objects, methodologies and a great potential for data-driven research. In a unique effort carried out by the applicant and co-applicants of this proposal and ten academic societies, this community is interconnected for the first time through a federated approach that is ideally suited to the needs of the participating researchers. To promote collaboration within the NFDI, to share knowledge and technology and to provide extensive support for its users have been the guiding principles of the consortium from the beginning and will be at the heart of all workflows and decision-making processes. Thanks to these principles, NFDI4Culture has gathered strong support ranging from individual researchers to high-level cultural heritage organizations such as the UNESCO, the International Council of Museums, the Open Knowledge Foundation and Wikimedia. On this basis, NFDI4Culture will take innovative measures that promote a cultural change towards a more reflective and sustainable handling of research data and at the same time boost qualification and professionalization in data-driven research in the domain of cultural heritage. This will create a long-lasting impact on science, cultural economy and society as a whole.}},
  author       = {{Altenhöner, Reinhard and Blümel, Ina and Boehm, Franziska and Bove, Jens and Bicher, Katrin and Bracht, Christian and Brand, Ortrun and Dieckmann, Lisa and Effinger, Maria and Hagener, Malte and Hammes, Andrea and Heller, Lambert and Kailus, Angela and Kohle, Hubertus and Ludwig, Jens and Münzmay, Andreas and Pittroff, Sarah and Razum, Matthias and Röwenstrunk, Daniel and Sack, Harald and Simon, Holger and Schmidt, Dörte and Schrade, Torsten and Walzel, Annika-Valeska and Wiermann, Barbara}},
  issn         = {{2367-7163}},
  journal      = {{Research Ideas and Outcomes}},
  keywords     = {{Research Data Management}},
  publisher    = {{Pensoft Publishers}},
  title        = {{{NFDI4Culture - Consortium for research data on material and immaterial cultural heritage}}},
  doi          = {{10.3897/rio.6.e57036}},
  volume       = {{6}},
  year         = {{2020}},
}