@article{48946,
  abstract     = {{inhalt Der verlässliche Betrieb von technischen Produkten wird zunehmend durch bewusste Angriffe bedroht. Vollständige Sicherheit ist dabei nicht möglich, durchschlagende Angriffe sind unvermeidbar (Assume Breach). Dies erfordert einen Paradigmenwechsel in der sicherheitsgerechten Entwicklung mechatronischer und cyber-physischer Systeme hin zu Defense-in-Depth. Systeme müssen so ausgelegt werden, dass sie auch bei gezielten Angriffen möglichst hohe Zuverlässigkeit und Sicherheit gewährleisten. Der hier beschriebene Lösungsansatz erweitert das Systemmodell um Angriffsszenarien und Verteidigungslinien. Diese werden am Beispiel eines industriellen Schließsystems zur Anlagensicherheit erläutert. Entwickler werden sensibilisiert, Angriffe systematisch zu berücksichtigen und interdisziplinär Verteidigungselemente gegenüber Bedrohungen und Angriffen zu spezifizieren.}},
  author       = {{Gräßler, Iris and Bodden, Eric and Wiechel, Dominik and Pottebaum, Jens}},
  issn         = {{0720-5953}},
  journal      = {{Konstruktion}},
  keywords     = {{Mechanical Engineering, Mechanics of Materials, General Materials Science, Theoretical Computer Science}},
  number       = {{11-12}},
  pages        = {{60--65}},
  publisher    = {{VDI Fachmedien GmbH and Co. KG}},
  title        = {{{Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security}}},
  doi          = {{10.37544/0720-5953-2023-11-12-60}},
  volume       = {{75}},
  year         = {{2023}},
}

@article{51357,
  author       = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0012-365X}},
  journal      = {{Discrete Mathematics}},
  keywords     = {{Discrete Mathematics and Combinatorics, Theoretical Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{Rotation r-graphs}}},
  doi          = {{10.1016/j.disc.2023.113457}},
  year         = {{2023}},
}

@article{33947,
  author       = {{Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  keywords     = {{General Computer Science, Theoretical Computer Science}},
  pages        = {{261--291}},
  publisher    = {{Elsevier BV}},
  title        = {{{Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}}},
  doi          = {{10.1016/j.tcs.2022.10.031}},
  volume       = {{939}},
  year         = {{2023}},
}

@article{44857,
  abstract     = {{Ancestral reconstruction is a classic task in comparative genomics. Here, we study the genome median problem, a related computational problem which, given a set of three or more genomes, asks to find a new genome that minimizes the sum of pairwise distances between it and the given genomes. The distance stands for the amount of evolution observed at the genome level, for which we determine the minimum number of rearrangement operations necessary to transform one genome into the other. For almost all rearrangement operations the median problem is NP-hard, with the exception of the breakpoint median that can be constructed efficiently for multichromosomal circular and mixed genomes. In this work, we study the median problem under a restricted rearrangement measure called c4-distance, which is closely related to the breakpoint and the DCJ distance. We identify tight bounds and decomposers of the c4-median and develop algorithms for its construction, one exact ILP-based and three combinatorial heuristics. Subsequently, we perform experiments on simulated data sets. Our results suggest that the c4-distance is useful for the study the genome median problem, from theoretical and practical perspectives.}},
  author       = {{Silva, Helmuth O.M. and Rubert, Diego P. and Araujo, Eloi and Steffen, Eckhard and Doerr, Daniel and Martinez, Fábio V.}},
  issn         = {{0399-0559}},
  journal      = {{RAIRO - Operations Research}},
  keywords     = {{Management Science and Operations Research, Computer Science Applications, Theoretical Computer Science}},
  number       = {{3}},
  pages        = {{1045--1058}},
  publisher    = {{EDP Sciences}},
  title        = {{{Algorithms for the genome median under a restricted measure of rearrangement}}},
  doi          = {{10.1051/ro/2023052}},
  volume       = {{57}},
  year         = {{2023}},
}

@article{45361,
  abstract     = {{<jats:p> The non-orthogonal local submatrix method applied to electronic structure–based molecular dynamics simulations is shown to exceed 1.1 EFLOP/s in FP16/FP32-mixed floating-point arithmetic when using 4400 NVIDIA A100 GPUs of the Perlmutter system. This is enabled by a modification of the original method that pushes the sustained fraction of the peak performance to about 80%. Example calculations are performed for SARS-CoV-2 spike proteins with up to 83 million atoms. </jats:p>}},
  author       = {{Schade, Robert and Kenter, Tobias and Elgabarty, Hossam and Lass, Michael and Kühne, Thomas and Plessl, Christian}},
  issn         = {{1094-3420}},
  journal      = {{The International Journal of High Performance Computing Applications}},
  keywords     = {{Hardware and Architecture, Theoretical Computer Science, Software}},
  publisher    = {{SAGE Publications}},
  title        = {{{Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics}}},
  doi          = {{10.1177/10943420231177631}},
  year         = {{2023}},
}

@article{29843,
  author       = {{Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}},
  issn         = {{0890-5401}},
  journal      = {{Information and Computation}},
  keywords     = {{Computational Theory and Mathematics, Computer Science Applications, Information Systems, Theoretical Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{A Discrete and Continuous Study of the Max-Chain-Formation Problem}}},
  doi          = {{10.1016/j.ic.2022.104877}},
  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}},
}

