@inproceedings{51370,
  author       = {{Dyck, Leonie and Beierling, Helen and Helmert, Robin and Vollmer, Anna-Lisa}},
  booktitle    = {{Companion of the 2023 ACM/IEEE International Conference on Human-Robot Interaction}},
  location     = {{Stockholm }},
  pages        = {{720--724}},
  publisher    = {{ACM}},
  title        = {{{Technical Transparency for Robot Navigation Through AR Visualizations}}},
  doi          = {{10.1145/3568294.3580181}},
  year         = {{2023}},
}

@article{51368,
  abstract     = {{Dealing with opaque algorithms, the frequent overlap between transparency and explainability produces seemingly unsolvable dilemmas, as the much-discussed trade-off between model performance and model transparency. Referring to Niklas Luhmann's notion of communication, the paper argues that explainability does not necessarily require transparency and proposes an alternative approach. Explanations as communicative processes do not imply any disclosure of thoughts or neural processes, but only reformulations that provide the partners with additional elements and enable them to understand (from their perspective) what has been done and why. Recent computational approaches aiming at post-hoc explainability reproduce what happens in communication, producing explanations of the working of algorithms that can be different from the processes of the algorithms.}},
  author       = {{Esposito, Elena }},
  journal      = {{Sociologica}},
  keywords     = {{Explainable AI, Transparency, Explanation, Communication, Sociological systems theory}},
  number       = {{3}},
  pages        = {{17--27}},
  title        = {{{Does Explainability Require Transparency?}}},
  doi          = {{10.6092/ISSN.1971-8853/15804}},
  volume       = {{16}},
  year         = {{2023}},
}

@article{51369,
  abstract     = {{This short introduction presents the symposium ‘Explaining Machines’. It locates the debate about Explainable AI in the history of the reflection about AI and outlines the issues discussed in the contributions.}},
  author       = {{Esposito, Elena}},
  journal      = {{Sociologica}},
  keywords     = {{Explainable AI, Inexplicability, Transparency, Explanation, Opacity, Contestability}},
  number       = {{3}},
  pages        = {{1--4}},
  title        = {{{Explaining Machines: Social Management of Incomprehensible Algorithms. Introduction}}},
  doi          = {{10.6092/ISSN.1971-8853/16265}},
  volume       = {{16}},
  year         = {{2023}},
}

@article{52094,
  author       = {{Kamp, Hermann}},
  journal      = {{Le Mediaeval Journal }},
  pages        = {{95--124}},
  publisher    = {{Brepols}},
  title        = {{{Norms and Rituals of Conflict Settlement in Foreign Affairs in the High Middle Ages}}},
  volume       = {{11.2}},
  year         = {{2023}},
}

@misc{51804,
  author       = {{Stadler, Peter and Anna Maria, Neubert and Schreiter, Solveig and Obert, Salome and Ried, Dennis}},
  publisher    = {{LibreCat University}},
  title        = {{{Edirom/WeGA-ODD: WeGA ODD files release 4.7.0}}},
  doi          = {{10.5281/ZENODO.7652568}},
  year         = {{2023}},
}

@article{45598,
  author       = {{Meier, Heiko and Sennefelder, Lisa}},
  journal      = {{markt&wirtschaft}},
  number       = {{6}},
  pages        = {{32--33}},
  publisher    = {{PBL Media Verlag}},
  title        = {{{Gesundheitsmanagement: Gesunde Mitarbeiter - gesunder Betrieb?}}},
  year         = {{2023}},
}

@inproceedings{47527,
  author       = {{Sennefelder, Lisa}},
  location     = {{Bochum}},
  title        = {{{Sportliche Angebote zur Förderung von Vertrauen in öffentlichen Verwaltungen}}},
  year         = {{2023}},
}

@techreport{52127,
  abstract     = {{This report documents the program and the outcomes of Dagstuhl Seminar 23161 "Pushing the Limits of Computational Combinatorial Constructions". In this Dagstuhl Seminar, we focused on computational methods for challenging problems in combinatorial construction. This includes algorithms for construction of combinatorial objects with prescribed symmetry, for isomorph-free exhaustive generation, and for combinatorial search. Examples of specific algorithmic techniques are tactical decomposition, the Kramer-Mesner method, algebraic methods, graph isomorphism software, isomorph-free generation, clique-finding methods, heuristic search, SAT solvers, and combinatorial optimization. There was an emphasis on problems involving graphs, designs and codes, also including topics in related fields such as finite geometry, graph decomposition, Hadamard matrices, Latin squares, and q-analogs of designs and codes.}},
  author       = {{Moura, Lucia and Nakic, Anamari and Östergård, Patric and Wassermann, Alfred and Weiß, Charlene}},
  keywords     = {{automorphism groups, combinatorial algorithms, finite geometries, subspace designs}},
  pages        = {{40--57}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)}}},
  doi          = {{10.4230/DagRep.13.4.40}},
  volume       = {{13, Issue 4}},
  year         = {{2023}},
}

@article{51806,
  author       = {{Voß, Fabian}},
  journal      = {{Antike und Abendland}},
  number       = {{1}},
  pages        = {{117--146}},
  title        = {{{Geschichte heilen: Urbane Interventionen und ihre Deutung durch den päpstlichen Hofarchitekten Domenico Fontana (1543–1607)}}},
  volume       = {{69}},
  year         = {{2023}},
}

