[{"department":[{"_id":"613"}],"keyword":["Chalcopyrite absorber","Scanning tunneling spectroscopy","Electron backscatter diffraction","Density functional theory","Surface dipole"],"type":"journal_article","date_created":"2020-10-01T09:19:55Z","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"abstract":[{"text":"Individual grains of chalcopyrite solar cell absorbers can facet in different crystallographic directions at their surfaces. To gain a deeper understanding of the junction formation in these devices, we correlate variations in the surface facet orientation with the defect electronic properties. We use a combined analytical approach based on scanning tunneling spectroscopy (STS), scanning electron microscopy, and electron back scatter diffraction (EBSD), where we perform these experiments on identical surface areas as small as 2 × 2 µm2 with a lateral resolution well below 50 nm. The topography of the absorber surfaces indicates two main morphological features: micro-faceted, long basalt-like columns and their short nano-faceted terminations. Our STS results reveal that the long columns exhibit spectral signatures typical for the presence of pronounced oxidation-induced surface dipoles in conjunction with an increased density of electronic defect levels. In contrast, the nano-faceted terminations of the basalt-like columns are largely passivated in terms of electronic defect levels within the band gap region. Corresponding crystallographic data based on EBSD experiments show that the surface of the basalt-like columns can be assigned to intrinsically polar facet orientations, while the passivated terminations are assigned to non-polar planes. Ab-initio calculations suggest that the polar surfaces are more prone to oxidation and resulting O-induced defects, in comparison to non-polar planes. Our results emphasize the correlation between morphology, surface facet orientations and surface electronic properties. Furthermore, this work aids in gaining a fundamental understanding of oxidation induced lateral inhomogeneities in view of the p-n junction formation in chalcopyrite thin-film solar cells.","lang":"eng"}],"citation":{"ama":"Elizabeth A, Conradi H, K. Sahoo S, et al. Correlating facet orientation, defect-level density and dipole layer formation at the surface of polycrystalline CuInSe2 thin films. <i>Acta Materialia</i>. 2020;200. doi:<a href=\"https://doi.org/10.1016/j.actamat.2020.09.028\">https://doi.org/10.1016/j.actamat.2020.09.028</a>","bibtex":"@article{Elizabeth_Conradi_K. Sahoo_Kodalle_A. Kaufmann_Kühne_Mirhosseini_Abou-Ras_Mönig_2020, title={Correlating facet orientation, defect-level density and dipole layer formation at the surface of polycrystalline CuInSe2 thin films}, volume={200}, DOI={<a href=\"https://doi.org/10.1016/j.actamat.2020.09.028\">https://doi.org/10.1016/j.actamat.2020.09.028</a>}, journal={Acta Materialia}, author={Elizabeth, Amala and Conradi, Hauke and K. Sahoo, Sudhir and Kodalle, Tim and A. Kaufmann, Christian and Kühne, Thomas and Mirhosseini, Hossein and Abou-Ras, Daniel and Mönig, Harry}, year={2020} }","mla":"Elizabeth, Amala, et al. “Correlating Facet Orientation, Defect-Level Density and Dipole Layer Formation at the Surface of Polycrystalline CuInSe2 Thin Films.” <i>Acta Materialia</i>, vol. 200, 2020, doi:<a href=\"https://doi.org/10.1016/j.actamat.2020.09.028\">https://doi.org/10.1016/j.actamat.2020.09.028</a>.","chicago":"Elizabeth, Amala, Hauke Conradi, Sudhir K. Sahoo, Tim Kodalle, Christian A. Kaufmann, Thomas Kühne, Hossein Mirhosseini, Daniel Abou-Ras, and Harry Mönig. “Correlating Facet Orientation, Defect-Level Density and Dipole Layer Formation at the Surface of Polycrystalline CuInSe2 Thin Films.” <i>Acta Materialia</i> 200 (2020). <a href=\"https://doi.org/10.1016/j.actamat.2020.09.028\">https://doi.org/10.1016/j.actamat.2020.09.028</a>.","short":"A. Elizabeth, H. Conradi, S. K. Sahoo, T. Kodalle, C. A. Kaufmann, T. Kühne, H. Mirhosseini, D. Abou-Ras, H. Mönig, Acta Materialia 200 (2020).","apa":"Elizabeth, A., Conradi, H., K. Sahoo, S., Kodalle, T., A. Kaufmann, C., Kühne, T., … Mönig, H. (2020). Correlating facet orientation, defect-level density and dipole layer formation at the surface of polycrystalline CuInSe2 thin films. <i>Acta Materialia</i>, <i>200</i>. <a href=\"https://doi.org/10.1016/j.actamat.2020.09.028\">https://doi.org/10.1016/j.actamat.2020.09.028</a>","ieee":"A. Elizabeth <i>et al.</i>, “Correlating facet orientation, defect-level density and dipole layer formation at the surface of polycrystalline CuInSe2 thin films,” <i>Acta Materialia</i>, vol. 200, 2020."},"publication":"Acta Materialia","volume":200,"doi":"https://doi.org/10.1016/j.actamat.2020.09.028","user_id":"71692","language":[{"iso":"eng"}],"_id":"19823","intvolume":"       200","date_updated":"2022-01-06T06:54:13Z","publication_identifier":{"issn":["1359-6454"]},"author":[{"first_name":"Amala","last_name":"Elizabeth","full_name":"Elizabeth, Amala"},{"last_name":"Conradi","first_name":"Hauke","full_name":"Conradi, Hauke"},{"full_name":"K. Sahoo, Sudhir","last_name":"K. Sahoo","first_name":"Sudhir"},{"full_name":"Kodalle, Tim","first_name":"Tim","last_name":"Kodalle"},{"full_name":"A. Kaufmann, Christian","first_name":"Christian","last_name":"A. Kaufmann"},{"full_name":"Kühne, Thomas","last_name":"Kühne","first_name":"Thomas","id":"49079"},{"orcid":"https://orcid.org/0000-0001-6179-1545","first_name":"Hossein","last_name":"Mirhosseini","full_name":"Mirhosseini, Hossein","id":"71051"},{"last_name":"Abou-Ras","first_name":"Daniel","full_name":"Abou-Ras, Daniel"},{"last_name":"Mönig","first_name":"Harry","full_name":"Mönig, Harry"}],"status":"public","year":"2020","title":"Correlating facet orientation, defect-level density and dipole layer formation at the surface of polycrystalline CuInSe2 thin films"},{"status":"public","conference":{"name":"Twenty-Eigth European Conference on Information Systems (ECIS2020)","location":"Marrakesh, Morocco"},"has_accepted_license":"1","_id":"17055","user_id":"61579","ddc":["000"],"file_date_updated":"2021-08-13T14:04:55Z","citation":{"bibtex":"@inproceedings{Wagner_Empl_Schryen_2020, title={Designing a Novel Strategy for Exploring Literature Corpora}, booktitle={28th European Conference on Information Systems (ECIS 2020)}, author={Wagner, Gerit and Empl, Philipp and Schryen, Guido}, year={2020} }","short":"G. Wagner, P. Empl, G. Schryen, in: 28th European Conference on Information Systems (ECIS 2020), 2020.","ama":"Wagner G, Empl P, Schryen G. Designing a Novel Strategy for Exploring Literature Corpora. In: <i>28th European Conference on Information Systems (ECIS 2020)</i>. ; 2020.","chicago":"Wagner, Gerit, Philipp Empl, and Guido Schryen. “Designing a Novel Strategy for Exploring Literature Corpora.” In <i>28th European Conference on Information Systems (ECIS 2020)</i>, 2020.","ieee":"G. Wagner, P. Empl, and G. Schryen, “Designing a Novel Strategy for Exploring Literature Corpora,” in <i>28th European Conference on Information Systems (ECIS 2020)</i>, Marrakesh, Morocco, 2020.","apa":"Wagner, G., Empl, P., &#38; Schryen, G. (2020). Designing a Novel Strategy for Exploring Literature Corpora. In <i>28th European Conference on Information Systems (ECIS 2020)</i>. Marrakesh, Morocco.","mla":"Wagner, Gerit, et al. “Designing a Novel Strategy for Exploring Literature Corpora.” <i>28th European Conference on Information Systems (ECIS 2020)</i>, 2020."},"oa":"1","title":"Designing a Novel Strategy for Exploring Literature Corpora","year":"2020","author":[{"full_name":"Wagner, Gerit","first_name":"Gerit","last_name":"Wagner"},{"first_name":"Philipp","last_name":"Empl","full_name":"Empl, Philipp"},{"id":"72850","last_name":"Schryen","first_name":"Guido","full_name":"Schryen, Guido"}],"date_updated":"2022-01-06T06:53:03Z","language":[{"iso":"eng"}],"publication":"28th European Conference on Information Systems (ECIS 2020)","abstract":[{"text":"Understanding a new literature corpus can be a grueling experience for junior scholars. Nevertheless, corresponding guidelines have not been updated for decades. We contend that the traditional strategy of skimming all papers and reading selected papers afterwards needs to be revised. Therefore, we design a new strategy that guides the overall exploratory process by prioritizing influential papers for initial reading, followed by skimming the remaining papers. Consistent with schemata theory, starting with in-depth reading allows readers to acquire more substantial prior content schemata, which are representa-tive for the literature corpus and useful in the following skimming process. To this end, we develop a prototype that identifies the influential papers from a set of PDFs, which is illustrated in a case study in the IT business value domain. With the new strategy, we envision a more efficient process of exploring unknown literature corpora.","lang":"eng"}],"file":[{"file_name":"2020-03-27-ECIS2020 Designing a novel strategy for exploring literature corpora.pdf","file_size":590754,"access_level":"open_access","relation":"main_file","date_updated":"2021-08-13T14:04:55Z","file_id":"17056","content_type":"application/pdf","creator":"hsiemes","date_created":"2020-05-24T17:17:32Z"}],"date_created":"2020-05-24T15:23:32Z","type":"conference","keyword":["Reading and skimming","Exploring literature","Review methodology","Design science research","Schemata theory"],"department":[{"_id":"277"}]},{"_id":"33262","publisher":"World Scientific Pub Co Pte Ltd","user_id":"97359","volume":20,"status":"public","external_id":{"arxiv":["1906.02844"]},"citation":{"ieee":"E. Nijholt, B. Rink, and S. Schwenker, “A new algorithm for computing idempotents of ℛ-trivial monoids,” <i>Journal of Algebra and Its Applications</i>, vol. 20, no. 12, 2020, doi: <a href=\"https://doi.org/10.1142/s0219498821502273\">10.1142/s0219498821502273</a>.","apa":"Nijholt, E., Rink, B., &#38; Schwenker, S. (2020). A new algorithm for computing idempotents of ℛ-trivial monoids. <i>Journal of Algebra and Its Applications</i>, <i>20</i>(12). <a href=\"https://doi.org/10.1142/s0219498821502273\">https://doi.org/10.1142/s0219498821502273</a>","mla":"Nijholt, Eddie, et al. “A New Algorithm for Computing Idempotents of ℛ-Trivial Monoids.” <i>Journal of Algebra and Its Applications</i>, vol. 20, no. 12, World Scientific Pub Co Pte Ltd, 2020, doi:<a href=\"https://doi.org/10.1142/s0219498821502273\">10.1142/s0219498821502273</a>.","bibtex":"@article{Nijholt_Rink_Schwenker_2020, title={A new algorithm for computing idempotents of ℛ-trivial monoids}, volume={20}, DOI={<a href=\"https://doi.org/10.1142/s0219498821502273\">10.1142/s0219498821502273</a>}, number={12}, journal={Journal of Algebra and Its Applications}, publisher={World Scientific Pub Co Pte Ltd}, author={Nijholt, Eddie and Rink, Bob and Schwenker, Sören}, year={2020} }","chicago":"Nijholt, Eddie, Bob Rink, and Sören Schwenker. “A New Algorithm for Computing Idempotents of ℛ-Trivial Monoids.” <i>Journal of Algebra and Its Applications</i> 20, no. 12 (2020). <a href=\"https://doi.org/10.1142/s0219498821502273\">https://doi.org/10.1142/s0219498821502273</a>.","short":"E. Nijholt, B. Rink, S. Schwenker, Journal of Algebra and Its Applications 20 (2020).","ama":"Nijholt E, Rink B, Schwenker S. A new algorithm for computing idempotents of ℛ-trivial monoids. <i>Journal of Algebra and Its Applications</i>. 2020;20(12). doi:<a href=\"https://doi.org/10.1142/s0219498821502273\">10.1142/s0219498821502273</a>"},"language":[{"iso":"eng"}],"doi":"10.1142/s0219498821502273","title":"A new algorithm for computing idempotents of ℛ-trivial monoids","year":"2020","publication_identifier":{"issn":["0219-4988","1793-6829"]},"author":[{"full_name":"Nijholt, Eddie","first_name":"Eddie","last_name":"Nijholt"},{"last_name":"Rink","first_name":"Bob","full_name":"Rink, Bob"},{"orcid":"0000-0002-8054-2058","last_name":"Schwenker","first_name":"Sören","full_name":"Schwenker, Sören","id":"97359"}],"publication_status":"published","date_updated":"2022-09-07T08:35:24Z","intvolume":"        20","date_created":"2022-09-06T11:37:00Z","keyword":["Applied Mathematics","Algebra and Number Theory"],"type":"journal_article","publication":"Journal of Algebra and Its Applications","issue":"12","extern":"1","abstract":[{"lang":"eng","text":"The authors of Berg et al. [J. Algebra 348 (2011) 446–461] provide an algorithm for finding a complete system of primitive orthogonal idempotents for CM, where M is any finite R-trivial monoid. Their method relies on a technical result stating that R-trivial monoid are equivalent to so-called weakly ordered monoids. We provide an alternative algorithm, based only on the simple observation that an R-trivial monoid may be realized by upper triangular matrices. This approach is inspired by results in the field of coupled cell network dynamical systems, where L-trivial monoids (the opposite notion) correspond to so-called feed-forward networks. We first show that our algorithm works for ZM, after which we prove that it also works for RM where R is an arbitrary ring with a known complete system of primitive orthogonal idempotents. In particular, our algorithm works if R is any field. In this respect our result constitutes a considerable generalization of the results in Berg et al. [J. Algebra 348 (2011) 446–461]. Moreover, the system of idempotents for RM is obtained from the one our algorithm yields for ZM in a straightforward manner. In other words, for any finite R-trivial monoid M our algorithm only has to be performed for ZM, after which a system of idempotents follows for any ring with a given system of idempotents."}]},{"type":"journal_article","keyword":["Expertise","Schulpraktikum","Praxissemester","Theorie-Praxis-Verzahnung","Uneindeutigkeit im Unterricht / ambiguity","theory-practicerelation","expertise","internships"],"date_created":"2023-01-05T14:04:16Z","abstract":[{"lang":"ger","text":"Der Artikel beschreibt unter Berücksichtigung von fachdi-daktischen Überlegungen (Religionsdidaktik und Didaktik des Schulfaches Erziehungswissenschaft, letztere wird oftmals auch als Didaktik des Unterrichtsfaches Pädagogik  bezeichnet),  wie  durch  die  Thematisierung  studentischer  Erfahrungen in Praxisphasen begleitenden Veranstaltungen ein Beitrag zur Professionalisierung angehender Lehrkräfte geleistet werden könnte. Exemplarisch werden Vorgehensweisen aufgezeigt, wie Unterrichtserfahrungen angehender Lehrkräfte in solchen Unterrichtsfächern, die sich in Bezug auf Inhalte und Gegenstände des Unterrichts durch ein hohes Maß an Uneindeutigkeit auszeichnen, im Rahmen der universitären  Veranstaltungen  thematisiert  und  zu  Theorien  in  Beziehung  gesetzt  werden können. Der Begriff Uneindeutigkeit bezeichnet dabei das Spezifikum beider Fächer, dass Fragen thematisiert und Aufgaben bearbeitet werden, die sich nicht immer  eindeutig beantworten  oder  als  richtig  oder  falsch  bewerten  lassen.  Ziel  der Einbindung studentischer Praxiserfahrungen und von deren Reflexion ist es, dass angehende  Lehrkräfte  professionelle  Kompetenz  entwickeln  sowie  für  die  Komplexität und Uneindeutigkeit theologischer Rede bzw. theologischen und pädagogischen  Handelns  und  Wirkens  sensibilisiert  werden  und  gleichzeitig  erkunden, wie sie Kinder und Jugendlichen in der Schule einen verlässlichen Referenzrahmen für die Entwicklung einer reflektierten religiösen bzw.pädagogischen Kompetenz vermitteln können"},{"lang":"eng","text":"Taking  into  account  of  subject-didactic  considerations  (didactics  of religion and didactics of the discipline of educational science as a school subject), the article describes how the thematization of student experiences could contribute to the professionalization of prospective teachers. The aim is to show how teaching experience  of  prospective  teachers  in  subjects  which  are  characterized by  a  high degree of ambiguity can be put into a relationship with theories at university. The term  ambiguity  refers  to  the  specificity  of  both  subjectsthat  questions  are  addressed and tasks are dealt with whichcannot be answered clearly or be considered correct or incorrect. The aim of integrating student practical experience and its reflection  is  to  ensure  that  students  develop  professional  competence  and  raise awareness of the complexity and ambiguity of theological and pedagogical action and work, and at the same time, explore how they can provide children and adolescents at school with a reliable frame of reference for the development of a reflected religious or pedagogical combination."}],"issue":"2","publication":"Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion","doi":"10.4119/hlz-2500","alternative_title":["Zur Verschränkung studentischer Erfahrungenmit domänenspezifischen Theorien"],"language":[{"iso":"ger"}],"date_updated":"2023-01-06T12:04:53Z","publication_status":"published","intvolume":"         3","title":"Auf dem Weg zum Lehrberuf","year":"2020","publication_identifier":{"issn":["2625-0675"]},"author":[{"last_name":"Caruso","first_name":"Carina","full_name":"Caruso, Carina","id":"23123"},{"full_name":"Martin, Alexander","first_name":"Alexander","last_name":"Martin"},{"full_name":"Woppowa, Jan","first_name":"Jan","last_name":"Woppowa"}],"citation":{"apa":"Caruso, C., Martin, A., &#38; Woppowa, J. (2020). Auf dem Weg zum Lehrberuf. <i>Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion</i>, <i>3</i>(2), 60–74. <a href=\"https://doi.org/10.4119/hlz-2500\">https://doi.org/10.4119/hlz-2500</a>","ieee":"C. Caruso, A. Martin, and J. Woppowa, “Auf dem Weg zum Lehrberuf,” <i>Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion</i>, vol. 3, no. 2, pp. 60–74, 2020, doi: <a href=\"https://doi.org/10.4119/hlz-2500\">10.4119/hlz-2500</a>.","short":"C. Caruso, A. Martin, J. Woppowa, Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion 3 (2020) 60–74.","chicago":"Caruso, Carina, Alexander Martin, and Jan Woppowa. “Auf dem Weg zum Lehrberuf.” <i>Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion</i> 3, no. 2 (2020): 60–74. <a href=\"https://doi.org/10.4119/hlz-2500\">https://doi.org/10.4119/hlz-2500</a>.","mla":"Caruso, Carina, et al. “Auf dem Weg zum Lehrberuf.” <i>Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion</i>, vol. 3, no. 2, 2020, pp. 60–74, doi:<a href=\"https://doi.org/10.4119/hlz-2500\">10.4119/hlz-2500</a>.","ama":"Caruso C, Martin A, Woppowa J. Auf dem Weg zum Lehrberuf. <i>Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion</i>. 2020;3(2):60-74. doi:<a href=\"https://doi.org/10.4119/hlz-2500\">10.4119/hlz-2500</a>","bibtex":"@article{Caruso_Martin_Woppowa_2020, title={Auf dem Weg zum Lehrberuf}, volume={3}, DOI={<a href=\"https://doi.org/10.4119/hlz-2500\">10.4119/hlz-2500</a>}, number={2}, journal={Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion}, author={Caruso, Carina and Martin, Alexander and Woppowa, Jan}, year={2020}, pages={60–74} }"},"user_id":"86519","volume":3,"page":"60-74","_id":"35299","status":"public"},{"title":"The Strong Trotter Property for Locally μ-convex Lie Groups","year":"2020","author":[{"full_name":"Hanusch, Maximilian","first_name":"Maximilian","last_name":"Hanusch","id":"30905"}],"date_updated":"2023-01-09T18:07:37Z","publication_status":"published","intvolume":"        30","article_type":"original","language":[{"iso":"eng"}],"publication":"Journal of Lie Theory","issue":"1","extern":"1","date_created":"2022-12-22T09:41:22Z","keyword":["Lie theory","strong Trotter property"],"type":"journal_article","department":[{"_id":"93"}],"status":"public","page":"025-032","_id":"34830","publisher":"Heldermann Verlag","user_id":"30905","volume":30,"citation":{"bibtex":"@article{Hanusch_2020, title={The Strong Trotter Property for Locally μ-convex Lie Groups}, volume={30}, number={1}, journal={Journal of Lie Theory}, publisher={Heldermann Verlag}, author={Hanusch, Maximilian}, year={2020}, pages={025–032} }","ama":"Hanusch M. The Strong Trotter Property for Locally μ-convex Lie Groups. <i>Journal of Lie Theory</i>. 2020;30(1):025-032.","mla":"Hanusch, Maximilian. “The Strong Trotter Property for Locally μ-Convex Lie Groups.” <i>Journal of Lie Theory</i>, vol. 30, no. 1, Heldermann Verlag, 2020, pp. 025–32.","short":"M. Hanusch, Journal of Lie Theory 30 (2020) 025–032.","chicago":"Hanusch, Maximilian. “The Strong Trotter Property for Locally μ-Convex Lie Groups.” <i>Journal of Lie Theory</i> 30, no. 1 (2020): 025–032.","ieee":"M. Hanusch, “The Strong Trotter Property for Locally μ-convex Lie Groups,” <i>Journal of Lie Theory</i>, vol. 30, no. 1, pp. 025–032, 2020.","apa":"Hanusch, M. (2020). The Strong Trotter Property for Locally μ-convex Lie Groups. <i>Journal of Lie Theory</i>, <i>30</i>(1), 025–032."}},{"citation":{"apa":"Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2020). More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1277–1285. <a href=\"https://doi.org/10.1145/3377930.3390174\">https://doi.org/10.1145/3377930.3390174</a>","ieee":"J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 1277–1285, doi: <a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>.","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1277–1285.","chicago":"Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1277–1285. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390174\">https://doi.org/10.1145/3377930.3390174</a>.","mla":"Bossek, Jakob, et al. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 1277–1285, doi:<a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>.","ama":"Bossek J, Neumann F, Peng P, Sudholt D. More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:1277–1285. doi:<a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>","bibtex":"@inproceedings{Bossek_Neumann_Peng_Sudholt_2020, place={New York, NY, USA}, series={GECCO ’20}, title={More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2020}, pages={1277–1285}, collection={GECCO ’20} }"},"place":"New York, NY, USA","status":"public","user_id":"102979","page":"1277–1285","_id":"48847","publisher":"Association for Computing Machinery","extern":"1","abstract":[{"text":"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.","lang":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","type":"conference","keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:53Z","publication_status":"published","date_updated":"2023-12-13T10:43:41Z","year":"2020","title":"More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"author":[{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"},{"last_name":"Peng","first_name":"Pan","full_name":"Peng, Pan"},{"last_name":"Sudholt","first_name":"Dirk","full_name":"Sudholt, Dirk"}],"doi":"10.1145/3377930.3390174","series_title":"GECCO ’20","language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"author":[{"full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","id":"102979"},{"first_name":"Katrin","last_name":"Casel","full_name":"Casel, Katrin"},{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"}],"year":"2020","title":"The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics","publication_status":"published","date_updated":"2023-12-13T10:43:33Z","language":[{"iso":"eng"}],"series_title":"GECCO ’20","doi":"10.1145/3377930.3390243","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","extern":"1","abstract":[{"lang":"eng","text":"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."}],"date_created":"2023-11-14T15:58:53Z","department":[{"_id":"819"}],"keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"type":"conference","status":"public","publisher":"Association for Computing Machinery","_id":"48851","page":"1286–1294","user_id":"102979","citation":{"mla":"Bossek, Jakob, et al. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 1286–1294, doi:<a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>.","bibtex":"@inproceedings{Bossek_Casel_Kerschke_Neumann_2020, place={New York, NY, USA}, series={GECCO ’20}, title={The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Casel, Katrin and Kerschke, Pascal and Neumann, Frank}, year={2020}, pages={1286–1294}, collection={GECCO ’20} }","ama":"Bossek J, Casel K, Kerschke P, Neumann F. The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:1286–1294. doi:<a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>","ieee":"J. Bossek, K. Casel, P. Kerschke, and F. Neumann, “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 1286–1294, doi: <a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>.","apa":"Bossek, J., Casel, K., Kerschke, P., &#38; Neumann, F. (2020). The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1286–1294. <a href=\"https://doi.org/10.1145/3377930.3390243\">https://doi.org/10.1145/3377930.3390243</a>","chicago":"Bossek, Jakob, Katrin Casel, Pascal Kerschke, and Frank Neumann. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1286–1294. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390243\">https://doi.org/10.1145/3377930.3390243</a>.","short":"J. Bossek, K. Casel, P. Kerschke, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1286–1294."},"place":"New York, NY, USA"},{"status":"public","page":"995-1038","publisher":"American Mathematical Society (AMS)","_id":"45955","user_id":"100441","volume":90,"citation":{"apa":"Akrivis, G., Feischl, M., Kovács, B., &#38; Lubich, C. (2020). Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation. <i>Mathematics of Computation</i>, <i>90</i>(329), 995–1038. <a href=\"https://doi.org/10.1090/mcom/3597\">https://doi.org/10.1090/mcom/3597</a>","ieee":"G. Akrivis, M. Feischl, B. Kovács, and C. Lubich, “Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation,” <i>Mathematics of Computation</i>, vol. 90, no. 329, pp. 995–1038, 2020, doi: <a href=\"https://doi.org/10.1090/mcom/3597\">10.1090/mcom/3597</a>.","chicago":"Akrivis, Georgios, Michael Feischl, Balázs Kovács, and Christian Lubich. “Higher-Order Linearly Implicit Full Discretization of the Landau–Lifshitz–Gilbert Equation.” <i>Mathematics of Computation</i> 90, no. 329 (2020): 995–1038. <a href=\"https://doi.org/10.1090/mcom/3597\">https://doi.org/10.1090/mcom/3597</a>.","short":"G. Akrivis, M. Feischl, B. Kovács, C. Lubich, Mathematics of Computation 90 (2020) 995–1038.","mla":"Akrivis, Georgios, et al. “Higher-Order Linearly Implicit Full Discretization of the Landau–Lifshitz–Gilbert Equation.” <i>Mathematics of Computation</i>, vol. 90, no. 329, American Mathematical Society (AMS), 2020, pp. 995–1038, doi:<a href=\"https://doi.org/10.1090/mcom/3597\">10.1090/mcom/3597</a>.","ama":"Akrivis G, Feischl M, Kovács B, Lubich C. Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation. <i>Mathematics of Computation</i>. 2020;90(329):995-1038. doi:<a href=\"https://doi.org/10.1090/mcom/3597\">10.1090/mcom/3597</a>","bibtex":"@article{Akrivis_Feischl_Kovács_Lubich_2020, title={Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation}, volume={90}, DOI={<a href=\"https://doi.org/10.1090/mcom/3597\">10.1090/mcom/3597</a>}, number={329}, journal={Mathematics of Computation}, publisher={American Mathematical Society (AMS)}, author={Akrivis, Georgios and Feischl, Michael and Kovács, Balázs and Lubich, Christian}, year={2020}, pages={995–1038} }"},"year":"2020","title":"Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation","publication_identifier":{"issn":["0025-5718","1088-6842"]},"author":[{"full_name":"Akrivis, Georgios","last_name":"Akrivis","first_name":"Georgios"},{"full_name":"Feischl, Michael","first_name":"Michael","last_name":"Feischl"},{"orcid":"0000-0001-9872-3474","last_name":"Kovács","first_name":"Balázs","full_name":"Kovács, Balázs","id":"100441"},{"full_name":"Lubich, Christian","first_name":"Christian","last_name":"Lubich"}],"date_updated":"2024-04-03T09:20:36Z","publication_status":"published","intvolume":"        90","language":[{"iso":"eng"}],"doi":"10.1090/mcom/3597","publication":"Mathematics of Computation","issue":"329","date_created":"2023-07-10T11:42:57Z","keyword":["Applied Mathematics","Computational Mathematics","Algebra and Number Theory"],"type":"journal_article","department":[{"_id":"841"}]},{"abstract":[{"lang":"eng","text":"Let D<0 be a fundamental discriminant and denote by E(D) the exponent of the ideal class group Cl(D) of K=ℚ(√D). Under the assumption that no Siegel zeros exist we compute all such D with E(D) dividing 8. We compute all D with |D| ≤ 3.1⋅10²⁰ such that E(D) ≤ 8."}],"issue":"3","publication":"Acta Arithmetica","department":[{"_id":"102"}],"type":"journal_article","keyword":["Algebra and Number Theory"],"date_created":"2022-12-22T10:51:13Z","intvolume":"       193","date_updated":"2023-03-06T10:19:53Z","publication_status":"published","publication_identifier":{"issn":["0065-1036","1730-6264"]},"author":[{"full_name":"Elsenhans, Andreas-Stephan","last_name":"Elsenhans","first_name":"Andreas-Stephan"},{"last_name":"Klüners","first_name":"Jürgen","full_name":"Klüners, Jürgen","id":"21202"},{"full_name":"Nicolae, Florin","last_name":"Nicolae","first_name":"Florin"}],"title":"Imaginary quadratic number fields with class groups of small exponent","year":"2020","doi":"10.4064/aa180220-20-3","language":[{"iso":"eng"}],"citation":{"ieee":"A.-S. Elsenhans, J. Klüners, and F. Nicolae, “Imaginary quadratic number fields with class groups of small exponent,” <i>Acta Arithmetica</i>, vol. 193, no. 3, pp. 217–233, 2020, doi: <a href=\"https://doi.org/10.4064/aa180220-20-3\">10.4064/aa180220-20-3</a>.","apa":"Elsenhans, A.-S., Klüners, J., &#38; Nicolae, F. (2020). Imaginary quadratic number fields with class groups of small exponent. <i>Acta Arithmetica</i>, <i>193</i>(3), 217–233. <a href=\"https://doi.org/10.4064/aa180220-20-3\">https://doi.org/10.4064/aa180220-20-3</a>","chicago":"Elsenhans, Andreas-Stephan, Jürgen Klüners, and Florin Nicolae. “Imaginary Quadratic Number Fields with Class Groups of Small Exponent.” <i>Acta Arithmetica</i> 193, no. 3 (2020): 217–33. <a href=\"https://doi.org/10.4064/aa180220-20-3\">https://doi.org/10.4064/aa180220-20-3</a>.","short":"A.-S. Elsenhans, J. Klüners, F. Nicolae, Acta Arithmetica 193 (2020) 217–233.","mla":"Elsenhans, Andreas-Stephan, et al. “Imaginary Quadratic Number Fields with Class Groups of Small Exponent.” <i>Acta Arithmetica</i>, vol. 193, no. 3, Institute of Mathematics, Polish Academy of Sciences, 2020, pp. 217–33, doi:<a href=\"https://doi.org/10.4064/aa180220-20-3\">10.4064/aa180220-20-3</a>.","bibtex":"@article{Elsenhans_Klüners_Nicolae_2020, title={Imaginary quadratic number fields with class groups of small exponent}, volume={193}, DOI={<a href=\"https://doi.org/10.4064/aa180220-20-3\">10.4064/aa180220-20-3</a>}, number={3}, journal={Acta Arithmetica}, publisher={Institute of Mathematics, Polish Academy of Sciences}, author={Elsenhans, Andreas-Stephan and Klüners, Jürgen and Nicolae, Florin}, year={2020}, pages={217–233} }","ama":"Elsenhans A-S, Klüners J, Nicolae F. Imaginary quadratic number fields with class groups of small exponent. <i>Acta Arithmetica</i>. 2020;193(3):217-233. doi:<a href=\"https://doi.org/10.4064/aa180220-20-3\">10.4064/aa180220-20-3</a>"},"external_id":{"arxiv":["1803.02056 "]},"status":"public","volume":193,"user_id":"93826","publisher":"Institute of Mathematics, Polish Academy of Sciences","_id":"34842","page":"217-233"},{"date_updated":"2024-11-11T11:59:12Z","author":[{"id":"16274","last_name":"Biehler","first_name":"Rolf","full_name":"Biehler, Rolf"},{"first_name":"Viviane","last_name":"Durand-Guerrier","full_name":"Durand-Guerrier, Viviane"}],"title":"University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic","year":"2020","language":[{"iso":"eng"}],"main_file_link":[{"url":"⟨hal-03114041⟩"}],"related_material":{"link":[{"relation":"confirmation","url":"https://hal.science/hal-03114041/"}]},"publication":"Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)","department":[{"_id":"363"}],"keyword":["Number Theory","Algebra","Discrete Mathematics","Logic","Research in University Mathematics Edcuation"],"type":"book_chapter","date_created":"2023-01-10T11:14:02Z","file":[{"file_id":"56978","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2024-11-11T11:58:37Z","file_name":"Biehler_INDRUM2020_283-287.pdf","access_level":"closed","file_size":576039,"date_created":"2024-11-11T11:58:37Z","creator":"krueter"}],"has_accepted_license":"1","status":"public","editor":[{"last_name":"Hausberger","first_name":"T.","full_name":"Hausberger, T."},{"first_name":"M.","last_name":"Bosch","full_name":"Bosch, M."},{"last_name":"Chelloughi","first_name":"F.","full_name":"Chelloughi, F."}],"ddc":["510"],"user_id":"37888","_id":"35811","publisher":"University of Carthage and INDRUM","page":"283-287","citation":{"chicago":"Biehler, Rolf, and Viviane Durand-Guerrier. “University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic.” In <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i>, edited by T. Hausberger, M. Bosch, and F. Chelloughi, 283–87. Bizerte, Tunisia: University of Carthage and INDRUM, 2020.","short":"R. Biehler, V. Durand-Guerrier, in: T. Hausberger, M. Bosch, F. Chelloughi (Eds.), Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020), University of Carthage and INDRUM, Bizerte, Tunisia, 2020, pp. 283–287.","apa":"Biehler, R., &#38; Durand-Guerrier, V. (2020). University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic. In T. Hausberger, M. Bosch, &#38; F. Chelloughi (Eds.), <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i> (pp. 283–287). University of Carthage and INDRUM.","ieee":"R. Biehler and V. Durand-Guerrier, “University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic,” in <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i>, T. Hausberger, M. Bosch, and F. Chelloughi, Eds. Bizerte, Tunisia: University of Carthage and INDRUM, 2020, pp. 283–287.","ama":"Biehler R, Durand-Guerrier V. University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic. In: Hausberger T, Bosch M, Chelloughi F, eds. <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i>. University of Carthage and INDRUM; 2020:283-287.","bibtex":"@inbook{Biehler_Durand-Guerrier_2020, place={Bizerte, Tunisia}, title={University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic}, booktitle={Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)}, publisher={University of Carthage and INDRUM}, author={Biehler, Rolf and Durand-Guerrier, Viviane}, editor={Hausberger, T. and Bosch, M. and Chelloughi, F.}, year={2020}, pages={283–287} }","mla":"Biehler, Rolf, and Viviane Durand-Guerrier. “University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic.” <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i>, edited by T. Hausberger et al., University of Carthage and INDRUM, 2020, pp. 283–87."},"file_date_updated":"2024-11-11T11:58:37Z","place":"Bizerte, Tunisia"},{"department":[{"_id":"102"}],"keyword":["Algebra and Number Theory"],"type":"journal_article","date_created":"2022-12-22T10:50:03Z","abstract":[{"lang":"eng","text":"We give an exact formula for the number of G-extensions of local function fields Fq((t)) for finite abelian groups G up to a conductor bound. As an application we give a lower bound for the corresponding counting problem by discriminant.\r\n"}],"publication":"Journal of Number Theory","doi":"10.1016/j.jnt.2019.11.007","language":[{"iso":"eng"}],"intvolume":"       212","publication_status":"published","date_updated":"2025-06-13T08:18:30Z","publication_identifier":{"issn":["0022-314X"]},"author":[{"id":"21202","last_name":"Klüners","first_name":"Jürgen","full_name":"Klüners, Jürgen"},{"first_name":"Raphael","last_name":"Müller","full_name":"Müller, Raphael"}],"title":"The conductor density of local function fields with abelian Galois group","year":"2020","external_id":{"arxiv":["1904.02573 "]},"citation":{"chicago":"Klüners, Jürgen, and Raphael Müller. “The Conductor Density of Local Function Fields with Abelian Galois Group.” <i>Journal of Number Theory</i> 212 (2020): 311–22. <a href=\"https://doi.org/10.1016/j.jnt.2019.11.007\">https://doi.org/10.1016/j.jnt.2019.11.007</a>.","short":"J. Klüners, R. Müller, Journal of Number Theory 212 (2020) 311–322.","apa":"Klüners, J., &#38; Müller, R. (2020). The conductor density of local function fields with abelian Galois group. <i>Journal of Number Theory</i>, <i>212</i>, 311–322. <a href=\"https://doi.org/10.1016/j.jnt.2019.11.007\">https://doi.org/10.1016/j.jnt.2019.11.007</a>","ieee":"J. Klüners and R. Müller, “The conductor density of local function fields with abelian Galois group,” <i>Journal of Number Theory</i>, vol. 212, pp. 311–322, 2020, doi: <a href=\"https://doi.org/10.1016/j.jnt.2019.11.007\">10.1016/j.jnt.2019.11.007</a>.","ama":"Klüners J, Müller R. The conductor density of local function fields with abelian Galois group. <i>Journal of Number Theory</i>. 2020;212:311-322. doi:<a href=\"https://doi.org/10.1016/j.jnt.2019.11.007\">10.1016/j.jnt.2019.11.007</a>","bibtex":"@article{Klüners_Müller_2020, title={The conductor density of local function fields with abelian Galois group}, volume={212}, DOI={<a href=\"https://doi.org/10.1016/j.jnt.2019.11.007\">10.1016/j.jnt.2019.11.007</a>}, journal={Journal of Number Theory}, publisher={Elsevier BV}, author={Klüners, Jürgen and Müller, Raphael}, year={2020}, pages={311–322} }","mla":"Klüners, Jürgen, and Raphael Müller. “The Conductor Density of Local Function Fields with Abelian Galois Group.” <i>Journal of Number Theory</i>, vol. 212, Elsevier BV, 2020, pp. 311–22, doi:<a href=\"https://doi.org/10.1016/j.jnt.2019.11.007\">10.1016/j.jnt.2019.11.007</a>."},"volume":212,"user_id":"82981","_id":"34841","publisher":"Elsevier BV","page":"311-322","status":"public"},{"citation":{"ieee":"V. Wolf and D. Beverungen, “Conceptualizing the Impact of Workarounds – An Organizational Routines’ Perspective,” in <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>, Stockholm-Uppsala, Sweden, 2019.","mla":"Wolf, Verena, and Daniel Beverungen. “Conceptualizing the Impact of Workarounds – An Organizational Routines’ Perspective.” <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>, 2019.","apa":"Wolf, V., &#38; Beverungen, D. (2019). Conceptualizing the Impact of Workarounds – An Organizational Routines’ Perspective. In <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>. Stockholm-Uppsala, Sweden.","bibtex":"@inproceedings{Wolf_Beverungen_2019, place={Stockholm-Uppsala, Sweden}, title={Conceptualizing the Impact of Workarounds – An Organizational Routines’ Perspective}, booktitle={Proceedings of the 27th European Conference on Information Systems (ECIS)}, author={Wolf, Verena and Beverungen, Daniel}, year={2019} }","ama":"Wolf V, Beverungen D. Conceptualizing the Impact of Workarounds – An Organizational Routines’ Perspective. In: <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>. Stockholm-Uppsala, Sweden; 2019.","short":"V. Wolf, D. Beverungen, in: Proceedings of the 27th European Conference on Information Systems (ECIS), Stockholm-Uppsala, Sweden, 2019.","chicago":"Wolf, Verena, and Daniel Beverungen. “Conceptualizing the Impact of Workarounds – An Organizational Routines’ Perspective.” In <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>. Stockholm-Uppsala, Sweden, 2019."},"publication":"Proceedings of the 27th European Conference on Information Systems (ECIS)","abstract":[{"lang":"eng","text":"Employees’ acceptance and resistance of new technology and social structure are frequently examined in Information Systems research. Resistance is expressed in various forms, including a lack of cooperation, workarounds, and physical sabotage. Workarounds, in particular, have a dual nature and can refer to both, undesirable behavior that contradicts organizational struc-ture and to desired organizational innovation. While antecedents and different forms of worka-rounds have been explored, literature has remained silent on how and why workarounds of an individual employee can affect activities performed by other employees and thereby, change work routines on an organizational level. Since employees’ day-to-day performances constitute the ostensive patterns of a routine, we argue that workarounds will not only impact performanc-es of adjacent routines, but also transform the organization as a social structure. With a prelim-inary set of qualitative data from 24 interviews, we used a multiple case study design to concep-tualize six patterns that illustrate how and why workarounds can spread through an organiza-tion. The patterns are systematized by a framework that considers three types of collaboration and two types of handoffs across routines. This first evidence points at the nature of complex desired and undesired consequences that can emerge through workarounds performed in an organization."}],"place":"Stockholm-Uppsala, Sweden","date_created":"2019-05-07T14:11:29Z","type":"conference","keyword":["Resistance","Workaround","Organizational Routines","Structuration Theory"],"conference":{"end_date":"2019-06-14","location":"Stockholm-Uppsala, Sweden","name":"27th European Conference on Information Systems","start_date":"2019-06-10"},"author":[{"id":"23633","first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"},{"full_name":"Beverungen, Daniel","first_name":"Daniel","last_name":"Beverungen","id":"59677"}],"year":"2019","title":"Conceptualizing the Impact of Workarounds – An Organizational Routines’ Perspective","status":"public","date_updated":"2022-01-06T07:04:18Z","language":[{"iso":"eng"}],"_id":"9676","user_id":"23633"},{"status":"public","volume":20,"user_id":"71692","_id":"13225","page":"1-6","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"citation":{"apa":"Clark, T., Heske, J. J., &#38; Kühne, T. (2019). Opposing Electronic and Nuclear Quantum Effects on Hydrogen Bonds in H2O and D2O. <i>ChemPhysChem</i>, <i>20</i>(0), 1–6. <a href=\"https://doi.org/10.1002/cphc.201900839\">https://doi.org/10.1002/cphc.201900839</a>","ieee":"T. Clark, J. J. Heske, and T. Kühne, “Opposing Electronic and Nuclear Quantum Effects on Hydrogen Bonds in H2O and D2O,” <i>ChemPhysChem</i>, vol. 20, no. 0, pp. 1–6, 2019.","short":"T. Clark, J.J. Heske, T. Kühne, ChemPhysChem 20 (2019) 1–6.","chicago":"Clark, Timothy, Julian Joachim Heske, and Thomas Kühne. “Opposing Electronic and Nuclear Quantum Effects on Hydrogen Bonds in H2O and D2O.” <i>ChemPhysChem</i> 20, no. 0 (2019): 1–6. <a href=\"https://doi.org/10.1002/cphc.201900839\">https://doi.org/10.1002/cphc.201900839</a>.","mla":"Clark, Timothy, et al. “Opposing Electronic and Nuclear Quantum Effects on Hydrogen Bonds in H2O and D2O.” <i>ChemPhysChem</i>, vol. 20, no. 0, 2019, pp. 1–6, doi:<a href=\"https://doi.org/10.1002/cphc.201900839\">10.1002/cphc.201900839</a>.","ama":"Clark T, Heske JJ, Kühne T. Opposing Electronic and Nuclear Quantum Effects on Hydrogen Bonds in H2O and D2O. <i>ChemPhysChem</i>. 2019;20(0):1-6. doi:<a href=\"https://doi.org/10.1002/cphc.201900839\">10.1002/cphc.201900839</a>","bibtex":"@article{Clark_Heske_Kühne_2019, title={Opposing Electronic and Nuclear Quantum Effects on Hydrogen Bonds in H2O and D2O}, volume={20}, DOI={<a href=\"https://doi.org/10.1002/cphc.201900839\">10.1002/cphc.201900839</a>}, number={0}, journal={ChemPhysChem}, author={Clark, Timothy and Heske, Julian Joachim and Kühne, Thomas}, year={2019}, pages={1–6} }"},"intvolume":"        20","publication_status":"published","date_updated":"2022-01-06T06:51:31Z","author":[{"full_name":"Clark, Timothy","last_name":"Clark","first_name":"Timothy"},{"full_name":"Heske, Julian Joachim","first_name":"Julian Joachim","last_name":"Heske","id":"53238"},{"id":"49079","full_name":"Kühne, Thomas","last_name":"Kühne","first_name":"Thomas"}],"year":"2019","title":"Opposing Electronic and Nuclear Quantum Effects on Hydrogen Bonds in H2O and D2O","doi":"10.1002/cphc.201900839","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Abstract The effect of extending the O−H bond length(s) in water on the hydrogen-bonding strength has been investigated using static ab initio molecular orbital calculations. The “polar flattening” effect that causes a slight σ-hole to form on hydrogen atoms is strengthened when the bond is stretched, so that the σ-hole becomes more positive and hydrogen bonding stronger. In opposition to this electronic effect, path-integral ab initio molecular-dynamics simulations show that the nuclear quantum effect weakens the hydrogen bond in the water dimer. Thus, static electronic effects strengthen the hydrogen bond in H2O relative to D2O, whereas nuclear quantum effects weaken it. These quantum fluctuations are stronger for the water dimer than in bulk water."}],"issue":"0","publication":"ChemPhysChem","department":[{"_id":"304"}],"type":"journal_article","keyword":["ab initio calculations","bond theory","hydrogen bonds","isotope effects","solvent effects"],"date_created":"2019-09-13T13:41:57Z"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:37Z","author":[{"id":"53445","last_name":"Heinzel","first_name":"Joachim Maria Josef","full_name":"Heinzel, Joachim Maria Josef"}],"title":"Bundling in a Distribution Channel with Retail Competition","year":"2019","department":[{"_id":"280"},{"_id":"475"}],"keyword":["retail bundling","leverage theory","double marginalization"],"type":"report","date_created":"2019-06-28T08:42:49Z","file":[{"date_created":"2019-06-28T08:44:52Z","creator":"jheinzel","content_type":"application/pdf","success":1,"file_id":"10333","file_size":375054,"access_level":"closed","file_name":"WP120.pdf","date_updated":"2019-06-28T08:44:52Z","relation":"main_file"}],"abstract":[{"text":"We analyze the incentives for retail bundling and the welfare effects of retail bundling in a decentralized distribution channel with two retailers and two monopolistic manufacturers. One manufacturer exclusively sells his good to one retailer, whereas the other manufacturer sells his good to both retailers. Thus, one retailer is a monopolist for one product but competes with the other retailer in the second product market. The two-product retailer has the option to bundle his goods or to sell them separately. We find that bundling aggravates the double marginalization problem for the bundling retailer. Nevertheless, when the retailers compete in prices, bundling can be more profitable than separate selling for the retailer as bundling softens the retail competition. The ultimate outcome depends on the manufacturers’ marginal costs. Given retail quantity competition, however, bundling is in no case the retailer’s best strategy. Furthermore, we show that profitable bundling reduces consumer and producer surplus in the equilibrium.","lang":"eng"}],"user_id":"53445","ddc":["330"],"_id":"10332","publisher":"CIE Working Paper Series","has_accepted_license":"1","status":"public","place":"Paderborn University","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"citation":{"chicago":"Heinzel, Joachim Maria Josef. <i>Bundling in a Distribution Channel with Retail Competition</i>. Paderborn University: CIE Working Paper Series, 2019.","short":"J.M.J. Heinzel, Bundling in a Distribution Channel with Retail Competition, CIE Working Paper Series, Paderborn University, 2019.","ieee":"J. M. J. Heinzel, <i>Bundling in a Distribution Channel with Retail Competition</i>. Paderborn University: CIE Working Paper Series, 2019.","apa":"Heinzel, J. M. J. (2019). <i>Bundling in a Distribution Channel with Retail Competition</i>. Paderborn University: CIE Working Paper Series.","bibtex":"@book{Heinzel_2019, place={Paderborn University}, title={Bundling in a Distribution Channel with Retail Competition}, publisher={CIE Working Paper Series}, author={Heinzel, Joachim Maria Josef}, year={2019} }","ama":"Heinzel JMJ. <i>Bundling in a Distribution Channel with Retail Competition</i>. Paderborn University: CIE Working Paper Series; 2019.","mla":"Heinzel, Joachim Maria Josef. <i>Bundling in a Distribution Channel with Retail Competition</i>. CIE Working Paper Series, 2019."},"file_date_updated":"2019-06-28T08:44:52Z"},{"abstract":[{"lang":"eng","text":"We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of (V,q). This yields a good algorithm to enumerate a system of representatives of proper isometry classes of lattices in genera of maximal lattices in (V,q)."}],"issue":"02","publication":"International Journal of Number Theory","type":"journal_article","keyword":["Algebra and Number Theory"],"department":[{"_id":"102"}],"date_created":"2022-12-23T11:05:09Z","publication_status":"published","date_updated":"2023-12-06T10:05:59Z","intvolume":"        15","title":"Quaternary quadratic lattices over number fields","year":"2019","author":[{"id":"82258","full_name":"Kirschmer, Markus","first_name":"Markus","last_name":"Kirschmer"},{"last_name":"Nebe","first_name":"Gabriele","full_name":"Nebe, Gabriele"}],"publication_identifier":{"issn":["1793-0421","1793-7310"]},"doi":"10.1142/s1793042119500131","language":[{"iso":"eng"}],"citation":{"apa":"Kirschmer, M., &#38; Nebe, G. (2019). Quaternary quadratic lattices over number fields. <i>International Journal of Number Theory</i>, <i>15</i>(02), 309–325. <a href=\"https://doi.org/10.1142/s1793042119500131\">https://doi.org/10.1142/s1793042119500131</a>","mla":"Kirschmer, Markus, and Gabriele Nebe. “Quaternary Quadratic Lattices over Number Fields.” <i>International Journal of Number Theory</i>, vol. 15, no. 02, World Scientific Pub Co Pte Lt, 2019, pp. 309–25, doi:<a href=\"https://doi.org/10.1142/s1793042119500131\">10.1142/s1793042119500131</a>.","ieee":"M. Kirschmer and G. Nebe, “Quaternary quadratic lattices over number fields,” <i>International Journal of Number Theory</i>, vol. 15, no. 02, pp. 309–325, 2019, doi: <a href=\"https://doi.org/10.1142/s1793042119500131\">10.1142/s1793042119500131</a>.","chicago":"Kirschmer, Markus, and Gabriele Nebe. “Quaternary Quadratic Lattices over Number Fields.” <i>International Journal of Number Theory</i> 15, no. 02 (2019): 309–25. <a href=\"https://doi.org/10.1142/s1793042119500131\">https://doi.org/10.1142/s1793042119500131</a>.","short":"M. Kirschmer, G. Nebe, International Journal of Number Theory 15 (2019) 309–325.","ama":"Kirschmer M, Nebe G. Quaternary quadratic lattices over number fields. <i>International Journal of Number Theory</i>. 2019;15(02):309-325. doi:<a href=\"https://doi.org/10.1142/s1793042119500131\">10.1142/s1793042119500131</a>","bibtex":"@article{Kirschmer_Nebe_2019, title={Quaternary quadratic lattices over number fields}, volume={15}, DOI={<a href=\"https://doi.org/10.1142/s1793042119500131\">10.1142/s1793042119500131</a>}, number={02}, journal={International Journal of Number Theory}, publisher={World Scientific Pub Co Pte Lt}, author={Kirschmer, Markus and Nebe, Gabriele}, year={2019}, pages={309–325} }"},"status":"public","user_id":"82258","volume":15,"page":"309-325","_id":"34917","publisher":"World Scientific Pub Co Pte Lt"},{"publication":"Journal of Number Theory","abstract":[{"lang":"eng","text":"We describe the powers of irreducible polynomials occurring as characteristic polynomials of automorphisms of even unimodular lattices over number fields. This generalizes results of Gross & McMullen and Bayer-Fluckiger & Taelman."}],"date_created":"2022-12-23T11:04:34Z","type":"journal_article","keyword":["Algebra and Number Theory"],"department":[{"_id":"102"}],"year":"2019","title":"Automorphisms of even unimodular lattices over number fields","publication_identifier":{"issn":["0022-314X"]},"author":[{"first_name":"Markus","last_name":"Kirschmer","full_name":"Kirschmer, Markus","id":"82258"}],"date_updated":"2023-12-06T10:07:17Z","publication_status":"published","intvolume":"       197","language":[{"iso":"eng"}],"doi":"10.1016/j.jnt.2018.08.004","citation":{"short":"M. Kirschmer, Journal of Number Theory 197 (2019) 121–134.","chicago":"Kirschmer, Markus. “Automorphisms of Even Unimodular Lattices over Number Fields.” <i>Journal of Number Theory</i> 197 (2019): 121–34. <a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">https://doi.org/10.1016/j.jnt.2018.08.004</a>.","ieee":"M. Kirschmer, “Automorphisms of even unimodular lattices over number fields,” <i>Journal of Number Theory</i>, vol. 197, pp. 121–134, 2019, doi: <a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">10.1016/j.jnt.2018.08.004</a>.","apa":"Kirschmer, M. (2019). Automorphisms of even unimodular lattices over number fields. <i>Journal of Number Theory</i>, <i>197</i>, 121–134. <a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">https://doi.org/10.1016/j.jnt.2018.08.004</a>","bibtex":"@article{Kirschmer_2019, title={Automorphisms of even unimodular lattices over number fields}, volume={197}, DOI={<a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">10.1016/j.jnt.2018.08.004</a>}, journal={Journal of Number Theory}, publisher={Elsevier BV}, author={Kirschmer, Markus}, year={2019}, pages={121–134} }","ama":"Kirschmer M. Automorphisms of even unimodular lattices over number fields. <i>Journal of Number Theory</i>. 2019;197:121-134. doi:<a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">10.1016/j.jnt.2018.08.004</a>","mla":"Kirschmer, Markus. “Automorphisms of Even Unimodular Lattices over Number Fields.” <i>Journal of Number Theory</i>, vol. 197, Elsevier BV, 2019, pp. 121–34, doi:<a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">10.1016/j.jnt.2018.08.004</a>."},"status":"public","page":"121-134","_id":"34916","publisher":"Elsevier BV","user_id":"82258","volume":197},{"date_updated":"2023-12-13T10:42:37Z","publication_status":"published","title":"Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring","year":"2019","author":[{"id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","first_name":"Jakob","last_name":"Bossek"},{"last_name":"Neumann","first_name":"Frank","full_name":"Neumann, Frank"},{"last_name":"Peng","first_name":"Pan","full_name":"Peng, Pan"},{"first_name":"Dirk","last_name":"Sudholt","full_name":"Sudholt, Dirk"}],"publication_identifier":{"isbn":["978-1-4503-6111-8"]},"doi":"10.1145/3321707.3321792","series_title":"GECCO ’19","language":[{"iso":"eng"}],"abstract":[{"text":"We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. This includes the (1+1) EA and RLS in a setting where the number of colors is bounded and we are minimizing the number of conflicts as well as iterated local search algorithms that use an unbounded color palette and aim to use the smallest colors and - as a consequence - the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i. e. starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. Furthermore, we show how to speed up computations by using problem specific operators concentrating on parts of the graph where changes have occurred.","lang":"eng"}],"extern":"1","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","type":"conference","keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:52Z","status":"public","user_id":"102979","page":"1443–1451","_id":"48843","publisher":"Association for Computing Machinery","citation":{"ama":"Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’19. Association for Computing Machinery; 2019:1443–1451. doi:<a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>","bibtex":"@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA}, series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring}, DOI={<a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2019}, pages={1443–1451}, collection={GECCO ’19} }","mla":"Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2019, pp. 1443–1451, doi:<a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>.","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 1443–1451.","chicago":"Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1443–1451. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3321707.3321792\">https://doi.org/10.1145/3321707.3321792</a>.","apa":"Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2019). Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1443–1451. <a href=\"https://doi.org/10.1145/3321707.3321792\">https://doi.org/10.1145/3321707.3321792</a>","ieee":"J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2019, pp. 1443–1451, doi: <a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>."},"place":"New York, NY, USA"},{"language":[{"iso":"rus"}],"doi":"10.22394/0869-5377-2019-1-53-80","author":[{"id":"98454","full_name":"Klowait, Nils","orcid":"0000-0002-7347-099X","last_name":"Klowait","first_name":"Nils"},{"full_name":"Erofeeva, Maria","last_name":"Erofeeva","first_name":"Maria"}],"publication_identifier":{"issn":["2499-9628","0869-5377"]},"title":"Work in the Age of Intelligent Machines: The Rise of Invisible Automation","year":"2019","intvolume":"        29","publication_status":"published","date_updated":"2023-08-30T19:33:13Z","date_created":"2023-03-02T15:43:30Z","type":"journal_article","keyword":["Literature and Literary Theory","Philosophy","Cultural Studies"],"issue":"1","publication":"Philosophical Literary Journal Logos","extern":"1","abstract":[{"lang":"eng","text":"<jats:p>The article analyzes how an emerging form of automation may drastically transform contemporary employment dynamics. Recent breakthroughs in the field of artificial intelligence (AI) make it possible to automate both manual and mental non-standard tasks. The first part of the article traces the development of AI. Whereas classical algorithms required the creation of a hermetic environment for AI to thrive, modern neural network-based AI is capable of surviving in the chaotic realm occupied by humans. Based on an analysis of changes in the nature of AI, the authors distinguish between substitutive and supplemental automation. The former refers to a complete replacement of humans by machines, while the latter indicates a selective substitution of humans in specific professional functions. In order to conceptualize professions as a nexus of automatable components, the authors employ Goffman’s dramaturgical framework. Goffman studied the social visibility of professional activity. Goffman held that any profession can be divided into invisible routines that are fundamental to it and a dramatization that makes the profession socially visible. The article demonstrates that the current utopian and antiutopian views of automation both reduce work to its visible components and neglect the logic of supplemental automation. The authors argue that the targets of modern automation are not the socially visible components but the invisible routines. In the final section, the authors develop a model that takes these invisible professional routines into account and analyze what effect this new type of automation may have on different types of professions with differing degrees of social visibility.</jats:p>"}],"_id":"42673","publisher":"The Russian Presidential Academy of National Economy and Public Administration","page":"53-84","volume":29,"user_id":"98454","status":"public","citation":{"ama":"Klowait N, Erofeeva M. Work in the Age of Intelligent Machines: The Rise of Invisible Automation. <i>Philosophical Literary Journal Logos</i>. 2019;29(1):53-84. doi:<a href=\"https://doi.org/10.22394/0869-5377-2019-1-53-80\">10.22394/0869-5377-2019-1-53-80</a>","bibtex":"@article{Klowait_Erofeeva_2019, title={Work in the Age of Intelligent Machines: The Rise of Invisible Automation}, volume={29}, DOI={<a href=\"https://doi.org/10.22394/0869-5377-2019-1-53-80\">10.22394/0869-5377-2019-1-53-80</a>}, number={1}, journal={Philosophical Literary Journal Logos}, publisher={The Russian Presidential Academy of National Economy and Public Administration}, author={Klowait, Nils and Erofeeva, Maria}, year={2019}, pages={53–84} }","mla":"Klowait, Nils, and Maria Erofeeva. “Work in the Age of Intelligent Machines: The Rise of Invisible Automation.” <i>Philosophical Literary Journal Logos</i>, vol. 29, no. 1, The Russian Presidential Academy of National Economy and Public Administration, 2019, pp. 53–84, doi:<a href=\"https://doi.org/10.22394/0869-5377-2019-1-53-80\">10.22394/0869-5377-2019-1-53-80</a>.","short":"N. Klowait, M. Erofeeva, Philosophical Literary Journal Logos 29 (2019) 53–84.","chicago":"Klowait, Nils, and Maria Erofeeva. “Work in the Age of Intelligent Machines: The Rise of Invisible Automation.” <i>Philosophical Literary Journal Logos</i> 29, no. 1 (2019): 53–84. <a href=\"https://doi.org/10.22394/0869-5377-2019-1-53-80\">https://doi.org/10.22394/0869-5377-2019-1-53-80</a>.","apa":"Klowait, N., &#38; Erofeeva, M. (2019). Work in the Age of Intelligent Machines: The Rise of Invisible Automation. <i>Philosophical Literary Journal Logos</i>, <i>29</i>(1), 53–84. <a href=\"https://doi.org/10.22394/0869-5377-2019-1-53-80\">https://doi.org/10.22394/0869-5377-2019-1-53-80</a>","ieee":"N. Klowait and M. Erofeeva, “Work in the Age of Intelligent Machines: The Rise of Invisible Automation,” <i>Philosophical Literary Journal Logos</i>, vol. 29, no. 1, pp. 53–84, 2019, doi: <a href=\"https://doi.org/10.22394/0869-5377-2019-1-53-80\">10.22394/0869-5377-2019-1-53-80</a>."}},{"type":"journal_article","keyword":["Triadic relationships","Balance theory","Pet-related services","Animal companions","Service relationship typology","Service triads"],"department":[{"_id":"181"}],"date_created":"2018-07-10T07:15:45Z","abstract":[{"lang":"eng","text":"Triadic service relationships comprise complex relationships in which not only the customer and provider are involved as partners but also other individuals with caregiving relationships with the customer. A triadic constellation may arise in the context of services for animal companions, for example, when veterinarians provide counsel and treatment to the animal companion and its owner. Through interviews with both owners of animal companions and providers of services for animal companions, this study explores typical constellations and characteristics of the three relationships in this service triad. In line with balance theory, the results show that four distinct types of triadic relationships exist in services for animal companions: the harmonious, the dysfunctional, the challenging, and the doubtful triad. The study highlights the potential conflicts and dynamics in the triads to advise providers on how to address customers depending on the types of triads to which they belong."}],"publication":"Journal of Business Research","issue":"85","citation":{"bibtex":"@article{Rötzmeier-Keuper_Hendricks_Wünderlich_Schmitz_2018, title={Triadic relationships in the context of services for animal companions}, number={85}, journal={Journal of Business Research}, publisher={Elsevier}, author={Rötzmeier-Keuper, Julia and Hendricks, Jennifer and Wünderlich, Nancy and Schmitz, Gertrud}, year={2018}, pages={295--303} }","ama":"Rötzmeier-Keuper J, Hendricks J, Wünderlich N, Schmitz G. Triadic relationships in the context of services for animal companions. <i>Journal of Business Research</i>. 2018;(85):295--303.","mla":"Rötzmeier-Keuper, Julia, et al. “Triadic Relationships in the Context of Services for Animal Companions.” <i>Journal of Business Research</i>, no. 85, Elsevier, 2018, pp. 295--303.","short":"J. Rötzmeier-Keuper, J. Hendricks, N. Wünderlich, G. Schmitz, Journal of Business Research (2018) 295--303.","chicago":"Rötzmeier-Keuper, Julia, Jennifer Hendricks, Nancy Wünderlich, and Gertrud Schmitz. “Triadic Relationships in the Context of Services for Animal Companions.” <i>Journal of Business Research</i>, no. 85 (2018): 295--303.","ieee":"J. Rötzmeier-Keuper, J. Hendricks, N. Wünderlich, and G. Schmitz, “Triadic relationships in the context of services for animal companions,” <i>Journal of Business Research</i>, no. 85, pp. 295--303, 2018.","apa":"Rötzmeier-Keuper, J., Hendricks, J., Wünderlich, N., &#38; Schmitz, G. (2018). Triadic relationships in the context of services for animal companions. <i>Journal of Business Research</i>, (85), 295--303."},"user_id":"37741","page":"295--303","publisher":"Elsevier","_id":"3516","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:59:21Z","article_type":"original","year":"2018","title":"Triadic relationships in the context of services for animal companions","status":"public","author":[{"full_name":"Rötzmeier-Keuper, Julia","first_name":"Julia","last_name":"Rötzmeier-Keuper","id":"24869"},{"full_name":"Hendricks, Jennifer","first_name":"Jennifer","last_name":"Hendricks"},{"id":"36392","first_name":"Nancy","last_name":"Wünderlich","full_name":"Wünderlich, Nancy"},{"first_name":"Gertrud","last_name":"Schmitz","full_name":"Schmitz, Gertrud"}]},{"doi":"10.4230/LIPIcs.MFCS.2018.58","main_file_link":[{"url":"http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640","open_access":"1"}],"language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","publication_status":"published","date_updated":"2023-02-28T11:01:03Z","intvolume":"       117","title":"Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)","year":"2018","publication_identifier":{"unknown":["978-3-95977-086-6"]},"author":[{"id":"71541","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag"},{"full_name":"Santha, Miklos","first_name":"Miklos","last_name":"Santha"},{"last_name":"Sikora","first_name":"Jamie","full_name":"Sikora, Jamie"},{"full_name":"Sundaram, Aarthi","last_name":"Sundaram","first_name":"Aarthi"},{"first_name":"Justin","last_name":"Yirka","full_name":"Yirka, Justin"}],"type":"conference","keyword":["Complexity Theory","Quantum Computing","Polynomial Hierarchy","Semidefinite Programming","QMA(2)","Quantum Complexity"],"department":[{"_id":"623"},{"_id":"7"}],"date_created":"2019-03-01T11:29:44Z","abstract":[{"text":"The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid Method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs \"equivalent\"), then QMA(2) is in the Counting Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e., alternating quantifiers do not help in the presence of \"unentanglement\"), QMA(2) is strictly contained in NEXP.","lang":"eng"}],"publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","user_id":"71541","volume":117,"editor":[{"last_name":"Potapov","first_name":"Igor","full_name":"Potapov, Igor"},{"full_name":"Spirakis, Paul","first_name":"Paul","last_name":"Spirakis"},{"first_name":"James","last_name":"Worrell","full_name":"Worrell, James"}],"page":"58:1-58:16","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","_id":"8161","status":"public","conference":{"location":"Liverpool, UK","name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)"},"oa":"1","external_id":{"arxiv":["1805.11139"]},"place":"Dagstuhl, Germany","citation":{"mla":"Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","ama":"Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In: Potapov I, Spirakis P, Worrell J, eds. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>","bibtex":"@inproceedings{Gharibian_Santha_Sikora_Sundaram_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}, volume={117}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={58:1-58:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","apa":"Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>","ieee":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2),” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 58:1-58:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","short":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 58:1-58:16.","chicago":"Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>."}}]