@article{34700,
  author       = {{Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}},
  issn         = {{1016-3328}},
  journal      = {{Computational Complexity}},
  keywords     = {{Computational Mathematics, Computational Theory and Mathematics, General Mathematics, Theoretical Computer Science}},
  number       = {{2}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Quantum generalizations of the polynomial hierarchy with applications to QMA(2)}}},
  doi          = {{10.1007/s00037-022-00231-8}},
  volume       = {{31}},
  year         = {{2022}},
}

@article{31543,
  author       = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0911-0119}},
  journal      = {{Graphs and Combinatorics}},
  keywords     = {{Discrete Mathematics and Combinatorics, Theoretical Computer Science}},
  number       = {{3}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices}}},
  doi          = {{10.1007/s00373-022-02506-x}},
  volume       = {{38}},
  year         = {{2022}},
}

@article{33684,
  author       = {{Schade, Robert and Kenter, Tobias and Elgabarty, Hossam and Lass, Michael and Schütt, Ole and Lazzaro, Alfio and Pabst, Hans and Mohr, Stephan and Hutter, Jürg and Kühne, Thomas and Plessl, Christian}},
  issn         = {{0167-8191}},
  journal      = {{Parallel Computing}},
  keywords     = {{Artificial Intelligence, Computer Graphics and Computer-Aided Design, Computer Networks and Communications, Hardware and Architecture, Theoretical Computer Science, Software}},
  publisher    = {{Elsevier BV}},
  title        = {{{Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms}}},
  doi          = {{10.1016/j.parco.2022.102920}},
  volume       = {{111}},
  year         = {{2022}},
}

@article{30907,
  author       = {{Rodriguez, Alfonso and Otero, Andres and Platzner, Marco and De la Torre, Eduardo}},
  issn         = {{0018-9340}},
  journal      = {{IEEE Transactions on Computers}},
  keywords     = {{Computational Theory and Mathematics, Hardware and Architecture, Theoretical Computer Science, Software}},
  pages        = {{1--1}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs}}},
  doi          = {{10.1109/tc.2021.3107196}},
  year         = {{2021}},
}

@article{34042,
  author       = {{Li, Jiaao and Ma, Yulai and Miao, Zhengke and Shi, Yongtang and Wang, Weifan and Zhang, Cun-Quan}},
  issn         = {{0095-8956}},
  journal      = {{Journal of Combinatorial Theory, Series B}},
  keywords     = {{Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Theoretical Computer Science}},
  pages        = {{61--80}},
  publisher    = {{Elsevier BV}},
  title        = {{{Nowhere-zero 3-flows in toroidal graphs}}},
  doi          = {{10.1016/j.jctb.2021.11.001}},
  volume       = {{153}},
  year         = {{2021}},
}