@inproceedings{50289,
  author       = {{Bohl, Benjamin W. and Ried, Dennis}},
  booktitle    = {{Music Encoding Conference Proceedings 2022}},
  editor       = {{Weigl, David M.}},
  location     = {{Dalhousie University, Nova Scotia, Canada}},
  title        = {{{»Play it again, Sam« – Levels of Complexity in Encoding Performance Personnel}}},
  doi          = {{10.17613/XN3G-VS35}},
  year         = {{2023}},
}

@article{51687,
  author       = {{Ried, Dennis}},
  journal      = {{Blick in die Geschichte. Karlsruher stadthistorische Beiträge}},
  number       = {{140}},
  pages        = {{1}},
  publisher    = {{Stadt Karlsruhe}},
  title        = {{{Ludwig Baumann}}},
  year         = {{2023}},
}

@misc{51684,
  author       = {{Ried, Dennis and Capelle, Irmlind and Minetti, Elena}},
  publisher    = {{Henze-Digital}},
  title        = {{{HenDi-ODD v2.0.0}}},
  doi          = {{10.5281/ZENODO.10391194}},
  year         = {{2023}},
}

@misc{51680,
  author       = {{Ried, Dennis}},
  publisher    = {{Henze-Digital}},
  title        = {{{HenDi-WebApp v1.0.0}}},
  doi          = {{10.5281/ZENODO.8304639}},
  year         = {{2023}},
}

@misc{51683,
  author       = {{Ried, Dennis and Capelle, Irmlind and Minetti, Elena}},
  publisher    = {{Henze-Digital}},
  title        = {{{HenDi-ODD v1.0.0}}},
  doi          = {{10.5281/ZENODO.8304804}},
  year         = {{2023}},
}

@misc{51681,
  author       = {{Ried, Dennis}},
  publisher    = {{Henze-Digital}},
  title        = {{{HenDi-WebApp v2.0.0}}},
  doi          = {{10.5281/ZENODO.10390049}},
  year         = {{2023}},
}

@article{51770,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Workarounds are goal‐driven deviations from the standard operating procedures performed to overcome obstacles constraining day‐to‐day work. Despite starting as temporary fixes, they can become established across an organisation and trigger the innovation of processes and IT artefacts that can resolve misfits permanently. Although prior research has elicited antecedents and types of workarounds, it is not known how workarounds diffuse in an organisation and, thereby, innovating co‐workers' activities, IT artefacts, and organisational structures. The results of our multiple two‐year case study provide unique empirical insights into the diffusion of workarounds and how they can act as generative mechanisms for bottom‐up process innovation.</jats:p>}},
  author       = {{Bartelheimer, Christian and Wolf, Verena and Beverungen, Daniel}},
  issn         = {{1350-1917}},
  journal      = {{Information Systems Journal}},
  keywords     = {{Computer Networks and Communications, Information Systems, Software}},
  number       = {{5}},
  pages        = {{1085--1150}},
  publisher    = {{Wiley}},
  title        = {{{Workarounds as generative mechanisms for bottom‐up process innovation—Insights from a multiple case study}}},
  doi          = {{10.1111/isj.12435}},
  volume       = {{33}},
  year         = {{2023}},
}

@article{52122,
  author       = {{Ali, Usman and Holthaus, Martin and Meier, Torsten}},
  issn         = {{2643-1564}},
  journal      = {{Physical Review Research}},
  keywords     = {{General Physics and Astronomy}},
  number       = {{4}},
  publisher    = {{American Physical Society (APS)}},
  title        = {{{Chirped Bloch-harmonic oscillations in a parametrically forced optical lattice}}},
  doi          = {{10.1103/physrevresearch.5.043152}},
  volume       = {{5}},
  year         = {{2023}},
}

@article{46492,
  author       = {{Seutter, Janina and Kutzner, K. and Stadtländer, M. and Kundisch, Dennis and Knackstedt,  R.}},
  journal      = {{Electronic Markets}},
  number       = {{1}},
  pages        = {{47}},
  title        = {{{“Sorry, Too Much Information”. Designing Online Review Systems that Support Information Search and Processing}}},
  volume       = {{33}},
  year         = {{2023}},
}

@article{46040,
  author       = {{Seutter, Janina and Müller, Michelle and Kundisch, Dennis}},
  journal      = {{Wirtschaftsinformatik & Management}},
  number       = {{4}},
  pages        = {{282--289}},
  title        = {{{Verdrängen Smart-Product-Service-Systeme die Interaktion in Online-Communities? – Empirische Evidenz aus einer Rezept-Community}}},
  volume       = {{15}},
  year         = {{2023}},
}

@inproceedings{44849,
  author       = {{Rautenberg, Frederik and Kuhlmann, Michael and Ebbers, Janek and Wiechmann, Jana and Seebauer, Fritz and Wagner, Petra and Haeb-Umbach, Reinhold}},
  booktitle    = {{Fortschritte der Akustik - DAGA 2023}},
  location     = {{Hamburg}},
  pages        = {{1409--1412}},
  title        = {{{Speech Disentanglement for Analysis and Modification of Acoustic and Perceptual Speaker Characteristics}}},
  year         = {{2023}},
}