[{"intvolume":"        43","publication_status":"published","date_updated":"2025-06-23T09:01:46Z","publication_identifier":{"issn":["0167-7055","1467-8659"]},"author":[{"full_name":"Brückler, Hendrik","first_name":"Hendrik","last_name":"Brückler","id":"115694"},{"first_name":"David","last_name":"Bommes","full_name":"Bommes, David"},{"id":"114904","full_name":"Campen, Marcel","last_name":"Campen","orcid":"0000-0003-2340-3462","first_name":"Marcel"}],"year":"2024","title":"Integer‐Sheet‐Pump Quantization for Hexahedral Meshing","doi":"10.1111/cgf.15131","language":[{"iso":"eng"}],"extern":"1","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Several state‐of‐the‐art algorithms for semi‐structured hexahedral meshing involve a so called <jats:italic>quantization</jats:italic> step to decide on the integer DoFs of the meshing problem, corresponding to the number of hexahedral elements to embed into certain regions of the domain. Existing reliable methods for quantization are based on solving a sequence of <jats:italic>integer quadratic programs</jats:italic> (IQP). Solving these in a timely and predictable manner with general‐purpose solvers is a challenge, even more so in the open‐source field. We present here an alternative robust and efficient quantization scheme that is instead based on solving a series of continuous <jats:italic>linear programs</jats:italic> (LP), for which solver availability and efficiency are not an issue. In our formulation, such LPs are used to determine where inflation or deflation of virtual hexahedral sheets are favorable. We compare our method to two implementations of the former IQP formulation (using a commercial and an open‐source MIP solver, respectively), finding that (a) the solutions found by our method are near‐optimal or optimal in most cases, (b) these solutions are found within a much more predictable time frame, and (c) the state of the art run time is outperformed, in the case of using the open‐source solver by orders of magnitude.</jats:p>"}],"publication":"Comput. Graph. Forum","issue":"5","department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-11T13:47:29Z","status":"public","volume":43,"user_id":"114904","_id":"60189","publisher":"Wiley","citation":{"short":"H. Brückler, D. Bommes, M. Campen, Comput. Graph. Forum 43 (2024).","chicago":"Brückler, Hendrik, David Bommes, and Marcel Campen. “Integer‐Sheet‐Pump Quantization for Hexahedral Meshing.” <i>Comput. Graph. Forum</i> 43, no. 5 (2024). <a href=\"https://doi.org/10.1111/cgf.15131\">https://doi.org/10.1111/cgf.15131</a>.","apa":"Brückler, H., Bommes, D., &#38; Campen, M. (2024). Integer‐Sheet‐Pump Quantization for Hexahedral Meshing. <i>Comput. Graph. Forum</i>, <i>43</i>(5). <a href=\"https://doi.org/10.1111/cgf.15131\">https://doi.org/10.1111/cgf.15131</a>","ieee":"H. Brückler, D. Bommes, and M. Campen, “Integer‐Sheet‐Pump Quantization for Hexahedral Meshing,” <i>Comput. Graph. Forum</i>, vol. 43, no. 5, 2024, doi: <a href=\"https://doi.org/10.1111/cgf.15131\">10.1111/cgf.15131</a>.","ama":"Brückler H, Bommes D, Campen M. Integer‐Sheet‐Pump Quantization for Hexahedral Meshing. <i>Comput Graph Forum</i>. 2024;43(5). doi:<a href=\"https://doi.org/10.1111/cgf.15131\">10.1111/cgf.15131</a>","bibtex":"@article{Brückler_Bommes_Campen_2024, title={Integer‐Sheet‐Pump Quantization for Hexahedral Meshing}, volume={43}, DOI={<a href=\"https://doi.org/10.1111/cgf.15131\">10.1111/cgf.15131</a>}, number={5}, journal={Comput. Graph. Forum}, publisher={Wiley}, author={Brückler, Hendrik and Bommes, David and Campen, Marcel}, year={2024} }","mla":"Brückler, Hendrik, et al. “Integer‐Sheet‐Pump Quantization for Hexahedral Meshing.” <i>Comput. Graph. Forum</i>, vol. 43, no. 5, Wiley, 2024, doi:<a href=\"https://doi.org/10.1111/cgf.15131\">10.1111/cgf.15131</a>."}},{"user_id":"114904","doi":"10.1111/CGF.15241","volume":43,"page":"i–xxii","language":[{"iso":"eng"}],"_id":"60240","date_updated":"2025-06-23T09:01:59Z","intvolume":"        43","status":"public","year":"2024","title":"Strictly Conservative Neural Implicits","author":[{"id":"116667","full_name":"Ludwig, Ingmar","first_name":"Ingmar","last_name":"Ludwig"},{"full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","id":"114904"}],"type":"journal_article","department":[{"_id":"969"}],"date_created":"2025-06-17T07:46:09Z","extern":"1","issue":"7","publication":"Comput. Graph. Forum","citation":{"chicago":"Ludwig, Ingmar, and Marcel Campen. “Strictly Conservative Neural Implicits.” <i>Comput. Graph. Forum</i> 43, no. 7 (2024): i–xxii. <a href=\"https://doi.org/10.1111/CGF.15241\">https://doi.org/10.1111/CGF.15241</a>.","short":"I. Ludwig, M. Campen, Comput. Graph. Forum 43 (2024) i–xxii.","apa":"Ludwig, I., &#38; Campen, M. (2024). Strictly Conservative Neural Implicits. <i>Comput. Graph. Forum</i>, <i>43</i>(7), i–xxii. <a href=\"https://doi.org/10.1111/CGF.15241\">https://doi.org/10.1111/CGF.15241</a>","ieee":"I. Ludwig and M. Campen, “Strictly Conservative Neural Implicits,” <i>Comput. Graph. Forum</i>, vol. 43, no. 7, pp. i–xxii, 2024, doi: <a href=\"https://doi.org/10.1111/CGF.15241\">10.1111/CGF.15241</a>.","ama":"Ludwig I, Campen M. Strictly Conservative Neural Implicits. <i>Comput Graph Forum</i>. 2024;43(7):i–xxii. doi:<a href=\"https://doi.org/10.1111/CGF.15241\">10.1111/CGF.15241</a>","bibtex":"@article{Ludwig_Campen_2024, title={Strictly Conservative Neural Implicits}, volume={43}, DOI={<a href=\"https://doi.org/10.1111/CGF.15241\">10.1111/CGF.15241</a>}, number={7}, journal={Comput. Graph. Forum}, author={Ludwig, Ingmar and Campen, Marcel}, year={2024}, pages={i–xxii} }","mla":"Ludwig, Ingmar, and Marcel Campen. “Strictly Conservative Neural Implicits.” <i>Comput. Graph. Forum</i>, vol. 43, no. 7, 2024, pp. i–xxii, doi:<a href=\"https://doi.org/10.1111/CGF.15241\">10.1111/CGF.15241</a>."}},{"status":"public","user_id":"117512","volume":43,"page":"1-11","_id":"60314","publisher":"Association for Computing Machinery (ACM)","citation":{"bibtex":"@article{Hinderink_Brückler_Campen_2024, title={Bijective Volumetric Mapping via Star Decomposition}, volume={43}, DOI={<a href=\"https://doi.org/10.1145/3687950\">10.1145/3687950</a>}, number={6}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Hinderink, Steffen and Brückler, Hendrik and Campen, Marcel}, year={2024}, pages={1–11} }","ama":"Hinderink S, Brückler H, Campen M. Bijective Volumetric Mapping via Star Decomposition. <i>ACM Transactions on Graphics</i>. 2024;43(6):1-11. doi:<a href=\"https://doi.org/10.1145/3687950\">10.1145/3687950</a>","mla":"Hinderink, Steffen, et al. “Bijective Volumetric Mapping via Star Decomposition.” <i>ACM Transactions on Graphics</i>, vol. 43, no. 6, Association for Computing Machinery (ACM), 2024, pp. 1–11, doi:<a href=\"https://doi.org/10.1145/3687950\">10.1145/3687950</a>.","short":"S. Hinderink, H. Brückler, M. Campen, ACM Transactions on Graphics 43 (2024) 1–11.","chicago":"Hinderink, Steffen, Hendrik Brückler, and Marcel Campen. “Bijective Volumetric Mapping via Star Decomposition.” <i>ACM Transactions on Graphics</i> 43, no. 6 (2024): 1–11. <a href=\"https://doi.org/10.1145/3687950\">https://doi.org/10.1145/3687950</a>.","ieee":"S. Hinderink, H. Brückler, and M. Campen, “Bijective Volumetric Mapping via Star Decomposition,” <i>ACM Transactions on Graphics</i>, vol. 43, no. 6, pp. 1–11, 2024, doi: <a href=\"https://doi.org/10.1145/3687950\">10.1145/3687950</a>.","apa":"Hinderink, S., Brückler, H., &#38; Campen, M. (2024). Bijective Volumetric Mapping via Star Decomposition. <i>ACM Transactions on Graphics</i>, <i>43</i>(6), 1–11. <a href=\"https://doi.org/10.1145/3687950\">https://doi.org/10.1145/3687950</a>"},"publication_status":"published","date_updated":"2025-07-14T12:33:54Z","intvolume":"        43","year":"2024","title":"Bijective Volumetric Mapping via Star Decomposition","author":[{"id":"116615","first_name":"Steffen","last_name":"Hinderink","full_name":"Hinderink, Steffen"},{"full_name":"Brückler, Hendrik","first_name":"Hendrik","last_name":"Brückler","id":"115694"},{"id":"114904","last_name":"Campen","orcid":"0000-0003-2340-3462","first_name":"Marcel","full_name":"Campen, Marcel"}],"publication_identifier":{"issn":["0730-0301","1557-7368"]},"doi":"10.1145/3687950","language":[{"iso":"eng"}],"extern":"1","abstract":[{"lang":"eng","text":"<jats:p>A method for the construction of bijective volumetric maps between 3D shapes is presented. Arbitrary shapes of ball-topology are supported, overcoming restrictions of previous methods to convex or star-shaped targets. In essence, the mapping problem is decomposed into a set of simpler mapping problems, each of which can be solved with previous methods for discrete star-shaped mapping problems. Addressing the key challenges in this endeavor, algorithms are described to reliably construct structurally compatible partitions of two shapes with constraints regarding star-shapedness and to compute a parsimonious common refinement of two triangulations.</jats:p>"}],"publication":"ACM Transactions on Graphics","issue":"6","type":"journal_article","department":[{"_id":"969"}],"date_created":"2025-06-23T09:09:51Z"},{"status":"public","_id":"60331","publisher":"Association for Computing Machinery (ACM)","page":"1-14","volume":43,"user_id":"117512","citation":{"chicago":"Nigolian, Valentin Zénon, Marcel Campen, and David Bommes. “A Progressive Embedding Approach to Bijective Tetrahedral Maps Driven by Cluster Mesh Topology.” <i>ACM Transactions on Graphics</i> 43, no. 6 (2024): 1–14. <a href=\"https://doi.org/10.1145/3687992\">https://doi.org/10.1145/3687992</a>.","short":"V.Z. Nigolian, M. Campen, D. Bommes, ACM Transactions on Graphics 43 (2024) 1–14.","ieee":"V. Z. Nigolian, M. Campen, and D. Bommes, “A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology,” <i>ACM Transactions on Graphics</i>, vol. 43, no. 6, pp. 1–14, 2024, doi: <a href=\"https://doi.org/10.1145/3687992\">10.1145/3687992</a>.","apa":"Nigolian, V. Z., Campen, M., &#38; Bommes, D. (2024). A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology. <i>ACM Transactions on Graphics</i>, <i>43</i>(6), 1–14. <a href=\"https://doi.org/10.1145/3687992\">https://doi.org/10.1145/3687992</a>","bibtex":"@article{Nigolian_Campen_Bommes_2024, title={A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology}, volume={43}, DOI={<a href=\"https://doi.org/10.1145/3687992\">10.1145/3687992</a>}, number={6}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Nigolian, Valentin Zénon and Campen, Marcel and Bommes, David}, year={2024}, pages={1–14} }","ama":"Nigolian VZ, Campen M, Bommes D. A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology. <i>ACM Transactions on Graphics</i>. 2024;43(6):1-14. doi:<a href=\"https://doi.org/10.1145/3687992\">10.1145/3687992</a>","mla":"Nigolian, Valentin Zénon, et al. “A Progressive Embedding Approach to Bijective Tetrahedral Maps Driven by Cluster Mesh Topology.” <i>ACM Transactions on Graphics</i>, vol. 43, no. 6, Association for Computing Machinery (ACM), 2024, pp. 1–14, doi:<a href=\"https://doi.org/10.1145/3687992\">10.1145/3687992</a>."},"publication_identifier":{"issn":["0730-0301","1557-7368"]},"author":[{"first_name":"Valentin Zénon","last_name":"Nigolian","full_name":"Nigolian, Valentin Zénon"},{"id":"114904","full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen"},{"full_name":"Bommes, David","last_name":"Bommes","first_name":"David"}],"title":"A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology","year":"2024","intvolume":"        43","publication_status":"published","date_updated":"2025-07-14T12:48:45Z","language":[{"iso":"eng"}],"doi":"10.1145/3687992","publication":"ACM Transactions on Graphics","issue":"6","extern":"1","abstract":[{"text":"<jats:p>\r\n            We present a novel algorithm to map ball-topology tetrahedral meshes onto star-shaped domains with guarantees regarding bijectivity. Our algorithm is based on the recently introduced idea of Shrink-and-Expand, where images of interior vertices are initially clustered at one point (Shrink-), before being sequentially moved to non-degenerate positions yielding a bijective map (-and-Expand). In this context, we introduce the concept of the\r\n            <jats:italic>cluster mesh</jats:italic>\r\n            , i.e. the unexpanded interior mesh consisting of geometrically degenerate simplices. Using local, per-vertex connectivity information solely from the cluster mesh, we show that a viable expansion sequence guaranteed to produce a bijective map can always be found as long as the mesh is\r\n            <jats:italic>shellable.</jats:italic>\r\n            In addition to robustness guarantees for this ubiquitous class of inputs, other practically relevant benefits include improved parsimony and reduced algorithmic complexity. While inheriting some of the worst-case high run time requirements of the state of the art, significant acceleration for the average case is experimentally demonstrated.\r\n          </jats:p>","lang":"eng"}],"date_created":"2025-06-23T10:32:28Z","department":[{"_id":"969"}],"type":"journal_article"},{"editor":[{"first_name":"Davide","last_name":"Balzarotti","full_name":"Balzarotti, Davide"},{"full_name":"Xu, Wenyuan","last_name":"Xu","first_name":"Wenyuan"}],"user_id":"15458","_id":"55637","language":[{"iso":"eng"}],"publisher":"USENIX Association","date_updated":"2025-09-04T11:19:24Z","author":[{"full_name":"Kostan, Anastassija","first_name":"Anastassija","last_name":"Kostan"},{"full_name":"Olschar, Sara","last_name":"Olschar","first_name":"Sara"},{"first_name":"Lucy","last_name":"Simko","full_name":"Simko, Lucy"},{"id":"94636","first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin"}],"status":"public","year":"2024","title":"Exploring digital security and privacy in relative poverty in Germany through qualitative interviews","department":[{"_id":"740"}],"type":"conference","date_created":"2024-08-19T08:27:57Z","citation":{"bibtex":"@inproceedings{Kostan_Olschar_Simko_Acar_2024, title={Exploring digital security and privacy in relative poverty in Germany through qualitative interviews}, booktitle={33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024}, publisher={USENIX Association}, author={Kostan, Anastassija and Olschar, Sara and Simko, Lucy and Acar, Yasemin}, editor={Balzarotti, Davide and Xu, Wenyuan}, year={2024} }","ama":"Kostan A, Olschar S, Simko L, Acar Y. Exploring digital security and privacy in relative poverty in Germany through qualitative interviews. In: Balzarotti D, Xu W, eds. <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>. USENIX Association; 2024.","mla":"Kostan, Anastassija, et al. “Exploring Digital Security and Privacy in Relative Poverty in Germany through Qualitative Interviews.” <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>, edited by Davide Balzarotti and Wenyuan Xu, USENIX Association, 2024.","short":"A. Kostan, S. Olschar, L. Simko, Y. Acar, in: D. Balzarotti, W. Xu (Eds.), 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024, USENIX Association, 2024.","chicago":"Kostan, Anastassija, Sara Olschar, Lucy Simko, and Yasemin Acar. “Exploring Digital Security and Privacy in Relative Poverty in Germany through Qualitative Interviews.” In <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>, edited by Davide Balzarotti and Wenyuan Xu. USENIX Association, 2024.","ieee":"A. Kostan, S. Olschar, L. Simko, and Y. Acar, “Exploring digital security and privacy in relative poverty in Germany through qualitative interviews,” in <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>, 2024.","apa":"Kostan, A., Olschar, S., Simko, L., &#38; Acar, Y. (2024). Exploring digital security and privacy in relative poverty in Germany through qualitative interviews. In D. Balzarotti &#38; W. Xu (Eds.), <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>. USENIX Association."},"publication":"33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024"},{"project":[{"name":"SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen","_id":"5"}],"citation":{"bibtex":"@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing Schemes for Hybrid Communication Networks}, volume={985}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>}, number={114352}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp and Werthmann, Julian}, year={2024} }","ama":"Coy S, Czumaj A, Scheideler C, Schneider P, Werthmann J. Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>. 2024;985. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>","mla":"Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i>, vol. 985, 114352, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>.","short":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical Computer Science 985 (2024).","chicago":"Coy, Sam, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian Werthmann. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i> 985 (2024). <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>.","ieee":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing Schemes for Hybrid Communication Networks,” <i>Theoretical Computer Science</i>, vol. 985, Art. no. 114352, 2024, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>.","apa":"Coy, S., Czumaj, A., Scheideler, C., Schneider, P., &#38; Werthmann, J. (2024). Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>, <i>985</i>, Article 114352. <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>"},"volume":985,"user_id":"50024","_id":"61172","publisher":"Elsevier BV","status":"public","department":[{"_id":"79"}],"type":"journal_article","date_created":"2025-09-10T14:26:11Z","publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2023.114352","language":[{"iso":"eng"}],"article_number":"114352","intvolume":"       985","publication_status":"published","date_updated":"2025-09-10T14:52:21Z","author":[{"last_name":"Coy","first_name":"Sam","full_name":"Coy, Sam"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Schneider, Philipp","first_name":"Philipp","last_name":"Schneider"},{"full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian","id":"50024"}],"publication_identifier":{"issn":["0304-3975"]},"title":"Routing Schemes for Hybrid Communication Networks","year":"2024"},{"department":[{"_id":"574"}],"type":"conference","date_created":"2025-01-27T15:30:41Z","external_id":{"arxiv":["2412.11617"]},"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"abstract":[{"text":"The connection between inconsistent databases and Dung's abstract\r\nargumentation framework has recently drawn growing interest. Specifically, an\r\ninconsistent database, involving certain types of integrity constraints such as\r\nfunctional and inclusion dependencies, can be viewed as an argumentation\r\nframework in Dung's setting. Nevertheless, no prior work has explored the exact\r\nexpressive power of Dung's theory of argumentation when compared to\r\ninconsistent databases and integrity constraints. In this paper, we close this\r\ngap by arguing that an argumentation framework can also be viewed as an\r\ninconsistent database. We first establish a connection between subset-repairs\r\nfor databases and extensions for AFs, considering conflict-free, naive,\r\nadmissible, and preferred semantics. Further, we define a new family of\r\nattribute-based repairs based on the principle of maximal content preservation.\r\nThe effectiveness of these repairs is then highlighted by connecting them to\r\nstable, semi-stable, and stage semantics. Our main contributions include\r\ntranslating an argumentation framework into a database together with integrity\r\nconstraints. Moreover, this translation can be achieved in polynomial time,\r\nwhich is essential in transferring complexity results between the two\r\nformalisms.","lang":"eng"}],"citation":{"apa":"Mahmood, Y., Hecher, M., &#38; Ngonga Ngomo, A.-C. (2024). <i>Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases</i>. <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">https://doi.org/10.1609/AAAI.V39I14.33651</a>","ieee":"Y. Mahmood, M. Hecher, and A.-C. Ngonga Ngomo, “Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases,” 2024, doi: <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>.","short":"Y. Mahmood, M. Hecher, A.-C. Ngonga Ngomo, in: 2024.","chicago":"Mahmood, Yasir, Markus Hecher, and Axel-Cyrille Ngonga Ngomo. “Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases,” 2024. <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">https://doi.org/10.1609/AAAI.V39I14.33651</a>.","mla":"Mahmood, Yasir, et al. <i>Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases</i>. 2024, doi:<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>.","ama":"Mahmood Y, Hecher M, Ngonga Ngomo A-C. Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases. In: ; 2024. doi:<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>","bibtex":"@inproceedings{Mahmood_Hecher_Ngonga Ngomo_2024, title={Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases}, DOI={<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>}, author={Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}, year={2024} }"},"user_id":"99353","doi":"10.1609/AAAI.V39I14.33651","language":[{"iso":"eng"}],"_id":"58377","date_updated":"2025-09-11T10:01:11Z","author":[{"id":"99353","first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir"},{"first_name":"Markus","last_name":"Hecher","full_name":"Hecher, Markus"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"title":"Dung's Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases","status":"public","year":"2024"},{"status":"public","year":"2024","title":"Rejection in Abstract Argumentation: Harder Than Acceptance?","conference":{"location":"Santiago de Compostela, Spain","name":"ECAI} 2024 - 27th European Conference on Artificial Intelligence"},"author":[{"last_name":"Fichte","first_name":"Johannes K.","full_name":"Fichte, Johannes K."},{"first_name":"Markus","last_name":"Hecher","full_name":"Hecher, Markus"},{"full_name":"Mahmood, Yasir","first_name":"Yasir","last_name":"Mahmood","id":"99353"},{"last_name":"Meier","first_name":"Arne","full_name":"Meier, Arne"}],"publication_identifier":{"issn":["0922-6389","1879-8314"],"isbn":["9781643685489"]},"date_updated":"2025-09-11T10:01:52Z","publication_status":"published","_id":"57238","publisher":"IOS Press","language":[{"iso":"eng"}],"doi":"10.3233/faia240867","user_id":"99353","publication":"Frontiers in Artificial Intelligence and Applications","citation":{"ieee":"J. K. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Rejection in Abstract Argumentation: Harder Than Acceptance?,” in <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024.","apa":"Fichte, J. K., Hecher, M., Mahmood, Y., &#38; Meier, A. (2024). Rejection in Abstract Argumentation: Harder Than Acceptance? In <i>Frontiers in Artificial Intelligence and Applications</i>. ECAI} 2024 - 27th European Conference on Artificial Intelligence, Santiago de Compostela, Spain. IOS Press. <a href=\"https://doi.org/10.3233/faia240867\">https://doi.org/10.3233/faia240867</a>","chicago":"Fichte, Johannes K., Markus Hecher, Yasir Mahmood, and Arne Meier. “Rejection in Abstract Argumentation: Harder Than Acceptance?” In <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press, 2024. <a href=\"https://doi.org/10.3233/faia240867\">https://doi.org/10.3233/faia240867</a>.","short":"J.K. Fichte, M. Hecher, Y. Mahmood, A. Meier, in: Frontiers in Artificial Intelligence and Applications, IOS Press, 2024.","mla":"Fichte, Johannes K., et al. “Rejection in Abstract Argumentation: Harder Than Acceptance?” <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024, doi:<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>.","bibtex":"@inbook{Fichte_Hecher_Mahmood_Meier_2024, title={Rejection in Abstract Argumentation: Harder Than Acceptance?}, DOI={<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>}, booktitle={Frontiers in Artificial Intelligence and Applications}, publisher={IOS Press}, author={Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and Meier, Arne}, year={2024} }","ama":"Fichte JK, Hecher M, Mahmood Y, Meier A. Rejection in Abstract Argumentation: Harder Than Acceptance? In: <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press; 2024. doi:<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>"},"abstract":[{"lang":"eng","text":"<jats:p>Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and conditions are placed on sets (extensions) of arguments that allow AFs to be evaluated. For more expressiveness, AFs are augmented with acceptance conditions on directly interacting arguments or a constraint on the admissible sets of arguments, resulting in dialectic frameworks or constrained argumentation frameworks. In this paper, we consider flexible conditions for rejecting an argument from an extension, which we call rejection conditions (RCs). On the technical level, we associate each argument with a specific logic program. We analyze the resulting complexity, including the structural parameter treewidth. Rejection AFs are highly expressive, giving rise to natural problems on higher levels of the polynomial hierarchy.</jats:p>"}],"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"date_created":"2024-11-19T11:46:55Z","type":"book_chapter","department":[{"_id":"574"}]},{"date_created":"2024-08-19T16:21:51Z","department":[{"_id":"574"}],"type":"conference","citation":{"mla":"Hecher, Markus, et al. “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.” <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence Organization, 2024, doi:<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>.","ama":"Hecher M, Mahmood Y, Meier A, Schmidt J. Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. In: <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2024. doi:<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>","bibtex":"@inproceedings{Hecher_Mahmood_Meier_Schmidt_2024, title={Quantitative Claim-Centric Reasoning in Logic-Based Argumentation}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>}, booktitle={Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Hecher, Markus and Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2024} }","apa":"Hecher, M., Mahmood, Y., Meier, A., &#38; Schmidt, J. (2024). Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. <a href=\"https://doi.org/10.24963/ijcai.2024/377\">https://doi.org/10.24963/ijcai.2024/377</a>","ieee":"M. Hecher, Y. Mahmood, A. Meier, and J. Schmidt, “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation,” 2024, doi: <a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>.","short":"M. Hecher, Y. Mahmood, A. Meier, J. Schmidt, in: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2024.","chicago":"Hecher, Markus, Yasir Mahmood, Arne Meier, and Johannes Schmidt. “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.” In <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization, 2024. <a href=\"https://doi.org/10.24963/ijcai.2024/377\">https://doi.org/10.24963/ijcai.2024/377</a>."},"publication":"Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"abstract":[{"text":"<jats:p>Argumentation is a well-established formalism for nonmonotonic reasoning, with popular frameworks being Dung’s abstract argumentation (AFs) or logic-based argumentation (Besnard-Hunter’s framework). Structurally, a set of formulas forms support for a claim if it is consistent, subset-minimal, and implies the claim. Then, an argument comprises support and a claim. We observe that the computational task (ARG) of asking for support of a claim in a knowledge base is “brave”, since many claims with a single support are accepted. As a result, ARG falls short when it comes to the question of confidence in a claim, or claim strength. In this paper, we propose a concept for measuring the (acceptance) strength of claims, based on counting supports for a claim. Further, we settle classical and structural complexity of counting arguments favoring a given claim in propositional knowledge bases (KBs). We introduce quantitative reasoning to measure the strength of claims in a KB and to determine the relevance strength of a formula for a claim.</jats:p>","lang":"eng"}],"_id":"55655","language":[{"iso":"eng"}],"publisher":"International Joint Conferences on Artificial Intelligence Organization","doi":"10.24963/ijcai.2024/377","user_id":"99353","author":[{"full_name":"Hecher, Markus","last_name":"Hecher","first_name":"Markus"},{"id":"99353","last_name":"Mahmood","first_name":"Yasir","full_name":"Mahmood, Yasir"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"},{"full_name":"Schmidt, Johannes","last_name":"Schmidt","first_name":"Johannes"}],"title":"Quantitative Claim-Centric Reasoning in Logic-Based Argumentation","year":"2024","status":"public","date_updated":"2025-09-11T10:02:03Z","publication_status":"published"},{"author":[{"full_name":"Hankala, Teemu","first_name":"Teemu","last_name":"Hankala"},{"full_name":"Hannula, Miika","last_name":"Hannula","first_name":"Miika"},{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"}],"year":"2024","title":"Parameterised Complexity of Consistent Query Answering via Graph  Representations","status":"public","date_updated":"2025-09-11T10:01:35Z","_id":"57814","language":[{"iso":"eng"}],"user_id":"99353","citation":{"short":"T. Hankala, M. Hannula, Y. Mahmood, A. Meier, ArXiv:2412.08324 (2024).","chicago":"Hankala, Teemu, Miika Hannula, Yasir Mahmood, and Arne Meier. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 2024.","apa":"Hankala, T., Hannula, M., Mahmood, Y., &#38; Meier, A. (2024). Parameterised Complexity of Consistent Query Answering via Graph  Representations. In <i>arXiv:2412.08324</i>.","ieee":"T. Hankala, M. Hannula, Y. Mahmood, and A. Meier, “Parameterised Complexity of Consistent Query Answering via Graph  Representations,” <i>arXiv:2412.08324</i>. 2024.","ama":"Hankala T, Hannula M, Mahmood Y, Meier A. Parameterised Complexity of Consistent Query Answering via Graph  Representations. <i>arXiv:241208324</i>. Published online 2024.","bibtex":"@article{Hankala_Hannula_Mahmood_Meier_2024, title={Parameterised Complexity of Consistent Query Answering via Graph  Representations}, journal={arXiv:2412.08324}, author={Hankala, Teemu and Hannula, Miika and Mahmood, Yasir and Meier, Arne}, year={2024} }","mla":"Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 2024."},"publication":"arXiv:2412.08324","project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"abstract":[{"text":"We study consistent query answering via different graph representations.\r\nFirst, we introduce solution-conflict hypergraphs in which nodes represent\r\nfacts and edges represent either conflicts or query solutions. Considering a\r\nmonotonic query and a set of antimonotonic constraints, we present an explicit\r\nalgorithm for counting the number of repairs satisfying the query based on a\r\ntree decomposition of the solution-conflict hypergraph. The algorithm not only\r\nprovides fixed-parameter tractability results for data complexity over\r\nexpressive query and constraint classes, but also introduces a novel and\r\npotentially implementable approach to repair counting. Second, we consider the\r\nGaifman graphs arising from MSO descriptions of consistent query answering.\r\nUsing a generalization of Courcelle's theorem, we then present fixed-parameter\r\ntractability results for combined complexity over expressive query and\r\nconstraint classes.","lang":"eng"}],"date_created":"2024-12-15T20:12:56Z","external_id":{"arxiv":["2412.08324"]},"department":[{"_id":"574"}],"type":"preprint"},{"file":[{"date_created":"2024-09-16T08:55:23Z","creator":"khedkarm","file_id":"56141","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2024-09-16T08:55:23Z","file_name":"2409.06564v1.pdf","file_size":1207856,"access_level":"closed"}],"date_created":"2024-09-16T08:55:34Z","type":"conference","department":[{"_id":"76"}],"publication":"In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)","abstract":[{"text":"    Android apps collecting data from users must comply with legal frameworks to ensure data protection. This requirement has become even more important since the implementation of the General Data Protection Regulation (GDPR) by the European Union in 2018. Moreover, with the proposed Cyber Resilience Act on the horizon, stakeholders will soon need to assess software against even more stringent security and privacy standards. Effective privacy assessments require collaboration among groups with diverse expertise to function effectively as a cohesive unit.\r\n    This paper motivates the need for an automated approach that enhances understanding of data protection in Android apps and improves communication between the various parties involved in privacy assessments. We propose the Assessor View, a tool designed to bridge the knowledge gap between these parties, facilitating more effective privacy assessments of Android applications. ","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1145/3691621.3694953","title":"Advancing Android Privacy Assessments with Automation","year":"2024","author":[{"first_name":"Mugdha","last_name":"Khedkar","full_name":"Khedkar, Mugdha","id":"88024"},{"first_name":"Michael","last_name":"Schlichtig","orcid":"0000-0001-6600-6171","full_name":"Schlichtig, Michael","id":"32312"},{"id":"59256","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden"}],"date_updated":"2026-03-13T12:12:45Z","external_id":{"arxiv":["2409.06564"]},"file_date_updated":"2024-09-16T08:55:23Z","citation":{"mla":"Khedkar, Mugdha, et al. “Advancing Android Privacy Assessments with Automation.” <i>In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)</i>, 2024, doi:<a href=\"https://doi.org/10.1145/3691621.3694953\">10.1145/3691621.3694953</a>.","bibtex":"@inproceedings{Khedkar_Schlichtig_Bodden_2024, title={Advancing Android Privacy Assessments with Automation}, DOI={<a href=\"https://doi.org/10.1145/3691621.3694953\">10.1145/3691621.3694953</a>}, booktitle={In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)}, author={Khedkar, Mugdha and Schlichtig, Michael and Bodden, Eric}, year={2024} }","ama":"Khedkar M, Schlichtig M, Bodden E. Advancing Android Privacy Assessments with Automation. In: <i>In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)</i>. ; 2024. doi:<a href=\"https://doi.org/10.1145/3691621.3694953\">10.1145/3691621.3694953</a>","ieee":"M. Khedkar, M. Schlichtig, and E. Bodden, “Advancing Android Privacy Assessments with Automation,” presented at the 39th IEEE/ACM International Conference on Automated Software Engineering (ASE 2024), Sacramento, California, 2024, doi: <a href=\"https://doi.org/10.1145/3691621.3694953\">10.1145/3691621.3694953</a>.","apa":"Khedkar, M., Schlichtig, M., &#38; Bodden, E. (2024). Advancing Android Privacy Assessments with Automation. <i>In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)</i>. 39th IEEE/ACM International Conference on Automated Software Engineering (ASE 2024), Sacramento, California. <a href=\"https://doi.org/10.1145/3691621.3694953\">https://doi.org/10.1145/3691621.3694953</a>","chicago":"Khedkar, Mugdha, Michael Schlichtig, and Eric Bodden. “Advancing Android Privacy Assessments with Automation.” In <i>In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)</i>, 2024. <a href=\"https://doi.org/10.1145/3691621.3694953\">https://doi.org/10.1145/3691621.3694953</a>.","short":"M. Khedkar, M. Schlichtig, E. Bodden, in: In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24), 2024."},"_id":"56140","user_id":"32312","ddc":["000"],"status":"public","conference":{"location":"Sacramento, California","name":"39th IEEE/ACM International Conference on Automated Software Engineering (ASE 2024)","start_date":"2024-10-27","end_date":"2024-11-01"},"has_accepted_license":"1"},{"date_created":"2026-01-19T11:29:47Z","type":"conference","department":[{"_id":"819"}],"publication":"2024 International Conference on Machine Learning and Applications (ICMLA)","citation":{"apa":"Klüttermann, S., Rutinowski, J., Polachowski, F., Nguyen, A., Grimme, B., Roidl, M., &#38; Müller, E. (2024). On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification. <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>, 1705–1711.","mla":"Klüttermann, Simon, et al. “On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification.” <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>, 2024, pp. 1705–1711.","ieee":"S. Klüttermann <i>et al.</i>, “On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification,” in <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>, 2024, pp. 1705–1711.","chicago":"Klüttermann, Simon, Jérôme Rutinowski, Frederik Polachowski, Anh Nguyen, Britta Grimme, Moritz Roidl, and Emmanuel Müller. “On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification.” In <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>, 1705–1711, 2024.","ama":"Klüttermann S, Rutinowski J, Polachowski F, et al. On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification. In: <i>2024 International Conference on Machine Learning and Applications (ICMLA)</i>. ; 2024:1705–1711.","short":"S. Klüttermann, J. Rutinowski, F. Polachowski, A. Nguyen, B. Grimme, M. Roidl, E. Müller, in: 2024 International Conference on Machine Learning and Applications (ICMLA), 2024, pp. 1705–1711.","bibtex":"@inproceedings{Klüttermann_Rutinowski_Polachowski_Nguyen_Grimme_Roidl_Müller_2024, title={On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification}, booktitle={2024 International Conference on Machine Learning and Applications (ICMLA)}, author={Klüttermann, Simon and Rutinowski, Jérôme and Polachowski, Frederik and Nguyen, Anh and Grimme, Britta and Roidl, Moritz and Müller, Emmanuel}, year={2024}, pages={1705–1711} }"},"page":"1705–1711","language":[{"iso":"eng"}],"_id":"63658","user_id":"103682","status":"public","title":"On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification","year":"2024","author":[{"last_name":"Klüttermann","first_name":"Simon","full_name":"Klüttermann, Simon"},{"last_name":"Rutinowski","first_name":"Jérôme","full_name":"Rutinowski, Jérôme"},{"first_name":"Frederik","last_name":"Polachowski","full_name":"Polachowski, Frederik"},{"full_name":"Nguyen, Anh","last_name":"Nguyen","first_name":"Anh"},{"full_name":"Grimme, Britta","last_name":"Grimme","first_name":"Britta"},{"full_name":"Roidl, Moritz","first_name":"Moritz","last_name":"Roidl"},{"full_name":"Müller, Emmanuel","last_name":"Müller","first_name":"Emmanuel"}],"date_updated":"2026-03-19T07:47:29Z"},{"author":[{"id":"59256","orcid":"0000-0003-3470-3647","last_name":"Bodden","first_name":"Eric","full_name":"Bodden, Eric"},{"orcid":"http://orcid.org/0000-0001-8778-2989","last_name":"Pottebaum","first_name":"Jens","full_name":"Pottebaum, Jens","id":"405"},{"full_name":"Fockel, Markus","first_name":"Markus","last_name":"Fockel","orcid":"0000-0002-1269-0702","id":"8472"},{"full_name":"Gräßler, Iris","orcid":"0000-0001-5765-971X","first_name":"Iris","last_name":"Gräßler","id":"47565"}],"publication_identifier":{"issn":["1540-7993","1558-4046"]},"year":"2024","title":"Evaluating Security Through Isolation and Defense in Depth","intvolume":"        22","date_updated":"2026-03-31T02:19:49Z","publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/10411721"}],"doi":"10.1109/msec.2023.3336028","issue":"1","publication":"IEEE Security & Privacy","date_created":"2024-03-15T20:16:18Z","department":[{"_id":"152"},{"_id":"76"},{"_id":"662"}],"keyword":["Law","Electrical and Electronic Engineering","Computer Networks and Communications"],"type":"journal_article","status":"public","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","_id":"52587","page":"69-72","volume":22,"user_id":"405","citation":{"short":"E. Bodden, J. Pottebaum, M. Fockel, I. Gräßler, IEEE Security &#38; Privacy 22 (2024) 69–72.","chicago":"Bodden, Eric, Jens Pottebaum, Markus Fockel, and Iris Gräßler. “Evaluating Security Through Isolation and Defense in Depth.” <i>IEEE Security &#38; Privacy</i> 22, no. 1 (2024): 69–72. <a href=\"https://doi.org/10.1109/msec.2023.3336028\">https://doi.org/10.1109/msec.2023.3336028</a>.","apa":"Bodden, E., Pottebaum, J., Fockel, M., &#38; Gräßler, I. (2024). Evaluating Security Through Isolation and Defense in Depth. <i>IEEE Security &#38; Privacy</i>, <i>22</i>(1), 69–72. <a href=\"https://doi.org/10.1109/msec.2023.3336028\">https://doi.org/10.1109/msec.2023.3336028</a>","ieee":"E. Bodden, J. Pottebaum, M. Fockel, and I. Gräßler, “Evaluating Security Through Isolation and Defense in Depth,” <i>IEEE Security &#38; Privacy</i>, vol. 22, no. 1, pp. 69–72, 2024, doi: <a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>.","ama":"Bodden E, Pottebaum J, Fockel M, Gräßler I. Evaluating Security Through Isolation and Defense in Depth. <i>IEEE Security &#38; Privacy</i>. 2024;22(1):69-72. doi:<a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>","bibtex":"@article{Bodden_Pottebaum_Fockel_Gräßler_2024, title={Evaluating Security Through Isolation and Defense in Depth}, volume={22}, DOI={<a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>}, number={1}, journal={IEEE Security &#38; Privacy}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Bodden, Eric and Pottebaum, Jens and Fockel, Markus and Gräßler, Iris}, year={2024}, pages={69–72} }","mla":"Bodden, Eric, et al. “Evaluating Security Through Isolation and Defense in Depth.” <i>IEEE Security &#38; Privacy</i>, vol. 22, no. 1, Institute of Electrical and Electronics Engineers (IEEE), 2024, pp. 69–72, doi:<a href=\"https://doi.org/10.1109/msec.2023.3336028\">10.1109/msec.2023.3336028</a>."},"quality_controlled":"1"},{"date_created":"2024-10-10T07:49:13Z","type":"conference","department":[{"_id":"78"}],"citation":{"mla":"Berganski, Christoph, et al. <i>FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers</i>. 2024.","ama":"Berganski C, Jentzsch F, Platzner M, Kuhmichel M, Giefers H. FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers. In: ; 2024.","bibtex":"@inproceedings{Berganski_Jentzsch_Platzner_Kuhmichel_Giefers_2024, title={FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers}, author={Berganski, Christoph and Jentzsch, Felix and Platzner, Marco and Kuhmichel, Max and Giefers, Heiner}, year={2024} }","apa":"Berganski, C., Jentzsch, F., Platzner, M., Kuhmichel, M., &#38; Giefers, H. (2024). <i>FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers</i>. International Conference on Field Programmable Technology, Sydney.","ieee":"C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, and H. Giefers, “FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers,” presented at the International Conference on Field Programmable Technology, Sydney, 2024.","short":"C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, H. Giefers, in: 2024.","chicago":"Berganski, Christoph, Felix Jentzsch, Marco Platzner, Max Kuhmichel, and Heiner Giefers. “FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers,” 2024."},"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"language":[{"iso":"eng"}],"_id":"56481","user_id":"55631","status":"public","year":"2024","title":"FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers","author":[{"id":"98854","full_name":"Berganski, Christoph","last_name":"Berganski","first_name":"Christoph"},{"id":"55631","full_name":"Jentzsch, Felix","last_name":"Jentzsch","first_name":"Felix","orcid":"0000-0003-4987-5708"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"full_name":"Kuhmichel, Max","first_name":"Max","last_name":"Kuhmichel"},{"full_name":"Giefers, Heiner","last_name":"Giefers","first_name":"Heiner"}],"conference":{"location":"Sydney","name":"International Conference on Field Programmable Technology","start_date":"2024-12-10","end_date":"2024-12-12"},"date_updated":"2026-04-27T14:14:40Z"},{"citation":{"chicago":"Henke, Luca-Sebastian. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>, 2024.","short":"L.-S. Henke, Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting, 2024.","ieee":"L.-S. Henke, <i>Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting</i>. 2024.","apa":"Henke, L.-S. (2024). <i>Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting</i>.","bibtex":"@book{Henke_2024, title={Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting}, author={Henke, Luca-Sebastian}, year={2024} }","ama":"Henke L-S. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>.; 2024.","mla":"Henke, Luca-Sebastian. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>. 2024."},"supervisor":[{"id":"55631","full_name":"Jentzsch, Felix","last_name":"Jentzsch","orcid":"0000-0003-4987-5708","first_name":"Felix"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_created":"2024-05-13T14:00:01Z","type":"mastersthesis","department":[{"_id":"78"}],"status":"public","year":"2024","title":"Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting","author":[{"last_name":"Henke","first_name":"Luca-Sebastian","full_name":"Henke, Luca-Sebastian"}],"date_updated":"2026-04-27T14:20:23Z","language":[{"iso":"eng"}],"_id":"54245","user_id":"55631"},{"date_created":"2024-01-07T20:09:32Z","department":[{"_id":"7"},{"_id":"623"}],"type":"conference","issue":"7","publication":"Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)","abstract":[{"lang":"eng","text":"The Polynomial-Time Hierarchy ($\\mathsf{PH}$) is a staple of classical\r\ncomplexity theory, with applications spanning randomized computation to circuit\r\nlower bounds to ''quantum advantage'' analyses for near-term quantum computers.\r\nQuantumly, however, despite the fact that at least \\emph{four} definitions of\r\nquantum $\\mathsf{PH}$ exist, it has been challenging to prove analogues for\r\nthese of even basic facts from $\\mathsf{PH}$. This work studies three\r\nquantum-verifier based generalizations of $\\mathsf{PH}$, two of which are from\r\n[Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings\r\n($\\mathsf{QCPH}$) and quantum mixed states ($\\mathsf{QPH}$) as proofs, and one\r\nof which is new to this work, utilizing quantum pure states\r\n($\\mathsf{pureQPH}$) as proofs. We first resolve several open problems from\r\n[GSSSY22], including a collapse theorem and a Karp-Lipton theorem for\r\n$\\mathsf{QCPH}$. Then, for our new class $\\mathsf{pureQPH}$, we show one-sided\r\nerror reduction for $\\mathsf{pureQPH}$, as well as the first bounds relating\r\nthese quantum variants of $\\mathsf{PH}$, namely $\\mathsf{QCPH}\\subseteq\r\n\\mathsf{pureQPH} \\subseteq \\mathsf{EXP}^{\\mathsf{PP}}$."}],"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2024.7","author":[{"full_name":"Agarwal, Avantika","first_name":"Avantika","last_name":"Agarwal"},{"full_name":"Gharibian, Sevag","last_name":"Gharibian","first_name":"Sevag","orcid":"0000-0002-9992-3379","id":"71541"},{"first_name":"Venkata","last_name":"Koppula","full_name":"Koppula, Venkata"},{"id":"57863","last_name":"Rudolph","first_name":"Dorian","full_name":"Rudolph, Dorian"}],"year":"2024","title":"Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds","intvolume":"       306","date_updated":"2026-05-15T08:39:23Z","publication_status":"published","external_id":{"arxiv":["2401.01633"]},"citation":{"ieee":"A. Agarwal, S. Gharibian, V. Koppula, and D. Rudolph, “Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds,” in <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, 2024, vol. 306, no. 7, pp. 7–17, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>.","apa":"Agarwal, A., Gharibian, S., Koppula, V., &#38; Rudolph, D. (2024). Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, <i>306</i>(7), 7–17. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">https://doi.org/10.4230/LIPIcs.MFCS.2024.7</a>","short":"A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph, in: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2024, pp. 7–17.","chicago":"Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” In <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, 306:7–17, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">https://doi.org/10.4230/LIPIcs.MFCS.2024.7</a>.","mla":"Agarwal, Avantika, et al. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, vol. 306, no. 7, 2024, pp. 7–17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>.","bibtex":"@inproceedings{Agarwal_Gharibian_Koppula_Rudolph_2024, title={Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds}, volume={306}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>}, number={7}, booktitle={Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)}, author={Agarwal, Avantika and Gharibian, Sevag and Koppula, Venkata and Rudolph, Dorian}, year={2024}, pages={7–17} }","ama":"Agarwal A, Gharibian S, Koppula V, Rudolph D. Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. In: <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>. Vol 306. ; 2024:7-17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>"},"_id":"50273","page":"7-17","volume":306,"user_id":"71541","status":"public"},{"intvolume":"       297","publication_status":"published","date_updated":"2026-05-15T08:41:59Z","author":[{"id":"71541","last_name":"Gharibian","orcid":"0000-0002-9992-3379","first_name":"Sevag","full_name":"Gharibian, Sevag"},{"last_name":"Kamminga","first_name":"Jonas","full_name":"Kamminga, Jonas"}],"year":"2024","title":"BQP, meet NP: Search-to-decision reductions and approximate counting","status":"public","volume":297,"user_id":"71541","_id":"50406","language":[{"iso":"eng"}],"page":"1-19","abstract":[{"lang":"eng","text":"What is the power of polynomial-time quantum computation with access to an NP\r\noracle? In this work, we focus on two fundamental tasks from the study of\r\nBoolean satisfiability (SAT) problems: search-to-decision reductions, and\r\napproximate counting. We first show that, in strong contrast to the classical\r\nsetting where a poly-time Turing machine requires $\\Theta(n)$ queries to an NP\r\noracle to compute a witness to a given SAT formula, quantumly $\\Theta(\\log n)$\r\nqueries suffice. We then show this is tight in the black-box model - any\r\nquantum algorithm with \"NP-like\" query access to a formula requires\r\n$\\Omega(\\log n)$ queries to extract a solution with constant probability.\r\nMoving to approximate counting of SAT solutions, by exploiting a quantum link\r\nbetween search-to-decision reductions and approximate counting, we show that\r\nexisting classical approximate counting algorithms are likely optimal. First,\r\nwe give a lower bound in the \"NP-like\" black-box query setting: Approximate\r\ncounting requires $\\Omega(\\log n)$ queries, even on a quantum computer. We then\r\ngive a \"white-box\" lower bound (i.e. where the input formula is not hidden in\r\nthe oracle) - if there exists a randomized poly-time classical or quantum\r\nalgorithm for approximate counting making $o(log n)$ NP queries, then\r\n$\\text{BPP}^{\\text{NP}[o(n)]}$ contains a $\\text{P}^{\\text{NP}}$-complete\r\nproblem if the algorithm is classical and $\\text{FBQP}^{\\text{NP}[o(n)]}$\r\ncontains an $\\text{FP}^{\\text{NP}}$-complete problem if the algorithm is\r\nquantum."}],"citation":{"mla":"Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, vol. 297, no. 70, 2024, pp. 1–19.","ama":"Gharibian S, Kamminga J. BQP, meet NP: Search-to-decision reductions and approximate counting. In: <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>. Vol 297. ; 2024:1-19.","bibtex":"@inproceedings{Gharibian_Kamminga_2024, title={BQP, meet NP: Search-to-decision reductions and approximate counting}, volume={297}, number={70}, booktitle={Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)}, author={Gharibian, Sevag and Kamminga, Jonas}, year={2024}, pages={1–19} }","apa":"Gharibian, S., &#38; Kamminga, J. (2024). BQP, meet NP: Search-to-decision reductions and approximate counting. <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, <i>297</i>(70), 1–19.","ieee":"S. Gharibian and J. Kamminga, “BQP, meet NP: Search-to-decision reductions and approximate counting,” in <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2024, vol. 297, no. 70, pp. 1–19.","chicago":"Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” In <i>Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)</i>, 297:1–19, 2024.","short":"S. Gharibian, J. Kamminga, in: Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP), 2024, pp. 1–19."},"publication":"Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)","issue":"70","department":[{"_id":"7"},{"_id":"623"}],"type":"conference","date_created":"2024-01-09T13:59:44Z","external_id":{"arxiv":["2401.03943"]}},{"date_updated":"2026-05-15T08:41:38Z","author":[{"full_name":"Huber, Felix","last_name":"Huber","first_name":"Felix"},{"first_name":"Kevin","last_name":"Thompson","full_name":"Thompson, Kevin"},{"first_name":"Ojas","last_name":"Parekh","full_name":"Parekh, Ojas"},{"full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag","id":"71541"}],"year":"2024","title":"Second order cone relaxations for quantum Max Cut","status":"public","user_id":"71541","_id":"56944","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic\r\nHeisenberg model, is a QMA-complete problem relevant to quantum many-body\r\nphysics and computer science. Semidefinite programming relaxations have been\r\nfruitful in designing theoretical approximation algorithms for QMC, but are\r\ncomputationally expensive for systems beyond tens of qubits. We give a second\r\norder cone relaxation for QMC, which optimizes over the set of mutually\r\nconsistent three-qubit reduced density matrices. In combination with Pauli\r\nlevel-$1$ of the quantum Lasserre hierarchy, the relaxation achieves an\r\napproximation ratio of $0.526$ to the ground state energy. Our relaxation is\r\nsolvable on systems with hundreds of qubits and paves the way to\r\ncomputationally efficient lower and upper bounds on the ground state energy of\r\nlarge-scale quantum spin systems."}],"citation":{"apa":"Huber, F., Thompson, K., Parekh, O., &#38; Gharibian, S. (2024). Second order cone relaxations for quantum Max Cut. In <i>arXiv:2411.04120</i>.","ieee":"F. Huber, K. Thompson, O. Parekh, and S. Gharibian, “Second order cone relaxations for quantum Max Cut,” <i>arXiv:2411.04120</i>. 2024.","chicago":"Huber, Felix, Kevin Thompson, Ojas Parekh, and Sevag Gharibian. “Second Order Cone Relaxations for Quantum Max Cut.” <i>ArXiv:2411.04120</i>, 2024.","short":"F. Huber, K. Thompson, O. Parekh, S. Gharibian, ArXiv:2411.04120 (2024).","mla":"Huber, Felix, et al. “Second Order Cone Relaxations for Quantum Max Cut.” <i>ArXiv:2411.04120</i>, 2024.","ama":"Huber F, Thompson K, Parekh O, Gharibian S. Second order cone relaxations for quantum Max Cut. <i>arXiv:241104120</i>. Published online 2024.","bibtex":"@article{Huber_Thompson_Parekh_Gharibian_2024, title={Second order cone relaxations for quantum Max Cut}, journal={arXiv:2411.04120}, author={Huber, Felix and Thompson, Kevin and Parekh, Ojas and Gharibian, Sevag}, year={2024} }"},"publication":"arXiv:2411.04120","department":[{"_id":"7"},{"_id":"623"}],"type":"preprint","date_created":"2024-11-07T12:09:37Z","external_id":{"arxiv":["2411.04120"]}},{"year":"2024","title":"Guest Column: The 7 faces of quantum NP","author":[{"full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag","id":"71541"}],"publication_status":"published","date_updated":"2026-05-15T08:42:54Z","article_type":"review","intvolume":"        54","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2310.18010"}],"language":[{"iso":"eng"}],"publication":"ACM SIGACT News","issue":"4","abstract":[{"text":"When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell far from the tree of NP. Two decades since the first definitions of quantum NP started rolling in, quantum complexity theorists face a stark reality: There's QMA, QCMA, QMA1, QMA(2), StoqMA, and NQP. In this article aimed at a general theoretical computer science audience, I survey these various definitions of quantum NP, their strengths and weaknesses, and why most of them, for better or worse, actually appear to fit naturally into the complexity zoo.","lang":"eng"}],"related_material":{"link":[{"url":"https://dl.acm.org/doi/abs/10.1145/3639528.3639535","relation":"confirmation"}]},"date_created":"2023-10-30T12:19:11Z","type":"journal_article","department":[{"_id":"7"},{"_id":"623"}],"status":"public","page":"54-91","_id":"48544","user_id":"71541","volume":54,"citation":{"bibtex":"@article{Gharibian_2024, title={Guest Column: The 7 faces of quantum NP}, volume={54}, number={4}, journal={ACM SIGACT News}, author={Gharibian, Sevag}, year={2024}, pages={54–91} }","ama":"Gharibian S. Guest Column: The 7 faces of quantum NP. <i>ACM SIGACT News</i>. 2024;54(4):54-91.","mla":"Gharibian, Sevag. “Guest Column: The 7 Faces of Quantum NP.” <i>ACM SIGACT News</i>, vol. 54, no. 4, 2024, pp. 54–91.","short":"S. Gharibian, ACM SIGACT News 54 (2024) 54–91.","chicago":"Gharibian, Sevag. “Guest Column: The 7 Faces of Quantum NP.” <i>ACM SIGACT News</i> 54, no. 4 (2024): 54–91.","ieee":"S. Gharibian, “Guest Column: The 7 faces of quantum NP,” <i>ACM SIGACT News</i>, vol. 54, no. 4, pp. 54–91, 2024.","apa":"Gharibian, S. (2024). Guest Column: The 7 faces of quantum NP. <i>ACM SIGACT News</i>, <i>54</i>(4), 54–91."},"oa":"1"},{"type":"book_chapter","department":[{"_id":"34"},{"_id":"574"}],"date_created":"2025-11-28T14:32:43Z","abstract":[{"text":"<jats:p>Clifford algebras are a natural extension of division algebras, including real numbers, complex numbers, quaternions, and octonions. Previous research in knowledge graph embeddings has focused exclusively on Clifford algebras of a specific type, which do not include nilpotent base vectors—elements that square to zero. In this work, we introduce a novel approach by incorporating nilpotent base vectors with a nilpotency index of two, leading to a more general form of Clifford algebras named degenerate Clifford algebras. This generalization to degenerate Clifford algebras does allow for covering dual numbers and as such include translations and rotations models under the same generalization paradigm for the first time. We develop two models to determine the parameters that define the algebra: one using a greedy search and another predicting the parameters based on neural network embeddings of the input knowledge graph. Our evaluation on seven benchmark datasets demonstrates that this incorporation of nilpotent vectors enhances the quality of embeddings. Additionally, our method outperforms state-of-the-art approaches in terms of generalization, particularly regarding the mean reciprocal rank achieved on validation data. Finally, we show that even a simple greedy search can effectively discover optimal or near-optimal parameters for the algebra.</jats:p>","lang":"eng"}],"publication":"Frontiers in Artificial Intelligence and Applications","doi":"10.3233/faia240627","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2026-05-29T14:34:11Z","year":"2024","title":"Embedding Knowledge Graphs in Degenerate Clifford Algebras","publication_identifier":{"isbn":["9781643685489"],"issn":["0922-6389","1879-8314"]},"author":[{"first_name":"Louis Mozart","last_name":"Kamdem Teyou","full_name":"Kamdem Teyou, Louis Mozart","id":"101165"},{"id":"43817","full_name":"Demir, Caglar","first_name":"Caglar","last_name":"Demir"},{"id":"65716","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"quality_controlled":"1","popular_science":"1","citation":{"apa":"Kamdem Teyou, L. M., Demir, C., &#38; Ngonga Ngomo, A.-C. (2024). Embedding Knowledge Graphs in Degenerate Clifford Algebras. In <i>Frontiers in Artificial Intelligence and Applications</i>. 27TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, Santiago de Compostela. IOS Press. <a href=\"https://doi.org/10.3233/faia240627\">https://doi.org/10.3233/faia240627</a>","ieee":"L. M. Kamdem Teyou, C. Demir, and A.-C. Ngonga Ngomo, “Embedding Knowledge Graphs in Degenerate Clifford Algebras,” in <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024.","chicago":"Kamdem Teyou, Louis Mozart, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. “Embedding Knowledge Graphs in Degenerate Clifford Algebras.” In <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press, 2024. <a href=\"https://doi.org/10.3233/faia240627\">https://doi.org/10.3233/faia240627</a>.","short":"L.M. Kamdem Teyou, C. Demir, A.-C. Ngonga Ngomo, in: Frontiers in Artificial Intelligence and Applications, IOS Press, 2024.","mla":"Kamdem Teyou, Louis Mozart, et al. “Embedding Knowledge Graphs in Degenerate Clifford Algebras.” <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024, doi:<a href=\"https://doi.org/10.3233/faia240627\">10.3233/faia240627</a>.","ama":"Kamdem Teyou LM, Demir C, Ngonga Ngomo A-C. Embedding Knowledge Graphs in Degenerate Clifford Algebras. In: <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press; 2024. doi:<a href=\"https://doi.org/10.3233/faia240627\">10.3233/faia240627</a>","bibtex":"@inbook{Kamdem Teyou_Demir_Ngonga Ngomo_2024, title={Embedding Knowledge Graphs in Degenerate Clifford Algebras}, DOI={<a href=\"https://doi.org/10.3233/faia240627\">10.3233/faia240627</a>}, booktitle={Frontiers in Artificial Intelligence and Applications}, publisher={IOS Press}, author={Kamdem Teyou, Louis Mozart and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2024} }"},"user_id":"101165","_id":"62702","publisher":"IOS Press","status":"public","conference":{"end_date":"2024-10-24","location":"Santiago de Compostela","name":"27TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE","start_date":"2024-10-19"}}]