@article{45844,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering the positive version, asking for sets of variables as explanations, we study, besides the problem of wether there exists a set of explanations, two explanation size limited variants of this reasoning problem (less than or equal to, and equal to a given size bound). In this paper, we present a thorough two-dimensional classification of these problems: the first dimension is regarding the parameterized complexity under a wealth of different parameterizations, and the second dimension spans through all possible Boolean fragments of these problems in Schaefer’s constraint satisfaction framework with co-clones (T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1–3, 1978, San Diego, California, USA, R.J. Lipton, W.A. Burkhard, W.J. Savitch, E.P. Friedman, A.V. Aho eds, pp. 216–226. ACM, 1978). Thereby, we almost complete the parameterized complexity classification program initiated by Fellows et al. (The parameterized complexity of abduction. In Proceedings of the Twenty-Sixth AAAI Conference on Articial Intelligence, July 22–26, 2012, Toronto, Ontario, Canada, J. Homann, B. Selman eds. AAAI Press, 2012), partially building on the results by Nordh and Zanuttini (What makes propositional abduction tractable. Artificial Intelligence, 172, 1245–1284, 2008). In this process, we outline a fine-grained analysis of the inherent parameterized intractability of these problems and pinpoint their FPT parts. As the standard algebraic approach is not applicable to our problems, we develop an alternative method that makes the algebraic tools partially available again.</jats:p>}},
  author       = {{Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}},
  issn         = {{0955-792X}},
  journal      = {{Journal of Logic and Computation}},
  keywords     = {{Logic, Hardware and Architecture, Arts and Humanities (miscellaneous), Software, Theoretical Computer Science}},
  number       = {{1}},
  pages        = {{266--296}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Parameterized complexity of abduction in Schaefer’s framework}}},
  doi          = {{10.1093/logcom/exaa079}},
  volume       = {{31}},
  year         = {{2021}},
}

@article{37146,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Organizations increasingly introduce collaborative technologies in form of virtual assistants (VAs) to save valuable resources, especially when employees are assisted with work-related tasks. However, the effect of VAs on virtual teams and collaboration remains uncertain, particularly whether employees show social loafing (SL) tendencies, i.e., applying less effort for collective tasks compared to working alone. While extant research indicates that VAs collaboratively working in teams exert greater results, less is known about SL in virtual collaboration and how responsibility attribution alters. An online experiment with N = 102 was conducted in which participants were assisted by a VA in solving a task. The results indicate SL tendencies in virtual collaboration with VAs and that participants tend to cede responsibility to the VA. This study makes a first foray and extends the information systems (IS) literature by analyzing SL and responsibility attribution thus updates our knowledge on virtual collaboration with VAs.</jats:p>}},
  author       = {{Stieglitz, Stefan and Mirbabaie, Milad and Möllmann, Nicholas R. J. and Rzyski, Jannik}},
  issn         = {{1387-3326}},
  journal      = {{Information Systems Frontiers}},
  keywords     = {{Computer Networks and Communications, Information Systems, Theoretical Computer Science, Software}},
  number       = {{3}},
  pages        = {{745--770}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Collaborating with Virtual Assistants in Organizations: Analyzing Social Loafing Tendencies and Responsibility Attribution}}},
  doi          = {{10.1007/s10796-021-10201-0}},
  volume       = {{24}},
  year         = {{2021}},
}

@article{53333,
  author       = {{Winkler, Michael}},
  issn         = {{2036-2145}},
  journal      = {{ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE}},
  keywords     = {{Mathematics (miscellaneous), Theoretical Computer Science}},
  pages        = {{141--172}},
  publisher    = {{Scuola Normale Superiore - Edizioni della Normale}},
  title        = {{{$L^1$ solutions to parabolic Keller-Segel systems involving arbitrary superlinear degradation}}},
  doi          = {{10.2422/2036-2145.202005_016}},
  year         = {{2021}},
}

@article{46266,
  author       = {{Alizadeh, Bijan and Behnam, Payman and Sadeghi-Kohan, Somayeh}},
  issn         = {{0018-9340}},
  journal      = {{IEEE Transactions on Computers}},
  keywords     = {{Computational Theory and Mathematics, Hardware and Architecture, Theoretical Computer Science, Software}},
  pages        = {{1--1}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs}}},
  doi          = {{10.1109/tc.2014.2329687}},
  year         = {{2014}},
}