@inproceedings{40054,
  author       = {{Janicki, Nicole and Tenberge, Claudia}},
  editor       = {{Gill, David and Tuff, Jim and Kennedy, Thomas and Pendergast, Shawn and Jamil, Sana}},
  location     = {{St. John’s, Newfoundland and Labrador, Canada}},
  pages        = {{475--485}},
  title        = {{{Technology Education in Elementary School Using the Example of 'Learning Robots' – Development and Evaluation of an In-Service Teacher Training Concept.}}},
  year         = {{2022}},
}

@misc{54537,
  author       = {{Bauer, Maike and Hohwiller, Peter}},
  booktitle    = {{Der fremdsprachliche Unterricht Englisch}},
  pages        = {{30--33}},
  title        = {{{iMustHave. Anhand von Werbevideos den Kult um den digital global player Apple untersuchen}}},
  volume       = {{178}},
  year         = {{2022}},
}

@misc{54534,
  author       = {{Bauer, Maike and Menschig, Leigh}},
  booktitle    = {{Englisch Betrifft Uns}},
  pages        = {{1--5}},
  title        = {{{Should I Stay or Should I Go? Discussing the Advantages and Disadvantages of Taking a Gap Year}}},
  volume       = {{6}},
  year         = {{2022}},
}

@misc{54535,
  author       = {{Bauer, Maike and Menschig, Leigh}},
  booktitle    = {{Englisch Betrifft Uns}},
  pages        = {{22--25}},
  title        = {{{Virtual Employees in India: Off-site Employment for Large Corporations. Two oral exams}}},
  volume       = {{5}},
  year         = {{2022}},
}

@misc{54536,
  author       = {{Bauer, Maike and Menschig, Leigh}},
  booktitle    = {{Englisch Betrifft Uns}},
  pages        = {{17--21}},
  title        = {{{Modern Slavery vs. Fairtrade: Raising Awareness of the Working Conditions in India}}},
  volume       = {{5}},
  year         = {{2022}},
}

@inproceedings{54541,
  author       = {{Bauer, Maike}},
  location     = {{Münster}},
  title        = {{{Diaspora Short Stories – A Meaningful Aspect in Young Adult Literature? }}},
  year         = {{2022}},
}

@inproceedings{52924,
  author       = {{Tirtarasa, Satyadharma and Turhan, Anni-Yasmin}},
  booktitle    = {{SAC ’22: The 37th {ACM/SIGAPP} Symposium on Applied Computing, Virtual Event, April 25 - 29, 2022}},
  editor       = {{Hong, Jiman and Bures, Miroslav and Park, Juw Won and Cerný, Tomás}},
  pages        = {{903–910}},
  publisher    = {{ACM}},
  title        = {{{Computing generalizations of temporal ϵL concepts with next and global}}},
  doi          = {{10.1145/3477314.3507136}},
  year         = {{2022}},
}

@inproceedings{54549,
  author       = {{Janicki, Nicole}},
  location     = {{Universität zu Köln}},
  title        = {{{Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln}}},
  year         = {{2022}},
}

@article{52918,
  author       = {{Baader, Franz and Koopmann, Patrick and Michel, Friedrich and Turhan, Anni-Yasmin and Zarrieß, Benjamin}},
  journal      = {{Theory Pract. Log. Program.}},
  number       = {{2}},
  pages        = {{162–192}},
  title        = {{{Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner}}},
  doi          = {{10.1017/S1471068421000466}},
  volume       = {{22}},
  year         = {{2022}},
}

@misc{54554,
  author       = {{Janus, Richard}},
  pages        = {{1}},
  publisher    = {{Evangelischer Bund}},
  title        = {{{Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium}}},
  volume       = {{4}},
  year         = {{2022}},
}

@article{49458,
  author       = {{Nastjuk, I. and Trang, Simon Thanh-Nam and Papageorgiou, E.}},
  journal      = {{Electronic Markets}},
  pages        = {{1917--1924}},
  title        = {{{Smart cities and smart governance models for future cities}}},
  volume       = {{32}},
  year         = {{2022}},
}

@article{49460,
  author       = {{Masuch, K. and Greve, M. and Trang, Simon Thanh-Nam}},
  journal      = {{Electronic Markets}},
  pages        = {{829--848}},
  title        = {{{What to do after a data breach? Examining apology and compensation as response strategies for health service providers}}},
  volume       = {{31}},
  year         = {{2022}},
}

@article{49459,
  author       = {{Masuch, K. and Greve, M. and Trang, Simon Thanh-Nam}},
  journal      = {{Computers & Security}},
  title        = {{{Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies}}},
  volume       = {{12}},
  year         = {{2022}},
}

