[{"publication_identifier":{"issn":["0720-5953"]},"quality_controlled":"1","publication_status":"published","issue":"11-12","year":"2023","intvolume":"        75","page":"60-65","citation":{"mla":"Gräßler, Iris, et al. “Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security.” <i>Konstruktion</i>, vol. 75, no. 11–12, VDI Fachmedien GmbH and Co. KG, 2023, pp. 60–65, doi:<a href=\"https://doi.org/10.37544/0720-5953-2023-11-12-60\">10.37544/0720-5953-2023-11-12-60</a>.","bibtex":"@article{Gräßler_Bodden_Wiechel_Pottebaum_2023, title={Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security}, volume={75}, DOI={<a href=\"https://doi.org/10.37544/0720-5953-2023-11-12-60\">10.37544/0720-5953-2023-11-12-60</a>}, number={11–12}, journal={Konstruktion}, publisher={VDI Fachmedien GmbH and Co. KG}, author={Gräßler, Iris and Bodden, Eric and Wiechel, Dominik and Pottebaum, Jens}, year={2023}, pages={60–65} }","short":"I. Gräßler, E. Bodden, D. Wiechel, J. Pottebaum, Konstruktion 75 (2023) 60–65.","apa":"Gräßler, I., Bodden, E., Wiechel, D., &#38; Pottebaum, J. (2023). Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security. <i>Konstruktion</i>, <i>75</i>(11–12), 60–65. <a href=\"https://doi.org/10.37544/0720-5953-2023-11-12-60\">https://doi.org/10.37544/0720-5953-2023-11-12-60</a>","ama":"Gräßler I, Bodden E, Wiechel D, Pottebaum J. Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security. <i>Konstruktion</i>. 2023;75(11-12):60-65. doi:<a href=\"https://doi.org/10.37544/0720-5953-2023-11-12-60\">10.37544/0720-5953-2023-11-12-60</a>","chicago":"Gräßler, Iris, Eric Bodden, Dominik Wiechel, and Jens Pottebaum. “Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security.” <i>Konstruktion</i> 75, no. 11–12 (2023): 60–65. <a href=\"https://doi.org/10.37544/0720-5953-2023-11-12-60\">https://doi.org/10.37544/0720-5953-2023-11-12-60</a>.","ieee":"I. Gräßler, E. Bodden, D. Wiechel, and J. Pottebaum, “Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security,” <i>Konstruktion</i>, vol. 75, no. 11–12, pp. 60–65, 2023, doi: <a href=\"https://doi.org/10.37544/0720-5953-2023-11-12-60\">10.37544/0720-5953-2023-11-12-60</a>."},"publisher":"VDI Fachmedien GmbH and Co. KG","date_updated":"2023-12-20T14:10:51Z","volume":75,"date_created":"2023-11-16T08:23:12Z","author":[{"id":"47565","full_name":"Gräßler, Iris","last_name":"Gräßler","orcid":"0000-0001-5765-971X","first_name":"Iris"},{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric"},{"full_name":"Wiechel, Dominik","id":"67161","last_name":"Wiechel","first_name":"Dominik"},{"full_name":"Pottebaum, Jens","id":"405","orcid":"http://orcid.org/0000-0001-8778-2989","last_name":"Pottebaum","first_name":"Jens"}],"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","publication":"Konstruktion","type":"journal_article","abstract":[{"text":"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.","lang":"ger"},{"text":"The reliable operation of technical products is increasingly threatened by deliberate attacks. Complete security is not possible, striking attacks are unavoidable (assume breach). This requires a paradigm shift in security-oriented engineering of mechatronic and cyber-physical systems towards Defense-in-Depth. Systems need to be engineered in a way that full reliability and security are ensured even in case of targeted attacks. The solution approach described here expands the system model to include attack scenarios and lines of defence. It is applied to an industrial locking system for plant security as an example. Developers are sensitised to systematically consider attacks and to specify interdisciplinary defence elements against threats and attacks.","lang":"eng"}],"status":"public","_id":"48946","department":[{"_id":"152"},{"_id":"76"}],"user_id":"405","keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science","Theoretical Computer Science"],"article_type":"original","language":[{"iso":"ger"}]},{"publication_status":"published","publication_identifier":{"issn":["0012-365X"]},"citation":{"ieee":"E. Steffen and I. H. Wolf, “Rotation r-graphs,” <i>Discrete Mathematics</i>, Art. no. 113457, 2023, doi: <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>.","chicago":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.” <i>Discrete Mathematics</i>, 2023. <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">https://doi.org/10.1016/j.disc.2023.113457</a>.","ama":"Steffen E, Wolf IH. Rotation r-graphs. <i>Discrete Mathematics</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>","apa":"Steffen, E., &#38; Wolf, I. H. (2023). Rotation r-graphs. <i>Discrete Mathematics</i>, Article 113457. <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">https://doi.org/10.1016/j.disc.2023.113457</a>","mla":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.” <i>Discrete Mathematics</i>, 113457, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>.","bibtex":"@article{Steffen_Wolf_2023, title={Rotation r-graphs}, DOI={<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>}, number={113457}, journal={Discrete Mathematics}, publisher={Elsevier BV}, author={Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2023} }","short":"E. Steffen, I.H. Wolf, Discrete Mathematics (2023)."},"year":"2023","author":[{"first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548","orcid":"0000-0002-9808-7401","last_name":"Steffen"},{"last_name":"Wolf","id":"88145","full_name":"Wolf, Isaak Hieronymus","first_name":"Isaak Hieronymus"}],"date_created":"2024-02-16T08:44:50Z","date_updated":"2024-02-16T08:45:10Z","publisher":"Elsevier BV","doi":"10.1016/j.disc.2023.113457","title":"Rotation r-graphs","type":"journal_article","publication":"Discrete Mathematics","status":"public","user_id":"15540","department":[{"_id":"542"}],"_id":"51357","language":[{"iso":"eng"}],"article_number":"113457","keyword":["Discrete Mathematics and Combinatorics","Theoretical Computer Science"]},{"doi":"10.1016/j.tcs.2022.10.031","volume":939,"author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"first_name":"Jonas","id":"47213","full_name":"Harbig, Jonas","last_name":"Harbig"},{"first_name":"Daniel","last_name":"Jung","id":"37827","full_name":"Jung, Daniel"},{"first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2023-01-30T09:20:09Z","page":"261-291","intvolume":"       939","citation":{"apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>, <i>939</i>, 261–291. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>","mla":"Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.","bibtex":"@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}, volume={939}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2023}, pages={261–291} }","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i> 939 (2023): 261–91. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>.","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation,” <i>Theoretical Computer Science</i>, vol. 939, pp. 261–291, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>. 2023;939:261-291. doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>"},"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","article_type":"original","department":[{"_id":"63"}],"user_id":"38705","_id":"33947","project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"status":"public","type":"journal_article","title":"Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation","date_created":"2022-10-28T05:11:16Z","publisher":"Elsevier BV","year":"2023","language":[{"iso":"eng"}],"keyword":["General Computer Science","Theoretical Computer Science"],"external_id":{"arxiv":["2010.04424 "]},"publication":"Theoretical Computer Science"},{"status":"public","type":"journal_article","_id":"44857","user_id":"15540","department":[{"_id":"542"}],"citation":{"ama":"Silva HOM, Rubert DP, Araujo E, Steffen E, Doerr D, Martinez FV. Algorithms for the genome median under a restricted measure of rearrangement. <i>RAIRO - Operations Research</i>. 2023;57(3):1045-1058. doi:<a href=\"https://doi.org/10.1051/ro/2023052\">10.1051/ro/2023052</a>","chicago":"Silva, Helmuth O.M., Diego P. Rubert, Eloi Araujo, Eckhard Steffen, Daniel Doerr, and Fábio V. Martinez. “Algorithms for the Genome Median under a Restricted Measure of Rearrangement.” <i>RAIRO - Operations Research</i> 57, no. 3 (2023): 1045–58. <a href=\"https://doi.org/10.1051/ro/2023052\">https://doi.org/10.1051/ro/2023052</a>.","ieee":"H. O. M. Silva, D. P. Rubert, E. Araujo, E. Steffen, D. Doerr, and F. V. Martinez, “Algorithms for the genome median under a restricted measure of rearrangement,” <i>RAIRO - Operations Research</i>, vol. 57, no. 3, pp. 1045–1058, 2023, doi: <a href=\"https://doi.org/10.1051/ro/2023052\">10.1051/ro/2023052</a>.","apa":"Silva, H. O. M., Rubert, D. P., Araujo, E., Steffen, E., Doerr, D., &#38; Martinez, F. V. (2023). Algorithms for the genome median under a restricted measure of rearrangement. <i>RAIRO - Operations Research</i>, <i>57</i>(3), 1045–1058. <a href=\"https://doi.org/10.1051/ro/2023052\">https://doi.org/10.1051/ro/2023052</a>","short":"H.O.M. Silva, D.P. Rubert, E. Araujo, E. Steffen, D. Doerr, F.V. Martinez, RAIRO - Operations Research 57 (2023) 1045–1058.","bibtex":"@article{Silva_Rubert_Araujo_Steffen_Doerr_Martinez_2023, title={Algorithms for the genome median under a restricted measure of rearrangement}, volume={57}, DOI={<a href=\"https://doi.org/10.1051/ro/2023052\">10.1051/ro/2023052</a>}, number={3}, journal={RAIRO - Operations Research}, publisher={EDP Sciences}, author={Silva, Helmuth O.M. and Rubert, Diego P. and Araujo, Eloi and Steffen, Eckhard and Doerr, Daniel and Martinez, Fábio V.}, year={2023}, pages={1045–1058} }","mla":"Silva, Helmuth O. M., et al. “Algorithms for the Genome Median under a Restricted Measure of Rearrangement.” <i>RAIRO - Operations Research</i>, vol. 57, no. 3, EDP Sciences, 2023, pp. 1045–58, doi:<a href=\"https://doi.org/10.1051/ro/2023052\">10.1051/ro/2023052</a>."},"page":"1045-1058","intvolume":"        57","publication_status":"published","publication_identifier":{"issn":["0399-0559","2804-7303"]},"doi":"10.1051/ro/2023052","date_updated":"2023-05-16T08:49:30Z","author":[{"first_name":"Helmuth O.M.","full_name":"Silva, Helmuth O.M.","last_name":"Silva"},{"first_name":"Diego P.","last_name":"Rubert","full_name":"Rubert, Diego P."},{"first_name":"Eloi","last_name":"Araujo","full_name":"Araujo, Eloi"},{"first_name":"Eckhard","last_name":"Steffen","orcid":"0000-0002-9808-7401","id":"15548","full_name":"Steffen, Eckhard"},{"first_name":"Daniel","last_name":"Doerr","full_name":"Doerr, Daniel"},{"full_name":"Martinez, Fábio V.","last_name":"Martinez","first_name":"Fábio V."}],"volume":57,"abstract":[{"lang":"eng","text":"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."}],"publication":"RAIRO - Operations Research","keyword":["Management Science and Operations Research","Computer Science Applications","Theoretical Computer Science"],"language":[{"iso":"eng"}],"year":"2023","issue":"3","title":"Algorithms for the genome median under a restricted measure of rearrangement","publisher":"EDP Sciences","date_created":"2023-05-16T08:48:22Z"},{"department":[{"_id":"27"},{"_id":"518"}],"user_id":"75963","_id":"45361","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"article_type":"original","article_number":"109434202311776","type":"journal_article","status":"public","author":[{"first_name":"Robert","id":"75963","full_name":"Schade, Robert","last_name":"Schade","orcid":"0000-0002-6268-539"},{"first_name":"Tobias","full_name":"Kenter, Tobias","id":"3145","last_name":"Kenter"},{"id":"60250","full_name":"Elgabarty, Hossam","orcid":"0000-0002-4945-1481","last_name":"Elgabarty","first_name":"Hossam"},{"first_name":"Michael","id":"24135","full_name":"Lass, Michael","orcid":"0000-0002-5708-7632","last_name":"Lass"},{"id":"49079","full_name":"Kühne, Thomas","last_name":"Kühne","first_name":"Thomas"},{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian"}],"oa":"1","date_updated":"2023-08-02T15:04:53Z","doi":"10.1177/10943420231177631","main_file_link":[{"url":"https://journals.sagepub.com/doi/10.1177/10943420231177631","open_access":"1"}],"publication_identifier":{"issn":["1094-3420","1741-2846"]},"publication_status":"published","citation":{"ama":"Schade R, Kenter T, Elgabarty H, Lass M, Kühne T, Plessl C. Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics. <i>The International Journal of High Performance Computing Applications</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1177/10943420231177631\">10.1177/10943420231177631</a>","apa":"Schade, R., Kenter, T., Elgabarty, H., Lass, M., Kühne, T., &#38; Plessl, C. (2023). Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics. <i>The International Journal of High Performance Computing Applications</i>, Article 109434202311776. <a href=\"https://doi.org/10.1177/10943420231177631\">https://doi.org/10.1177/10943420231177631</a>","short":"R. Schade, T. Kenter, H. Elgabarty, M. Lass, T. Kühne, C. Plessl, The International Journal of High Performance Computing Applications (2023).","bibtex":"@article{Schade_Kenter_Elgabarty_Lass_Kühne_Plessl_2023, title={Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics}, DOI={<a href=\"https://doi.org/10.1177/10943420231177631\">10.1177/10943420231177631</a>}, number={109434202311776}, journal={The International Journal of High Performance Computing Applications}, publisher={SAGE Publications}, author={Schade, Robert and Kenter, Tobias and Elgabarty, Hossam and Lass, Michael and Kühne, Thomas and Plessl, Christian}, year={2023} }","mla":"Schade, Robert, et al. “Breaking the Exascale Barrier for the Electronic Structure Problem in Ab-Initio Molecular Dynamics.” <i>The International Journal of High Performance Computing Applications</i>, 109434202311776, SAGE Publications, 2023, doi:<a href=\"https://doi.org/10.1177/10943420231177631\">10.1177/10943420231177631</a>.","chicago":"Schade, Robert, Tobias Kenter, Hossam Elgabarty, Michael Lass, Thomas Kühne, and Christian Plessl. “Breaking the Exascale Barrier for the Electronic Structure Problem in Ab-Initio Molecular Dynamics.” <i>The International Journal of High Performance Computing Applications</i>, 2023. <a href=\"https://doi.org/10.1177/10943420231177631\">https://doi.org/10.1177/10943420231177631</a>.","ieee":"R. Schade, T. Kenter, H. Elgabarty, M. Lass, T. Kühne, and C. Plessl, “Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics,” <i>The International Journal of High Performance Computing Applications</i>, Art. no. 109434202311776, 2023, doi: <a href=\"https://doi.org/10.1177/10943420231177631\">10.1177/10943420231177631</a>."},"language":[{"iso":"eng"}],"keyword":["Hardware and Architecture","Theoretical Computer Science","Software"],"publication":"The International Journal of High Performance Computing Applications","abstract":[{"lang":"eng","text":"<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>"}],"date_created":"2023-05-30T09:19:09Z","publisher":"SAGE Publications","title":"Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics","quality_controlled":"1","year":"2023"},{"status":"public","type":"journal_article","publication":"Information and Computation","article_number":"104877","keyword":["Computational Theory and Mathematics","Computer Science Applications","Information Systems","Theoretical Computer Science"],"language":[{"iso":"eng"}],"project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"_id":"29843","user_id":"38705","department":[{"_id":"63"}],"year":"2022","citation":{"ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem,” <i>Information and Computation</i>, Art. no. 104877, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>.","apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>, Article 104877. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>","mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 104877, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>.","bibtex":"@article{Castenow_Kling_Knollmann_Meyer auf der Heide_2022, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>}, number={104877}, journal={Information and Computation}, publisher={Elsevier BV}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2022} }","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022)."},"publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem","doi":"10.1016/j.ic.2022.104877","publisher":"Elsevier BV","date_updated":"2022-02-15T07:41:00Z","author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2022-02-15T07:38:28Z"},{"citation":{"ama":"Kontinen J, Meier A, Mahmood Y. A parameterized view on the complexity of dependence and independence logic. <i>Journal of Logic and Computation</i>. 2022;32(8):1624-1644. doi:<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>","ieee":"J. Kontinen, A. Meier, and Y. Mahmood, “A parameterized view on the complexity of dependence and independence logic,” <i>Journal of Logic and Computation</i>, vol. 32, no. 8, pp. 1624–1644, 2022, doi: <a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>.","chicago":"Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence and Independence Logic.” <i>Journal of Logic and Computation</i> 32, no. 8 (2022): 1624–44. <a href=\"https://doi.org/10.1093/logcom/exac070\">https://doi.org/10.1093/logcom/exac070</a>.","apa":"Kontinen, J., Meier, A., &#38; Mahmood, Y. (2022). A parameterized view on the complexity of dependence and independence logic. <i>Journal of Logic and Computation</i>, <i>32</i>(8), 1624–1644. <a href=\"https://doi.org/10.1093/logcom/exac070\">https://doi.org/10.1093/logcom/exac070</a>","bibtex":"@article{Kontinen_Meier_Mahmood_2022, title={A parameterized view on the complexity of dependence and independence logic}, volume={32}, DOI={<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>}, number={8}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2022}, pages={1624–1644} }","short":"J. Kontinen, A. Meier, Y. Mahmood, Journal of Logic and Computation 32 (2022) 1624–1644.","mla":"Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence and Independence Logic.” <i>Journal of Logic and Computation</i>, vol. 32, no. 8, Oxford University Press (OUP), 2022, pp. 1624–44, doi:<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>."},"intvolume":"        32","page":"1624-1644","publication_status":"published","publication_identifier":{"issn":["0955-792X","1465-363X"]},"doi":"10.1093/logcom/exac070","date_updated":"2024-06-04T16:06:37Z","author":[{"first_name":"Juha","full_name":"Kontinen, Juha","last_name":"Kontinen"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"},{"first_name":"Yasir","full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood"}],"volume":32,"status":"public","type":"journal_article","extern":"1","_id":"45847","user_id":"99353","year":"2022","issue":"8","title":"A parameterized view on the complexity of dependence and independence logic","publisher":"Oxford University Press (OUP)","date_created":"2023-07-03T11:36:55Z","abstract":[{"text":"<jats:title>Abstract</jats:title>\r\n               <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>","lang":"eng"}],"publication":"Journal of Logic and Computation","keyword":["Logic","Hardware and Architecture","Arts and Humanities (miscellaneous)","Software","Theoretical Computer Science"],"language":[{"iso":"eng"}]},{"author":[{"first_name":"Sevag","id":"71541","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian"},{"first_name":"Miklos","full_name":"Santha, Miklos","last_name":"Santha"},{"full_name":"Sikora, Jamie","last_name":"Sikora","first_name":"Jamie"},{"first_name":"Aarthi","full_name":"Sundaram, Aarthi","last_name":"Sundaram"},{"full_name":"Yirka, Justin","last_name":"Yirka","first_name":"Justin"}],"volume":31,"date_updated":"2023-02-28T11:07:02Z","doi":"10.1007/s00037-022-00231-8","publication_status":"published","publication_identifier":{"issn":["1016-3328","1420-8954"]},"citation":{"ama":"Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum generalizations of the polynomial hierarchy with applications to QMA(2). <i>Computational Complexity</i>. 2022;31(2). doi:<a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>","chicago":"Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>Computational Complexity</i> 31, no. 2 (2022). <a href=\"https://doi.org/10.1007/s00037-022-00231-8\">https://doi.org/10.1007/s00037-022-00231-8</a>.","ieee":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum generalizations of the polynomial hierarchy with applications to QMA(2),” <i>Computational Complexity</i>, vol. 31, no. 2, Art. no. 13, 2022, doi: <a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>.","short":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, Computational Complexity 31 (2022).","mla":"Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>Computational Complexity</i>, vol. 31, no. 2, 13, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>.","bibtex":"@article{Gharibian_Santha_Sikora_Sundaram_Yirka_2022, title={Quantum generalizations of the polynomial hierarchy with applications to QMA(2)}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>}, number={213}, journal={Computational Complexity}, publisher={Springer Science and Business Media LLC}, author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, year={2022} }","apa":"Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2022). Quantum generalizations of the polynomial hierarchy with applications to QMA(2). <i>Computational Complexity</i>, <i>31</i>(2), Article 13. <a href=\"https://doi.org/10.1007/s00037-022-00231-8\">https://doi.org/10.1007/s00037-022-00231-8</a>"},"intvolume":"        31","user_id":"71541","department":[{"_id":"623"},{"_id":"7"}],"_id":"34700","article_number":"13","type":"journal_article","status":"public","date_created":"2022-12-21T10:53:52Z","publisher":"Springer Science and Business Media LLC","title":"Quantum generalizations of the polynomial hierarchy with applications to QMA(2)","issue":"2","year":"2022","language":[{"iso":"eng"}],"keyword":["Computational Mathematics","Computational Theory and Mathematics","General Mathematics","Theoretical Computer Science"],"publication":"Computational Complexity"},{"type":"journal_article","status":"public","_id":"31543","user_id":"15540","article_number":"104","publication_identifier":{"issn":["0911-0119","1435-5914"]},"publication_status":"published","intvolume":"        38","citation":{"mla":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices.” <i>Graphs and Combinatorics</i>, vol. 38, no. 3, 104, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00373-022-02506-x\">10.1007/s00373-022-02506-x</a>.","bibtex":"@article{Steffen_Wolf_2022, title={Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices}, volume={38}, DOI={<a href=\"https://doi.org/10.1007/s00373-022-02506-x\">10.1007/s00373-022-02506-x</a>}, number={3104}, journal={Graphs and Combinatorics}, publisher={Springer Science and Business Media LLC}, author={Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2022} }","short":"E. Steffen, I.H. Wolf, Graphs and Combinatorics 38 (2022).","apa":"Steffen, E., &#38; Wolf, I. H. (2022). Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. <i>Graphs and Combinatorics</i>, <i>38</i>(3), Article 104. <a href=\"https://doi.org/10.1007/s00373-022-02506-x\">https://doi.org/10.1007/s00373-022-02506-x</a>","chicago":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices.” <i>Graphs and Combinatorics</i> 38, no. 3 (2022). <a href=\"https://doi.org/10.1007/s00373-022-02506-x\">https://doi.org/10.1007/s00373-022-02506-x</a>.","ieee":"E. Steffen and I. H. Wolf, “Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices,” <i>Graphs and Combinatorics</i>, vol. 38, no. 3, Art. no. 104, 2022, doi: <a href=\"https://doi.org/10.1007/s00373-022-02506-x\">10.1007/s00373-022-02506-x</a>.","ama":"Steffen E, Wolf IH. Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. <i>Graphs and Combinatorics</i>. 2022;38(3). doi:<a href=\"https://doi.org/10.1007/s00373-022-02506-x\">10.1007/s00373-022-02506-x</a>"},"date_updated":"2023-05-16T10:41:42Z","volume":38,"author":[{"orcid":"0000-0002-9808-7401","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548","first_name":"Eckhard"},{"first_name":"Isaak Hieronymus","full_name":"Wolf, Isaak Hieronymus","id":"88145","last_name":"Wolf"}],"doi":"10.1007/s00373-022-02506-x","publication":"Graphs and Combinatorics","external_id":{"arxiv":["2109.11447"]},"keyword":["Discrete Mathematics and Combinatorics","Theoretical Computer Science"],"language":[{"iso":"eng"}],"issue":"3","year":"2022","publisher":"Springer Science and Business Media LLC","date_created":"2022-05-31T06:13:57Z","title":"Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices"},{"date_created":"2022-10-11T08:17:02Z","publisher":"Elsevier BV","title":"Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms","quality_controlled":"1","year":"2022","language":[{"iso":"eng"}],"keyword":["Artificial Intelligence","Computer Graphics and Computer-Aided Design","Computer Networks and Communications","Hardware and Architecture","Theoretical Computer Science","Software"],"publication":"Parallel Computing","volume":111,"author":[{"first_name":"Robert","orcid":"0000-0002-6268-539","last_name":"Schade","full_name":"Schade, Robert","id":"75963"},{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"full_name":"Elgabarty, Hossam","id":"60250","last_name":"Elgabarty","orcid":"0000-0002-4945-1481","first_name":"Hossam"},{"orcid":"0000-0002-5708-7632","last_name":"Lass","full_name":"Lass, Michael","id":"24135","first_name":"Michael"},{"full_name":"Schütt, Ole","last_name":"Schütt","first_name":"Ole"},{"first_name":"Alfio","last_name":"Lazzaro","full_name":"Lazzaro, Alfio"},{"first_name":"Hans","full_name":"Pabst, Hans","last_name":"Pabst"},{"last_name":"Mohr","full_name":"Mohr, Stephan","first_name":"Stephan"},{"first_name":"Jürg","full_name":"Hutter, Jürg","last_name":"Hutter"},{"first_name":"Thomas","last_name":"Kühne","id":"49079","full_name":"Kühne, Thomas"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}],"oa":"1","date_updated":"2023-08-02T15:03:55Z","doi":"10.1016/j.parco.2022.102920","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0167819122000242","open_access":"1"}],"publication_identifier":{"issn":["0167-8191"]},"publication_status":"published","intvolume":"       111","citation":{"apa":"Schade, R., Kenter, T., Elgabarty, H., Lass, M., Schütt, O., Lazzaro, A., Pabst, H., Mohr, S., Hutter, J., Kühne, T., &#38; Plessl, C. (2022). Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms. <i>Parallel Computing</i>, <i>111</i>, Article 102920. <a href=\"https://doi.org/10.1016/j.parco.2022.102920\">https://doi.org/10.1016/j.parco.2022.102920</a>","bibtex":"@article{Schade_Kenter_Elgabarty_Lass_Schütt_Lazzaro_Pabst_Mohr_Hutter_Kühne_et al._2022, title={Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms}, volume={111}, DOI={<a href=\"https://doi.org/10.1016/j.parco.2022.102920\">10.1016/j.parco.2022.102920</a>}, number={102920}, journal={Parallel Computing}, publisher={Elsevier BV}, 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 et al.}, year={2022} }","short":"R. Schade, T. Kenter, H. Elgabarty, M. Lass, O. Schütt, A. Lazzaro, H. Pabst, S. Mohr, J. Hutter, T. Kühne, C. Plessl, Parallel Computing 111 (2022).","mla":"Schade, Robert, et al. “Towards Electronic Structure-Based Ab-Initio Molecular Dynamics Simulations with Hundreds of Millions of Atoms.” <i>Parallel Computing</i>, vol. 111, 102920, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.parco.2022.102920\">10.1016/j.parco.2022.102920</a>.","ama":"Schade R, Kenter T, Elgabarty H, et al. Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms. <i>Parallel Computing</i>. 2022;111. doi:<a href=\"https://doi.org/10.1016/j.parco.2022.102920\">10.1016/j.parco.2022.102920</a>","chicago":"Schade, Robert, Tobias Kenter, Hossam Elgabarty, Michael Lass, Ole Schütt, Alfio Lazzaro, Hans Pabst, et al. “Towards Electronic Structure-Based Ab-Initio Molecular Dynamics Simulations with Hundreds of Millions of Atoms.” <i>Parallel Computing</i> 111 (2022). <a href=\"https://doi.org/10.1016/j.parco.2022.102920\">https://doi.org/10.1016/j.parco.2022.102920</a>.","ieee":"R. Schade <i>et al.</i>, “Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms,” <i>Parallel Computing</i>, vol. 111, Art. no. 102920, 2022, doi: <a href=\"https://doi.org/10.1016/j.parco.2022.102920\">10.1016/j.parco.2022.102920</a>."},"department":[{"_id":"613"},{"_id":"27"},{"_id":"518"}],"user_id":"75963","_id":"33684","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"article_number":"102920","type":"journal_article","status":"public"},{"keyword":["Computational Theory and Mathematics","Hardware and Architecture","Theoretical Computer Science","Software"],"language":[{"iso":"eng"}],"_id":"30907","user_id":"398","department":[{"_id":"78"}],"status":"public","type":"journal_article","publication":"IEEE Transactions on Computers","title":"Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs","doi":"10.1109/tc.2021.3107196","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_updated":"2022-04-18T10:04:21Z","date_created":"2022-04-18T10:03:16Z","author":[{"full_name":"Rodriguez, Alfonso","last_name":"Rodriguez","first_name":"Alfonso"},{"last_name":"Otero","full_name":"Otero, Andres","first_name":"Andres"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"first_name":"Eduardo","last_name":"De la Torre","full_name":"De la Torre, Eduardo"}],"year":"2021","citation":{"ieee":"A. Rodriguez, A. Otero, M. Platzner, and E. De la Torre, “Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs,” <i>IEEE Transactions on Computers</i>, pp. 1–1, 2021, doi: <a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>.","chicago":"Rodriguez, Alfonso, Andres Otero, Marco Platzner, and Eduardo De la Torre. “Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs.” <i>IEEE Transactions on Computers</i>, 2021, 1–1. <a href=\"https://doi.org/10.1109/tc.2021.3107196\">https://doi.org/10.1109/tc.2021.3107196</a>.","ama":"Rodriguez A, Otero A, Platzner M, De la Torre E. Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs. <i>IEEE Transactions on Computers</i>. Published online 2021:1-1. doi:<a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>","apa":"Rodriguez, A., Otero, A., Platzner, M., &#38; De la Torre, E. (2021). Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs. <i>IEEE Transactions on Computers</i>, 1–1. <a href=\"https://doi.org/10.1109/tc.2021.3107196\">https://doi.org/10.1109/tc.2021.3107196</a>","mla":"Rodriguez, Alfonso, et al. “Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs.” <i>IEEE Transactions on Computers</i>, Institute of Electrical and Electronics Engineers (IEEE), 2021, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>.","short":"A. Rodriguez, A. Otero, M. Platzner, E. De la Torre, IEEE Transactions on Computers (2021) 1–1.","bibtex":"@article{Rodriguez_Otero_Platzner_De la Torre_2021, title={Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs}, DOI={<a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>}, journal={IEEE Transactions on Computers}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Rodriguez, Alfonso and Otero, Andres and Platzner, Marco and De la Torre, Eduardo}, year={2021}, pages={1–1} }"},"page":"1-1","publication_status":"published","publication_identifier":{"issn":["0018-9340","1557-9956","2326-3814"]}},{"type":"journal_article","publication":"Journal of Combinatorial Theory, Series B","status":"public","user_id":"15540","department":[{"_id":"542"}],"_id":"34042","language":[{"iso":"eng"}],"keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Theoretical Computer Science"],"publication_status":"published","publication_identifier":{"issn":["0095-8956"]},"citation":{"chicago":"Li, Jiaao, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, and Cun-Quan Zhang. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i> 153 (2021): 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>.","ieee":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, and C.-Q. Zhang, “Nowhere-zero 3-flows in toroidal graphs,” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, pp. 61–80, 2021, doi: <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>.","short":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, C.-Q. Zhang, Journal of Combinatorial Theory, Series B 153 (2021) 61–80.","bibtex":"@article{Li_Ma_Miao_Shi_Wang_Zhang_2021, title={Nowhere-zero 3-flows in toroidal graphs}, volume={153}, DOI={<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>}, journal={Journal of Combinatorial Theory, Series B}, publisher={Elsevier BV}, author={Li, Jiaao and Ma, Yulai and Miao, Zhengke and Shi, Yongtang and Wang, Weifan and Zhang, Cun-Quan}, year={2021}, pages={61–80} }","mla":"Li, Jiaao, et al. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, Elsevier BV, 2021, pp. 61–80, doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>.","ama":"Li J, Ma Y, Miao Z, Shi Y, Wang W, Zhang C-Q. Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>. 2021;153:61-80. doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>","apa":"Li, J., Ma, Y., Miao, Z., Shi, Y., Wang, W., &#38; Zhang, C.-Q. (2021). Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>, <i>153</i>, 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>"},"intvolume":"       153","page":"61-80","year":"2021","date_created":"2022-11-09T08:43:55Z","author":[{"first_name":"Jiaao","last_name":"Li","full_name":"Li, Jiaao"},{"last_name":"Ma","id":"92748","full_name":"Ma, Yulai","first_name":"Yulai"},{"first_name":"Zhengke","last_name":"Miao","full_name":"Miao, Zhengke"},{"first_name":"Yongtang","last_name":"Shi","full_name":"Shi, Yongtang"},{"full_name":"Wang, Weifan","last_name":"Wang","first_name":"Weifan"},{"last_name":"Zhang","full_name":"Zhang, Cun-Quan","first_name":"Cun-Quan"}],"volume":153,"date_updated":"2022-11-09T08:44:37Z","publisher":"Elsevier BV","doi":"10.1016/j.jctb.2021.11.001","title":"Nowhere-zero 3-flows in toroidal graphs"},{"_id":"45844","user_id":"99353","department":[{"_id":"574"}],"extern":"1","type":"journal_article","status":"public","date_updated":"2024-06-04T16:03:14Z","author":[{"first_name":"Yasir","full_name":"Mahmood, Yasir","last_name":"Mahmood"},{"first_name":"Arne","full_name":"Meier, Arne","last_name":"Meier"},{"full_name":"Schmidt, Johannes","last_name":"Schmidt","first_name":"Johannes"}],"volume":31,"doi":"10.1093/logcom/exaa079","publication_status":"published","publication_identifier":{"issn":["0955-792X","1465-363X"]},"citation":{"ama":"Mahmood Y, Meier A, Schmidt J. Parameterized complexity of abduction in Schaefer’s framework. <i>Journal of Logic and Computation</i>. 2021;31(1):266-296. doi:<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>","ieee":"Y. Mahmood, A. Meier, and J. Schmidt, “Parameterized complexity of abduction in Schaefer’s framework,” <i>Journal of Logic and Computation</i>, vol. 31, no. 1, pp. 266–296, 2021, doi: <a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>.","chicago":"Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterized Complexity of Abduction in Schaefer’s Framework.” <i>Journal of Logic and Computation</i> 31, no. 1 (2021): 266–96. <a href=\"https://doi.org/10.1093/logcom/exaa079\">https://doi.org/10.1093/logcom/exaa079</a>.","mla":"Mahmood, Yasir, et al. “Parameterized Complexity of Abduction in Schaefer’s Framework.” <i>Journal of Logic and Computation</i>, vol. 31, no. 1, Oxford University Press (OUP), 2021, pp. 266–96, doi:<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>.","bibtex":"@article{Mahmood_Meier_Schmidt_2021, title={Parameterized complexity of abduction in Schaefer’s framework}, volume={31}, DOI={<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>}, number={1}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2021}, pages={266–296} }","short":"Y. Mahmood, A. Meier, J. Schmidt, Journal of Logic and Computation 31 (2021) 266–296.","apa":"Mahmood, Y., Meier, A., &#38; Schmidt, J. (2021). Parameterized complexity of abduction in Schaefer’s framework. <i>Journal of Logic and Computation</i>, <i>31</i>(1), 266–296. <a href=\"https://doi.org/10.1093/logcom/exaa079\">https://doi.org/10.1093/logcom/exaa079</a>"},"page":"266-296","intvolume":"        31","keyword":["Logic","Hardware and Architecture","Arts and Humanities (miscellaneous)","Software","Theoretical Computer Science"],"language":[{"iso":"eng"}],"publication":"Journal of Logic and Computation","abstract":[{"text":"<jats:title>Abstract</jats:title>\r\n               <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>","lang":"eng"}],"publisher":"Oxford University Press (OUP)","date_created":"2023-07-03T11:35:23Z","title":"Parameterized complexity of abduction in Schaefer’s framework","issue":"1","year":"2021"},{"year":"2021","intvolume":"        24","page":"745-770","citation":{"ama":"Stieglitz S, Mirbabaie M, Möllmann NRJ, Rzyski J. Collaborating with Virtual Assistants in Organizations: Analyzing Social Loafing Tendencies and Responsibility Attribution. <i>Information Systems Frontiers</i>. 2021;24(3):745-770. doi:<a href=\"https://doi.org/10.1007/s10796-021-10201-0\">10.1007/s10796-021-10201-0</a>","ieee":"S. Stieglitz, M. Mirbabaie, N. R. J. Möllmann, and J. Rzyski, “Collaborating with Virtual Assistants in Organizations: Analyzing Social Loafing Tendencies and Responsibility Attribution,” <i>Information Systems Frontiers</i>, vol. 24, no. 3, pp. 745–770, 2021, doi: <a href=\"https://doi.org/10.1007/s10796-021-10201-0\">10.1007/s10796-021-10201-0</a>.","chicago":"Stieglitz, Stefan, Milad Mirbabaie, Nicholas R. J. Möllmann, and Jannik Rzyski. “Collaborating with Virtual Assistants in Organizations: Analyzing Social Loafing Tendencies and Responsibility Attribution.” <i>Information Systems Frontiers</i> 24, no. 3 (2021): 745–70. <a href=\"https://doi.org/10.1007/s10796-021-10201-0\">https://doi.org/10.1007/s10796-021-10201-0</a>.","apa":"Stieglitz, S., Mirbabaie, M., Möllmann, N. R. J., &#38; Rzyski, J. (2021). Collaborating with Virtual Assistants in Organizations: Analyzing Social Loafing Tendencies and Responsibility Attribution. <i>Information Systems Frontiers</i>, <i>24</i>(3), 745–770. <a href=\"https://doi.org/10.1007/s10796-021-10201-0\">https://doi.org/10.1007/s10796-021-10201-0</a>","bibtex":"@article{Stieglitz_Mirbabaie_Möllmann_Rzyski_2021, title={Collaborating with Virtual Assistants in Organizations: Analyzing Social Loafing Tendencies and Responsibility Attribution}, volume={24}, DOI={<a href=\"https://doi.org/10.1007/s10796-021-10201-0\">10.1007/s10796-021-10201-0</a>}, number={3}, journal={Information Systems Frontiers}, publisher={Springer Science and Business Media LLC}, author={Stieglitz, Stefan and Mirbabaie, Milad and Möllmann, Nicholas R. J. and Rzyski, Jannik}, year={2021}, pages={745–770} }","mla":"Stieglitz, Stefan, et al. “Collaborating with Virtual Assistants in Organizations: Analyzing Social Loafing Tendencies and Responsibility Attribution.” <i>Information Systems Frontiers</i>, vol. 24, no. 3, Springer Science and Business Media LLC, 2021, pp. 745–70, doi:<a href=\"https://doi.org/10.1007/s10796-021-10201-0\">10.1007/s10796-021-10201-0</a>.","short":"S. Stieglitz, M. Mirbabaie, N.R.J. Möllmann, J. Rzyski, Information Systems Frontiers 24 (2021) 745–770."},"publication_identifier":{"issn":["1387-3326","1572-9419"]},"publication_status":"published","issue":"3","title":"Collaborating with Virtual Assistants in Organizations: Analyzing Social Loafing Tendencies and Responsibility Attribution","doi":"10.1007/s10796-021-10201-0","date_updated":"2023-01-18T07:57:25Z","publisher":"Springer Science and Business Media LLC","volume":24,"date_created":"2023-01-17T15:25:22Z","author":[{"first_name":"Stefan","last_name":"Stieglitz","full_name":"Stieglitz, Stefan"},{"last_name":"Mirbabaie","id":"88691","full_name":"Mirbabaie, Milad","first_name":"Milad"},{"full_name":"Möllmann, Nicholas R. J.","last_name":"Möllmann","first_name":"Nicholas R. J."},{"last_name":"Rzyski","full_name":"Rzyski, Jannik","first_name":"Jannik"}],"abstract":[{"text":"<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>","lang":"eng"}],"status":"public","publication":"Information Systems Frontiers","type":"journal_article","keyword":["Computer Networks and Communications","Information Systems","Theoretical Computer Science","Software"],"language":[{"iso":"eng"}],"_id":"37146","user_id":"80546"},{"status":"public","type":"journal_article","publication":"ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE","language":[{"iso":"eng"}],"keyword":["Mathematics (miscellaneous)","Theoretical Computer Science"],"user_id":"31496","_id":"53333","citation":{"bibtex":"@article{Winkler_2021, title={$L^1$ solutions to parabolic Keller-Segel systems involving arbitrary superlinear degradation}, DOI={<a href=\"https://doi.org/10.2422/2036-2145.202005_016\">10.2422/2036-2145.202005_016</a>}, journal={ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE}, publisher={Scuola Normale Superiore - Edizioni della Normale}, author={Winkler, Michael}, year={2021}, pages={141–172} }","mla":"Winkler, Michael. “$L^1$ Solutions to Parabolic Keller-Segel Systems Involving Arbitrary Superlinear Degradation.” <i>ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE</i>, Scuola Normale Superiore - Edizioni della Normale, 2021, pp. 141–72, doi:<a href=\"https://doi.org/10.2422/2036-2145.202005_016\">10.2422/2036-2145.202005_016</a>.","short":"M. Winkler, ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE (2021) 141–172.","apa":"Winkler, M. (2021). $L^1$ solutions to parabolic Keller-Segel systems involving arbitrary superlinear degradation. <i>ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE</i>, 141–172. <a href=\"https://doi.org/10.2422/2036-2145.202005_016\">https://doi.org/10.2422/2036-2145.202005_016</a>","ama":"Winkler M. $L^1$ solutions to parabolic Keller-Segel systems involving arbitrary superlinear degradation. <i>ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE</i>. Published online 2021:141-172. doi:<a href=\"https://doi.org/10.2422/2036-2145.202005_016\">10.2422/2036-2145.202005_016</a>","chicago":"Winkler, Michael. “$L^1$ Solutions to Parabolic Keller-Segel Systems Involving Arbitrary Superlinear Degradation.” <i>ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE</i>, 2021, 141–72. <a href=\"https://doi.org/10.2422/2036-2145.202005_016\">https://doi.org/10.2422/2036-2145.202005_016</a>.","ieee":"M. Winkler, “$L^1$ solutions to parabolic Keller-Segel systems involving arbitrary superlinear degradation,” <i>ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE</i>, pp. 141–172, 2021, doi: <a href=\"https://doi.org/10.2422/2036-2145.202005_016\">10.2422/2036-2145.202005_016</a>."},"page":"141-172","year":"2021","publication_status":"published","publication_identifier":{"issn":["2036-2145","0391-173X"]},"doi":"10.2422/2036-2145.202005_016","title":"$L^1$ solutions to parabolic Keller-Segel systems involving arbitrary superlinear degradation","author":[{"id":"31496","full_name":"Winkler, Michael","last_name":"Winkler","first_name":"Michael"}],"date_created":"2024-04-07T12:45:49Z","date_updated":"2025-12-18T20:15:27Z","publisher":"Scuola Normale Superiore - Edizioni della Normale"},{"publication":"IEEE Transactions on Computers","type":"journal_article","status":"public","department":[{"_id":"48"}],"user_id":"78614","_id":"46266","language":[{"iso":"eng"}],"extern":"1","keyword":["Computational Theory and Mathematics","Hardware and Architecture","Theoretical Computer Science","Software"],"publication_identifier":{"issn":["0018-9340"]},"publication_status":"published","page":"1-1","citation":{"ama":"Alizadeh B, Behnam P, Sadeghi-Kohan S. A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs. <i>IEEE Transactions on Computers</i>. Published online 2014:1-1. doi:<a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>","ieee":"B. Alizadeh, P. Behnam, and S. Sadeghi-Kohan, “A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs,” <i>IEEE Transactions on Computers</i>, pp. 1–1, 2014, doi: <a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>.","chicago":"Alizadeh, Bijan, Payman Behnam, and Somayeh Sadeghi-Kohan. “A Scalable Formal Debugging Approach with Auto-Correction Capability Based on Static Slicing and Dynamic Ranking for RTL Datapath Designs.” <i>IEEE Transactions on Computers</i>, 2014, 1–1. <a href=\"https://doi.org/10.1109/tc.2014.2329687\">https://doi.org/10.1109/tc.2014.2329687</a>.","mla":"Alizadeh, Bijan, et al. “A Scalable Formal Debugging Approach with Auto-Correction Capability Based on Static Slicing and Dynamic Ranking for RTL Datapath Designs.” <i>IEEE Transactions on Computers</i>, Institute of Electrical and Electronics Engineers (IEEE), 2014, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>.","short":"B. Alizadeh, P. Behnam, S. Sadeghi-Kohan, IEEE Transactions on Computers (2014) 1–1.","bibtex":"@article{Alizadeh_Behnam_Sadeghi-Kohan_2014, title={A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs}, DOI={<a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>}, journal={IEEE Transactions on Computers}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Alizadeh, Bijan and Behnam, Payman and Sadeghi-Kohan, Somayeh}, year={2014}, pages={1–1} }","apa":"Alizadeh, B., Behnam, P., &#38; Sadeghi-Kohan, S. (2014). A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs. <i>IEEE Transactions on Computers</i>, 1–1. <a href=\"https://doi.org/10.1109/tc.2014.2329687\">https://doi.org/10.1109/tc.2014.2329687</a>"},"year":"2014","date_created":"2023-08-02T11:15:22Z","author":[{"first_name":"Bijan","full_name":"Alizadeh, Bijan","last_name":"Alizadeh"},{"first_name":"Payman","full_name":"Behnam, Payman","last_name":"Behnam"},{"full_name":"Sadeghi-Kohan, Somayeh","id":"78614","orcid":"https://orcid.org/0000-0001-7246-0610","last_name":"Sadeghi-Kohan","first_name":"Somayeh"}],"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_updated":"2023-08-02T11:32:37Z","doi":"10.1109/tc.2014.2329687","title":"A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs"}]