@inbook{54585,
  author       = {{Manzoor, Ali and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web – ISWC 2022}},
  isbn         = {{9783031194320}},
  issn         = {{0302-9743}},
  publisher    = {{Springer International Publishing}},
  title        = {{{REBench: Microbenchmarking Framework for Relation Extraction Systems}}},
  doi          = {{10.1007/978-3-031-19433-7_37}},
  year         = {{2022}},
}

@article{45849,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic<jats:italic>(PDL)</jats:italic>and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) of<jats:italic>PDL</jats:italic>is<jats:bold>NP</jats:bold>-complete (Ebbing and Lohmann, SOFSEM 2012). The subject of this research is to identify a list of parameterisations (formula-size, formula-depth, treewidth, team-size, number of variables) under which MC becomes fixed-parameter tractable. Furthermore, we show that the number of disjunctions or the arity of dependence atoms (dep-arity) as a parameter both yield a paraNP-completeness result. Then, we consider the satisfiability problem (SAT) which classically is known to be<jats:bold>NP</jats:bold>-complete as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different picture: under team-size, or dep-arity SAT is<jats:bold>paraNP</jats:bold>-complete whereas under all other mentioned parameters the problem is<jats:bold>FPT</jats:bold>. Finally, we introduce a variant of the satisfiability problem, asking for a team of a given size, and show for this problem an almost complete picture.</jats:p>}},
  author       = {{Mahmood, Yasir and Meier, Arne}},
  issn         = {{1012-2443}},
  journal      = {{Annals of Mathematics and Artificial Intelligence}},
  keywords     = {{Applied Mathematics, Artificial Intelligence}},
  number       = {{2-3}},
  pages        = {{271--296}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Parameterised complexity of model checking and satisfiability in propositional dependence logic}}},
  doi          = {{10.1007/s10472-021-09730-w}},
  volume       = {{90}},
  year         = {{2022}},
}

@article{45847,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>In this paper, we investigate the parameterized complexity of model checking for Dependence and Independence logic, which are well studied logics in the area of Team Semantics. We start with a list of nine immediate parameterizations for this problem, namely the number of disjunctions (i.e. splits)/(free) variables/universal quantifiers, formula-size, the tree-width of the Gaifman graph of the input structure, the size of the universe/team and the arity of dependence atoms. We present a comprehensive picture of the parameterized complexity of model checking and obtain a division of the problem into tractable and various intractable degrees. Furthermore, we also consider the complexity of the most important variants (data and expression complexity) of the model checking problem by fixing parts of the input.</jats:p>}},
  author       = {{Kontinen, Juha and Meier, Arne and Mahmood, Yasir}},
  issn         = {{0955-792X}},
  journal      = {{Journal of Logic and Computation}},
  keywords     = {{Logic, Hardware and Architecture, Arts and Humanities (miscellaneous), Software, Theoretical Computer Science}},
  number       = {{8}},
  pages        = {{1624--1644}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{A parameterized view on the complexity of dependence and independence logic}}},
  doi          = {{10.1093/logcom/exac070}},
  volume       = {{32}},
  year         = {{2022}},
}

@inproceedings{45846,
  author       = {{Kontinen, Juha and Meier, Arne and Mahmood, Yasir}},
  booktitle    = {{Logical Foundations of Computer Science}},
  isbn         = {{9783030930998}},
  issn         = {{0302-9743}},
  publisher    = {{Springer International Publishing}},
  title        = {{{A Parameterized View on the Complexity of Dependence Logic}}},
  doi          = {{10.1007/978-3-030-93100-1_9}},
  year         = {{2022}},
}

@inproceedings{47289,
  author       = {{Huaman, Nicolas and Krause, Alexander and Wermke, Dominik and Klemmer, Jan H. and Stransky, Christian and Acar, Yasemin and Fahl, Sascha}},
  booktitle    = {{Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022}},
  editor       = {{Chiasson, Sonia and Kapadia, Apu}},
  pages        = {{313–330}},
  publisher    = {{USENIX Association}},
  title        = {{{If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers}}},
  year         = {{2022}},
}

@inproceedings{47844,
  author       = {{Jancar, Jan and Fourné, Marcel and Braga, Daniel De Almeida and Sabt, Mohamed and Schwabe, Peter and Barthe, Gilles and Fouque, Pierre-Alain and Acar, Yasemin}},
  booktitle    = {{2022 IEEE Symposium on Security and Privacy (SP)}},
  publisher    = {{IEEE}},
  title        = {{{“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks}}},
  doi          = {{10.1109/sp46214.2022.9833713}},
  year         = {{2022}},
}

@inproceedings{47286,
  author       = {{Gutfleisch, Marco and Klemmer, Jan H. and Busch, Niklas and Acar, Yasemin and Sasse, M. Angela and Fahl, Sascha}},
  booktitle    = {{43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}},
  pages        = {{893–910}},
  publisher    = {{IEEE}},
  title        = {{{How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study}}},
  doi          = {{10.1109/SP46214.2022.9833756}},
  year         = {{2022}},
}