[{"issue":"5","publication":"Comput. Graph. Forum","extern":"1","abstract":[{"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>","lang":"eng"}],"date_created":"2025-06-11T13:47:29Z","department":[{"_id":"969"}],"type":"journal_article","author":[{"full_name":"Brückler, Hendrik","first_name":"Hendrik","last_name":"Brückler","id":"115694"},{"full_name":"Bommes, David","last_name":"Bommes","first_name":"David"},{"last_name":"Campen","first_name":"Marcel","orcid":"0000-0003-2340-3462","full_name":"Campen, Marcel","id":"114904"}],"publication_identifier":{"issn":["0167-7055","1467-8659"]},"year":"2024","title":"Integer‐Sheet‐Pump Quantization for Hexahedral Meshing","intvolume":"        43","publication_status":"published","date_updated":"2025-06-23T09:01:46Z","language":[{"iso":"eng"}],"doi":"10.1111/cgf.15131","citation":{"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>.","short":"H. Brückler, D. Bommes, M. Campen, Comput. Graph. Forum 43 (2024).","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>.","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>","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} }","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>","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>."},"status":"public","publisher":"Wiley","_id":"60189","volume":43,"user_id":"114904"},{"extern":"1","publication":"Comput. Graph. Forum","issue":"7","citation":{"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>.","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>."},"type":"journal_article","department":[{"_id":"969"}],"date_created":"2025-06-17T07:46:09Z","date_updated":"2025-06-23T09:01:59Z","intvolume":"        43","status":"public","year":"2024","title":"Strictly Conservative Neural Implicits","author":[{"id":"116667","first_name":"Ingmar","last_name":"Ludwig","full_name":"Ludwig, Ingmar"},{"orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","full_name":"Campen, Marcel","id":"114904"}],"doi":"10.1111/CGF.15241","user_id":"114904","volume":43,"page":"i–xxii","language":[{"iso":"eng"}],"_id":"60240"},{"language":[{"iso":"eng"}],"doi":"10.1145/3687950","publication_identifier":{"issn":["0730-0301","1557-7368"]},"author":[{"last_name":"Hinderink","first_name":"Steffen","full_name":"Hinderink, Steffen","id":"116615"},{"id":"115694","full_name":"Brückler, Hendrik","first_name":"Hendrik","last_name":"Brückler"},{"orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","full_name":"Campen, Marcel","id":"114904"}],"year":"2024","title":"Bijective Volumetric Mapping via Star Decomposition","intvolume":"        43","date_updated":"2025-07-14T12:33:54Z","publication_status":"published","date_created":"2025-06-23T09:09:51Z","department":[{"_id":"969"}],"type":"journal_article","publication":"ACM Transactions on Graphics","issue":"6","abstract":[{"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>","lang":"eng"}],"extern":"1","publisher":"Association for Computing Machinery (ACM)","_id":"60314","page":"1-11","volume":43,"user_id":"117512","status":"public","citation":{"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>.","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>","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} }","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>","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>.","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>.","short":"S. Hinderink, H. Brückler, M. Campen, ACM Transactions on Graphics 43 (2024) 1–11."}},{"doi":"10.1145/3687992","language":[{"iso":"eng"}],"intvolume":"        43","date_updated":"2025-07-14T12:48:45Z","publication_status":"published","author":[{"last_name":"Nigolian","first_name":"Valentin Zénon","full_name":"Nigolian, Valentin Zénon"},{"id":"114904","full_name":"Campen, Marcel","last_name":"Campen","first_name":"Marcel","orcid":"0000-0003-2340-3462"},{"first_name":"David","last_name":"Bommes","full_name":"Bommes, David"}],"publication_identifier":{"issn":["0730-0301","1557-7368"]},"title":"A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology","year":"2024","department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-23T10:32:28Z","abstract":[{"lang":"eng","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>"}],"extern":"1","issue":"6","publication":"ACM Transactions on Graphics","volume":43,"user_id":"117512","_id":"60331","publisher":"Association for Computing Machinery (ACM)","page":"1-14","status":"public","citation":{"short":"V.Z. Nigolian, M. Campen, D. Bommes, ACM Transactions on Graphics 43 (2024) 1–14.","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>.","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>","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>.","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>","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} }","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>."}},{"department":[{"_id":"54"}],"type":"conference","keyword":["diarization","source separation","mixture model","meeting"],"date_created":"2024-11-14T09:32:38Z","file":[{"creator":"cord","date_created":"2025-08-14T08:11:57Z","relation":"main_file","date_updated":"2025-08-14T08:11:57Z","file_name":"main.pdf","file_size":259907,"access_level":"closed","file_id":"60930","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We propose an approach for simultaneous diarization and separation of meeting data. It consists of a complex Angular Central Gaussian Mixture Model (cACGMM) for speech source separation, and a von-Mises-Fisher Mixture Model (VMFMM) for diarization in a joint statistical framework. Through the integration, both spatial and spectral information are exploited for diarization and separation. We also develop a method for counting the number of active speakers in a segment of a meeting to support block-wise processing. While the total number of speakers in a meeting may be known, it is usually not known on a per-segment level. With the proposed speaker counting, joint diarization and source separation can be done segment-by-segment, and the permutation problem across segments is solved, thus allowing for block-online processing in the future. Experimental results on the LibriCSS meeting corpus show that the integrated approach outperforms a cascaded approach of diarization and speech enhancement in terms of WER, both on a per-segment and on a per-meeting level."}],"publication":"ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","doi":"10.1109/ICASSP49660.2025.10888445","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/pdf/2410.21455","open_access":"1"}],"date_updated":"2025-08-14T08:12:22Z","author":[{"id":"44393","first_name":"Tobias","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Tobias"},{"id":"40767","full_name":"Boeddeker, Christoph","last_name":"Boeddeker","first_name":"Christoph"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242"}],"title":"Simultaneous Diarization and Separation of Meetings through the Integration of Statistical Mixture Models","year":"2024","oa":"1","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"},{"name":"Automatische Transkription von Gesprächssituationen","_id":"508"}],"citation":{"ama":"Cord-Landwehr T, Boeddeker C, Haeb-Umbach R. Simultaneous Diarization and Separation of Meetings through the Integration of Statistical Mixture Models. In: <i>ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. ; 2024. doi:<a href=\"https://doi.org/10.1109/ICASSP49660.2025.10888445\">10.1109/ICASSP49660.2025.10888445</a>","bibtex":"@inproceedings{Cord-Landwehr_Boeddeker_Haeb-Umbach_2024, title={Simultaneous Diarization and Separation of Meetings through the Integration of Statistical Mixture Models}, DOI={<a href=\"https://doi.org/10.1109/ICASSP49660.2025.10888445\">10.1109/ICASSP49660.2025.10888445</a>}, booktitle={ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}, author={Cord-Landwehr, Tobias and Boeddeker, Christoph and Haeb-Umbach, Reinhold}, year={2024} }","mla":"Cord-Landwehr, Tobias, et al. “Simultaneous Diarization and Separation of Meetings through the Integration of Statistical Mixture Models.” <i>ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>, 2024, doi:<a href=\"https://doi.org/10.1109/ICASSP49660.2025.10888445\">10.1109/ICASSP49660.2025.10888445</a>.","chicago":"Cord-Landwehr, Tobias, Christoph Boeddeker, and Reinhold Haeb-Umbach. “Simultaneous Diarization and Separation of Meetings through the Integration of Statistical Mixture Models.” In <i>ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>, 2024. <a href=\"https://doi.org/10.1109/ICASSP49660.2025.10888445\">https://doi.org/10.1109/ICASSP49660.2025.10888445</a>.","short":"T. Cord-Landwehr, C. Boeddeker, R. Haeb-Umbach, in: ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2024.","apa":"Cord-Landwehr, T., Boeddeker, C., &#38; Haeb-Umbach, R. (2024). Simultaneous Diarization and Separation of Meetings through the Integration of Statistical Mixture Models. <i>ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Hyderabad, India. <a href=\"https://doi.org/10.1109/ICASSP49660.2025.10888445\">https://doi.org/10.1109/ICASSP49660.2025.10888445</a>","ieee":"T. Cord-Landwehr, C. Boeddeker, and R. Haeb-Umbach, “Simultaneous Diarization and Separation of Meetings through the Integration of Statistical Mixture Models,” presented at the 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Hyderabad, India, 2024, doi: <a href=\"https://doi.org/10.1109/ICASSP49660.2025.10888445\">10.1109/ICASSP49660.2025.10888445</a>."},"file_date_updated":"2025-08-14T08:11:57Z","ddc":["000"],"user_id":"44393","_id":"57085","has_accepted_license":"1","conference":{"name":"2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Hyderabad, India"},"status":"public"},{"conference":{"location":"Seoul","name":"2024 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)"},"status":"public","has_accepted_license":"1","_id":"53659","publisher":"IEEE","user_id":"44393","ddc":["000"],"citation":{"ieee":"T. Cord-Landwehr, C. Boeddeker, C. Zorilă, R. Doddipatla, and R. Haeb-Umbach, “Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization of Meeting Scenarios,” presented at the 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Seoul, 2024, doi: <a href=\"https://doi.org/10.1109/icassp48485.2024.10445911\">10.1109/icassp48485.2024.10445911</a>.","apa":"Cord-Landwehr, T., Boeddeker, C., Zorilă, C., Doddipatla, R., &#38; Haeb-Umbach, R. (2024). Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization of Meeting Scenarios. <i>ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Seoul. <a href=\"https://doi.org/10.1109/icassp48485.2024.10445911\">https://doi.org/10.1109/icassp48485.2024.10445911</a>","short":"T. Cord-Landwehr, C. Boeddeker, C. Zorilă, R. Doddipatla, R. Haeb-Umbach, in: ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2024.","chicago":"Cord-Landwehr, Tobias, Christoph Boeddeker, Cătălin Zorilă, Rama Doddipatla, and Reinhold Haeb-Umbach. “Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization of Meeting Scenarios.” In <i>ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/icassp48485.2024.10445911\">https://doi.org/10.1109/icassp48485.2024.10445911</a>.","mla":"Cord-Landwehr, Tobias, et al. “Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization of Meeting Scenarios.” <i>ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>, IEEE, 2024, doi:<a href=\"https://doi.org/10.1109/icassp48485.2024.10445911\">10.1109/icassp48485.2024.10445911</a>.","bibtex":"@inproceedings{Cord-Landwehr_Boeddeker_Zorilă_Doddipatla_Haeb-Umbach_2024, title={Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization of Meeting Scenarios}, DOI={<a href=\"https://doi.org/10.1109/icassp48485.2024.10445911\">10.1109/icassp48485.2024.10445911</a>}, booktitle={ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}, publisher={IEEE}, author={Cord-Landwehr, Tobias and Boeddeker, Christoph and Zorilă, Cătălin and Doddipatla, Rama and Haeb-Umbach, Reinhold}, year={2024} }","ama":"Cord-Landwehr T, Boeddeker C, Zorilă C, Doddipatla R, Haeb-Umbach R. Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization of Meeting Scenarios. In: <i>ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. IEEE; 2024. doi:<a href=\"https://doi.org/10.1109/icassp48485.2024.10445911\">10.1109/icassp48485.2024.10445911</a>"},"file_date_updated":"2025-08-14T08:09:52Z","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"},{"_id":"508","name":"Automatische Transkription von Gesprächssituationen"}],"author":[{"full_name":"Cord-Landwehr, Tobias","first_name":"Tobias","last_name":"Cord-Landwehr","id":"44393"},{"full_name":"Boeddeker, Christoph","last_name":"Boeddeker","first_name":"Christoph","id":"40767"},{"full_name":"Zorilă, Cătălin","first_name":"Cătălin","last_name":"Zorilă"},{"first_name":"Rama","last_name":"Doddipatla","full_name":"Doddipatla, Rama"},{"full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","first_name":"Reinhold","id":"242"}],"title":"Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization of Meeting Scenarios","year":"2024","publication_status":"published","date_updated":"2025-08-14T08:11:07Z","language":[{"iso":"eng"}],"doi":"10.1109/icassp48485.2024.10445911","publication":"ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","date_created":"2024-04-25T12:57:22Z","file":[{"creator":"cord","date_created":"2025-08-14T08:09:52Z","date_updated":"2025-08-14T08:09:52Z","relation":"main_file","access_level":"closed","file_size":254478,"file_name":"main.pdf","success":1,"content_type":"application/pdf","file_id":"60929"}],"department":[{"_id":"54"}],"type":"conference"},{"_id":"57864","publisher":"Springer Nature","page":"297","volume":1,"user_id":"11763","status":"public","citation":{"mla":"Alptekin, Mesut, and Katrin Temmen. “Extended Results for Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses.” <i>Smart Technologies for a Sustainable Future: Proceedings of the 21st International Conference on Smart Technologies &#38; Education. Volume 1</i>, vol. 1, Springer Nature, 2024, p. 297.","bibtex":"@inproceedings{Alptekin_Temmen_2024, series={1}, title={Extended Results for Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses}, volume={1}, booktitle={Smart Technologies for a Sustainable Future: Proceedings of the 21st International Conference on Smart Technologies &#38; Education. Volume 1}, publisher={Springer Nature}, author={Alptekin, Mesut and Temmen, Katrin}, year={2024}, pages={297}, collection={1} }","ama":"Alptekin M, Temmen K. Extended Results for Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses. In: <i>Smart Technologies for a Sustainable Future: Proceedings of the 21st International Conference on Smart Technologies &#38; Education. Volume 1</i>. Vol 1. 1. Springer Nature; 2024:297.","ieee":"M. Alptekin and K. Temmen, “Extended Results for Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses,” in <i>Smart Technologies for a Sustainable Future: Proceedings of the 21st International Conference on Smart Technologies &#38; Education. Volume 1</i>, 2024, vol. 1, p. 297.","apa":"Alptekin, M., &#38; Temmen, K. (2024). Extended Results for Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses. <i>Smart Technologies for a Sustainable Future: Proceedings of the 21st International Conference on Smart Technologies &#38; Education. Volume 1</i>, <i>1</i>, 297.","short":"M. Alptekin, K. Temmen, in: Smart Technologies for a Sustainable Future: Proceedings of the 21st International Conference on Smart Technologies &#38; Education. Volume 1, Springer Nature, 2024, p. 297.","chicago":"Alptekin, Mesut, and Katrin Temmen. “Extended Results for Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses.” In <i>Smart Technologies for a Sustainable Future: Proceedings of the 21st International Conference on Smart Technologies &#38; Education. Volume 1</i>, 1:297. 1. Springer Nature, 2024."},"project":[{"name":"DigiSelF - Digitalisierung als Herausforderung und Innovation in der Hochschullehre","_id":"1387"}],"language":[{"iso":"eng"}],"series_title":"1","publication_identifier":{"isbn":["3-031-61891-2 978-3-031-61891-8"]},"author":[{"id":"11763","last_name":"Alptekin","orcid":"0009-0004-8545-1165","first_name":"Mesut","full_name":"Alptekin, Mesut"},{"full_name":"Temmen, Katrin","first_name":"Katrin","last_name":"Temmen","id":"30086"}],"year":"2024","title":"Extended Results for Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses","intvolume":"         1","date_updated":"2025-08-19T08:49:14Z","date_created":"2024-12-29T11:04:18Z","department":[{"_id":"34"},{"_id":"300"}],"type":"conference","publication":"Smart Technologies for a Sustainable Future: Proceedings of the 21st International Conference on Smart Technologies & Education. Volume 1","abstract":[{"text":"This book includes the proceedings of the 21st International Conference on Smart Technologies & Education (STE2024). The \"International Conference on Smart Technologies & Education\" (STE) is an annual global meeting dedicated to the fundamentals, applications, and experiences in the field of Smart Technologies, Online, Remote, and Virtual Engineering, Virtual Instrumentation, and other related new technologies. Nowadays, online and smart technologies are the core of most fields of engineering and the whole society. Consequently, the motto of this year’s STE2024 was \"Smart Technologies for a Sustainable Future\". The STE conference is the successor of the long-standing annual REV Conferences and the annual meeting of the International Association of Online Engineering (IAOE) together with the EduNet World Association (EWA) and the International Education Network (EduNet). In a globally connected world, the interest in online collaboration, teleworking, remote services, and other digital working environments is rapidly increasing. In response to that, the general objective of this conference is to contribute and discuss fundamentals, applications, and experiences in the field of Online and Remote Engineering, Virtual Instrumentation, and other related new technologies like Cross Reality, Open Science and Big Data, Internet of Things and Industrial Internet of Things, Industry 4.0, Cyber Security, and M2M and Smart Objects. Another objective of the conference is to discuss guidelines and new concepts for engineering education in higher and vocational education institutions, including emerging technologies in learning, MOOCs and MOOLs, and Open Resources. This year, STE2024 has been organized in Helsinki, Finland as an onsite event supporting remote presentations, from March 6 until March 8, 2024. The co-organizers of STE2024 were the Arcada University of Applied Sciences, the International Association of Online Engineering (IAOE) together with the Global Online Laboratory Consortium (GOLC), the International Education Network (EduNet), and the EduNet World Association (EWA). STE2024 has attracted 140 scientists and industrial leaders from more than 40 countries","lang":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-61891-8_29","author":[{"full_name":"Alptekin, Mesut","first_name":"Mesut","last_name":"Alptekin","orcid":"0009-0004-8545-1165","id":"11763"},{"full_name":"Temmen, Katrin","first_name":"Katrin","last_name":"Temmen","id":"30086"}],"publication_identifier":{"isbn":["978-3-031-61890-1 978-3-031-61891-8"]},"title":"Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses","year":"2024","intvolume":"      1027","date_updated":"2025-08-19T08:50:21Z","date_created":"2024-12-29T11:03:09Z","department":[{"_id":"34"},{"_id":"300"}],"type":"book_chapter","publication":"Smart Technologies for a Sustainable Future","publisher":"Springer Nature Switzerland","_id":"57863","page":"297–304","editor":[{"first_name":"Michael E.","last_name":"Auer","full_name":"Auer, Michael E."},{"first_name":"Reinhard","last_name":"Langmann","full_name":"Langmann, Reinhard"},{"full_name":"May, Dominik","last_name":"May","first_name":"Dominik"},{"full_name":"Roos, Kim","first_name":"Kim","last_name":"Roos"}],"volume":1027,"user_id":"11763","status":"public","place":"Cham","citation":{"ama":"Alptekin M, Temmen K. Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses. In: Auer ME, Langmann R, May D, Roos K, eds. <i>Smart Technologies for a Sustainable Future</i>. Vol 1027. Springer Nature Switzerland; 2024:297–304. doi:<a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">10.1007/978-3-031-61891-8_29</a>","short":"M. Alptekin, K. Temmen, in: M.E. Auer, R. Langmann, D. May, K. Roos (Eds.), Smart Technologies for a Sustainable Future, Springer Nature Switzerland, Cham, 2024, pp. 297–304.","chicago":"Alptekin, Mesut, and Katrin Temmen. “Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses.” In <i>Smart Technologies for a Sustainable Future</i>, edited by Michael E. Auer, Reinhard Langmann, Dominik May, and Kim Roos, 1027:297–304. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">https://doi.org/10.1007/978-3-031-61891-8_29</a>.","bibtex":"@inbook{Alptekin_Temmen_2024, place={Cham}, title={Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses}, volume={1027}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">10.1007/978-3-031-61891-8_29</a>}, booktitle={Smart Technologies for a Sustainable Future}, publisher={Springer Nature Switzerland}, author={Alptekin, Mesut and Temmen, Katrin}, editor={Auer, Michael E. and Langmann, Reinhard and May, Dominik and Roos, Kim}, year={2024}, pages={297–304} }","apa":"Alptekin, M., &#38; Temmen, K. (2024). Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses. In M. E. Auer, R. Langmann, D. May, &#38; K. Roos (Eds.), <i>Smart Technologies for a Sustainable Future</i> (Vol. 1027, pp. 297–304). Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">https://doi.org/10.1007/978-3-031-61891-8_29</a>","mla":"Alptekin, Mesut, and Katrin Temmen. “Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses.” <i>Smart Technologies for a Sustainable Future</i>, edited by Michael E. Auer et al., vol. 1027, Springer Nature Switzerland, 2024, pp. 297–304, doi:<a href=\"https://doi.org/10.1007/978-3-031-61891-8_29\">10.1007/978-3-031-61891-8_29</a>.","ieee":"M. Alptekin and K. Temmen, “Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses,” in <i>Smart Technologies for a Sustainable Future</i>, vol. 1027, M. E. Auer, R. Langmann, D. May, and K. Roos, Eds. Cham: Springer Nature Switzerland, 2024, pp. 297–304."},"project":[{"_id":"1387","name":"DigiSelF - Digitalisierung als Herausforderung und Innovation in der Hochschullehre"}]},{"doi":"10.1016/j.apenergy.2024.123417","user_id":"90391","volume":368,"article_number":"123417","language":[{"iso":"eng"}],"_id":"54459","publisher":"Elsevier BV","date_updated":"2025-09-03T12:21:47Z","publication_status":"published","intvolume":"       368","title":"Flexible operation and integration of high-temperature heat pumps using large temperature glides","status":"public","year":"2024","publication_identifier":{"issn":["0306-2619"]},"author":[{"id":"90391","first_name":"Lukas","last_name":"Knorr","full_name":"Knorr, Lukas"},{"id":"88614","last_name":"Schlosser","first_name":"Florian","full_name":"Schlosser, Florian"},{"full_name":"Horstmann, Nils","first_name":"Nils","last_name":"Horstmann"},{"id":"89059","last_name":"Divkovic","first_name":"Denis","full_name":"Divkovic, Denis"},{"id":"86954","first_name":"Henning","last_name":"Meschede","orcid":"0000-0002-1538-089X","full_name":"Meschede, Henning"}],"type":"journal_article","department":[{"_id":"644"}],"date_created":"2024-05-27T10:29:14Z","publication":"Applied Energy","citation":{"chicago":"Knorr, Lukas, Florian Schlosser, Nils Horstmann, Denis Divkovic, and Henning Meschede. “Flexible Operation and Integration of High-Temperature Heat Pumps Using Large Temperature Glides.” <i>Applied Energy</i> 368 (2024). <a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">https://doi.org/10.1016/j.apenergy.2024.123417</a>.","short":"L. Knorr, F. Schlosser, N. Horstmann, D. Divkovic, H. Meschede, Applied Energy 368 (2024).","ieee":"L. Knorr, F. Schlosser, N. Horstmann, D. Divkovic, and H. Meschede, “Flexible operation and integration of high-temperature heat pumps using large temperature glides,” <i>Applied Energy</i>, vol. 368, Art. no. 123417, 2024, doi: <a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">10.1016/j.apenergy.2024.123417</a>.","apa":"Knorr, L., Schlosser, F., Horstmann, N., Divkovic, D., &#38; Meschede, H. (2024). Flexible operation and integration of high-temperature heat pumps using large temperature glides. <i>Applied Energy</i>, <i>368</i>, Article 123417. <a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">https://doi.org/10.1016/j.apenergy.2024.123417</a>","bibtex":"@article{Knorr_Schlosser_Horstmann_Divkovic_Meschede_2024, title={Flexible operation and integration of high-temperature heat pumps using large temperature glides}, volume={368}, DOI={<a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">10.1016/j.apenergy.2024.123417</a>}, number={123417}, journal={Applied Energy}, publisher={Elsevier BV}, author={Knorr, Lukas and Schlosser, Florian and Horstmann, Nils and Divkovic, Denis and Meschede, Henning}, year={2024} }","ama":"Knorr L, Schlosser F, Horstmann N, Divkovic D, Meschede H. Flexible operation and integration of high-temperature heat pumps using large temperature glides. <i>Applied Energy</i>. 2024;368. doi:<a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">10.1016/j.apenergy.2024.123417</a>","mla":"Knorr, Lukas, et al. “Flexible Operation and Integration of High-Temperature Heat Pumps Using Large Temperature Glides.” <i>Applied Energy</i>, vol. 368, 123417, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.apenergy.2024.123417\">10.1016/j.apenergy.2024.123417</a>."}},{"_id":"55637","language":[{"iso":"eng"}],"publisher":"USENIX Association","user_id":"15458","editor":[{"last_name":"Balzarotti","first_name":"Davide","full_name":"Balzarotti, Davide"},{"first_name":"Wenyuan","last_name":"Xu","full_name":"Xu, Wenyuan"}],"title":"Exploring digital security and privacy in relative poverty in Germany through qualitative interviews","status":"public","year":"2024","author":[{"first_name":"Anastassija","last_name":"Kostan","full_name":"Kostan, Anastassija"},{"first_name":"Sara","last_name":"Olschar","full_name":"Olschar, Sara"},{"first_name":"Lucy","last_name":"Simko","full_name":"Simko, Lucy"},{"last_name":"Acar","first_name":"Yasemin","full_name":"Acar, Yasemin","id":"94636"}],"date_updated":"2025-09-04T11:19:24Z","date_created":"2024-08-19T08:27:57Z","type":"conference","department":[{"_id":"740"}],"publication":"33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024","citation":{"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.","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.","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.","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.","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.","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} }"}},{"page":"207-210","_id":"59581","language":[{"iso":"ger"}],"user_id":"44184","doi":"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0","editor":[{"last_name":"Ebers","first_name":"P.","full_name":"Ebers, P."},{"last_name":"Rösken","first_name":"F.","full_name":"Rösken, F."},{"full_name":"Barzel, B.","last_name":"Barzel","first_name":"B."},{"full_name":"Büchter, A.","first_name":"A.","last_name":"Büchter"},{"first_name":"F.","last_name":"Schacht","full_name":"Schacht, F."},{"first_name":"P.","last_name":"Scherer","full_name":"Scherer, P."}],"status":"public","year":"2024","title":" Praktiken der Förderung im inklusiven Mathematikunterricht","author":[{"full_name":"Häsel-Weide, Uta","first_name":"Uta","last_name":"Häsel-Weide","orcid":"0000-0001-6278-4240","id":"60267"},{"full_name":"Nührenbörger, M.","first_name":"M.","last_name":"Nührenbörger"}],"date_updated":"2025-09-08T07:32:38Z","date_created":"2025-04-15T10:06:42Z","type":"book_chapter","department":[{"_id":"543"}],"publication":"Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik","citation":{"chicago":"Häsel-Weide, Uta, and M. Nührenbörger. “ Praktiken der Förderung im inklusiven Mathematikunterricht.” In <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i>, edited by P. Ebers, F. Rösken, B. Barzel, A. Büchter, F. Schacht, and P. Scherer, 207–10, 2024. <a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>.","short":"U. Häsel-Weide, M. Nührenbörger, in: P. Ebers, F. Rösken, B. Barzel, A. Büchter, F. Schacht, P. Scherer (Eds.), Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik, 2024, pp. 207–210.","apa":"Häsel-Weide, U., &#38; Nührenbörger, M. (2024).  Praktiken der Förderung im inklusiven Mathematikunterricht. In P. Ebers, F. Rösken, B. Barzel, A. Büchter, F. Schacht, &#38; P. Scherer (Eds.), <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i> (pp. 207–210). <a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>","ieee":"U. Häsel-Weide and M. Nührenbörger, “ Praktiken der Förderung im inklusiven Mathematikunterricht,” in <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i>, P. Ebers, F. Rösken, B. Barzel, A. Büchter, F. Schacht, and P. Scherer, Eds. 2024, pp. 207–210.","ama":"Häsel-Weide U, Nührenbörger M.  Praktiken der Förderung im inklusiven Mathematikunterricht. In: Ebers P, Rösken F, Barzel B, Büchter A, Schacht F, Scherer P, eds. <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i>. ; 2024:207-210. doi:<a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>","bibtex":"@inbook{Häsel-Weide_Nührenbörger_2024, title={ Praktiken der Förderung im inklusiven Mathematikunterricht}, DOI={<a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>}, booktitle={Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik}, author={Häsel-Weide, Uta and Nührenbörger, M.}, editor={Ebers, P. and Rösken, F. and Barzel, B. and Büchter, A. and Schacht, F. and Scherer, P.}, year={2024}, pages={207–210} }","mla":"Häsel-Weide, Uta, and M. Nührenbörger. “ Praktiken der Förderung im inklusiven Mathematikunterricht.” <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i>, edited by P. Ebers et al., 2024, pp. 207–10, doi:<a href=\"https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0\">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0</a>."}},{"publication":"Theoretical Computer Science","date_created":"2025-09-10T14:26:11Z","type":"journal_article","department":[{"_id":"79"}],"year":"2024","title":"Routing Schemes for Hybrid Communication Networks","author":[{"full_name":"Coy, Sam","first_name":"Sam","last_name":"Coy"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Schneider, Philipp","first_name":"Philipp","last_name":"Schneider"},{"first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024"}],"publication_identifier":{"issn":["0304-3975"]},"date_updated":"2025-09-10T14:52:21Z","publication_status":"published","intvolume":"       985","article_number":"114352","language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2023.114352","citation":{"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>.","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>","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} }","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>","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>.","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>.","short":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical Computer Science 985 (2024)."},"project":[{"name":"SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen","_id":"5"}],"status":"public","_id":"61172","publisher":"Elsevier BV","user_id":"50024","volume":985},{"department":[{"_id":"34"}],"type":"conference","keyword":["fact checking","ensemble learning","transfer learning","knowledge management."],"date_created":"2024-11-19T14:12:49Z","file":[{"date_created":"2024-11-19T14:14:14Z","creator":"uqudus","content_type":"application/pdf","success":1,"file_id":"57241","date_updated":"2024-11-19T14:14:14Z","relation":"main_file","access_level":"closed","file_size":190661,"file_name":"favel.pdf"}],"abstract":[{"text":"Validating assertions before adding them to a knowledge graph is an essential part of its creation and maintenance. Due to the sheer size of knowledge graphs, automatic fact-checking approaches have been developed. These approaches rely on reference knowledge to decide whether a given assertion is correct. Recent hybrid approaches achieve good results by including several knowledge sources. However, it is often impractical to provide a sheer quantity of textual knowledge or generate embedding models to leverage these hybrid approaches. We present FaVEL, an approach that uses algorithm selection and ensemble learning to amalgamate several existing fact-checking approaches that rely solely on a reference knowledge graph and, hence, use fewer resources than current hybrid approaches. For our evaluation, we create updated versions of two existing datasets and a new dataset dubbed FaVEL-DS. Our evaluation compares our approach to 15 fact-checking approaches—including the state-of-the-art approach HybridFC—on 3 datasets. Our results demonstrate that FaVEL outperforms all other approaches significantly by at least 0.04 in terms of the area under the ROC curve. Our source code, datasets, and evaluation results are open-source and can be found at https://github.com/dice-group/favel.","lang":"eng"}],"publication":"EKAW 2024","language":[{"iso":"eng"}],"date_updated":"2025-09-11T09:48:12Z","corporate_editor":["Mehwish Alam"],"author":[{"last_name":"Qudus","first_name":"Umair","orcid":"0000-0001-6714-8729","full_name":"Qudus, Umair","id":"83392"},{"full_name":"Röder, Michael","first_name":"Michael","orcid":"https://orcid.org/0000-0002-8609-8277","last_name":"Röder","id":"67199"},{"full_name":"Tatkeu Pekarou, Franck Lionel","first_name":"Franck Lionel","last_name":"Tatkeu Pekarou"},{"id":"72108","last_name":"Morim da Silva","first_name":"Ana Alexandra","full_name":"Morim da Silva, Ana Alexandra"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo"}],"title":"FaVEL: Fact Validation Ensemble Learning","year":"2024","project":[{"_id":"412","name":"NEBULA: Nutzerzentrierte KI-basierte Erkennung von Fake-News und Fehlinformationen"},{"_id":"285","name":"SAIL: SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen"},{"_id":"410","name":"KnowGraphs: KnowGraphs: Knowledge Graphs at Scale"}],"quality_controlled":"1","citation":{"ieee":"U. Qudus, M. Röder, F. L. Tatkeu Pekarou, A. A. Morim da Silva, and A.-C. Ngonga Ngomo, “FaVEL: Fact Validation Ensemble Learning,” in <i>EKAW 2024</i>, Amsterdam, Netherlands, 2024.","apa":"Qudus, U., Röder, M., Tatkeu Pekarou, F. L., Morim da Silva, A. A., &#38; Ngonga Ngomo, A.-C. (2024). FaVEL: Fact Validation Ensemble Learning. In M. Rospocher &#38; Mehwish Alam (Eds.), <i>EKAW 2024</i>.","short":"U. Qudus, M. Röder, F.L. Tatkeu Pekarou, A.A. Morim da Silva, A.-C. Ngonga Ngomo, in: M. Rospocher, Mehwish Alam (Eds.), EKAW 2024, 2024.","chicago":"Qudus, Umair, Michael Röder, Franck Lionel Tatkeu Pekarou, Ana Alexandra Morim da Silva, and Axel-Cyrille Ngonga Ngomo. “FaVEL: Fact Validation Ensemble Learning.” In <i>EKAW 2024</i>, edited by Marco Rospocher and Mehwish Alam, 2024.","mla":"Qudus, Umair, et al. “FaVEL: Fact Validation Ensemble Learning.” <i>EKAW 2024</i>, edited by Marco Rospocher and Mehwish Alam, 2024.","bibtex":"@inproceedings{Qudus_Röder_Tatkeu Pekarou_Morim da Silva_Ngonga Ngomo_2024, title={FaVEL: Fact Validation Ensemble Learning}, booktitle={EKAW 2024}, author={Qudus, Umair and Röder, Michael and Tatkeu Pekarou, Franck Lionel and Morim da Silva, Ana Alexandra and Ngonga Ngomo, Axel-Cyrille}, editor={Rospocher, Marco and Mehwish Alam}, year={2024} }","ama":"Qudus U, Röder M, Tatkeu Pekarou FL, Morim da Silva AA, Ngonga Ngomo A-C. FaVEL: Fact Validation Ensemble Learning. In: Rospocher M, Mehwish Alam, eds. <i>EKAW 2024</i>. ; 2024."},"popular_science":"1","file_date_updated":"2024-11-19T14:14:14Z","editor":[{"full_name":"Rospocher, Marco","first_name":"Marco","last_name":"Rospocher"}],"user_id":"83392","ddc":["600"],"_id":"57240","has_accepted_license":"1","conference":{"end_date":"2024-11-28","location":"Amsterdam, Netherlands","start_date":"2024-11-26","name":"24th International Conference on Knowledge Engineering and Knowledge Management"},"status":"public"},{"title":"Dung's Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases","status":"public","year":"2024","author":[{"full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir","id":"99353"},{"full_name":"Hecher, Markus","last_name":"Hecher","first_name":"Markus"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"date_updated":"2025-09-11T10:01:11Z","language":[{"iso":"eng"}],"_id":"58377","user_id":"99353","doi":"10.1609/AAAI.V39I14.33651","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} }"},"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"}],"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"external_id":{"arxiv":["2412.11617"]},"date_created":"2025-01-27T15:30:41Z","type":"conference","department":[{"_id":"574"}]},{"type":"book_chapter","department":[{"_id":"574"}],"date_created":"2024-11-19T11:46:55Z","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"}],"publication":"Frontiers in Artificial Intelligence and Applications","citation":{"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.","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>","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>","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>."},"doi":"10.3233/faia240867","user_id":"99353","publisher":"IOS Press","_id":"57238","language":[{"iso":"eng"}],"date_updated":"2025-09-11T10:01:52Z","publication_status":"published","title":"Rejection in Abstract Argumentation: Harder Than Acceptance?","status":"public","year":"2024","conference":{"name":"ECAI} 2024 - 27th European Conference on Artificial Intelligence","location":"Santiago de Compostela, Spain"},"publication_identifier":{"issn":["0922-6389","1879-8314"],"isbn":["9781643685489"]},"author":[{"first_name":"Johannes K.","last_name":"Fichte","full_name":"Fichte, Johannes K."},{"full_name":"Hecher, Markus","first_name":"Markus","last_name":"Hecher"},{"id":"99353","first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"}]},{"type":"conference","department":[{"_id":"574"}],"date_created":"2024-08-19T16:21:51Z","abstract":[{"lang":"eng","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>"}],"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"publication":"Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence","citation":{"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>.","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>","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>.","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>.","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} }","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>"},"doi":"10.24963/ijcai.2024/377","user_id":"99353","publisher":"International Joint Conferences on Artificial Intelligence Organization","_id":"55655","language":[{"iso":"eng"}],"date_updated":"2025-09-11T10:02:03Z","publication_status":"published","year":"2024","title":"Quantitative Claim-Centric Reasoning in Logic-Based Argumentation","status":"public","author":[{"last_name":"Hecher","first_name":"Markus","full_name":"Hecher, Markus"},{"id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"},{"last_name":"Schmidt","first_name":"Johannes","full_name":"Schmidt, Johannes"}]},{"external_id":{"arxiv":["2412.08324"]},"date_created":"2024-12-15T20:12:56Z","type":"preprint","department":[{"_id":"574"}],"publication":"arXiv:2412.08324","citation":{"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} }","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.","mla":"Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 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.","short":"T. Hankala, M. Hannula, Y. Mahmood, A. Meier, ArXiv:2412.08324 (2024).","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.","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>."},"abstract":[{"lang":"eng","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."}],"project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"_id":"57814","language":[{"iso":"eng"}],"user_id":"99353","status":"public","title":"Parameterised Complexity of Consistent Query Answering via Graph  Representations","year":"2024","author":[{"first_name":"Teemu","last_name":"Hankala","full_name":"Hankala, Teemu"},{"full_name":"Hannula, Miika","last_name":"Hannula","first_name":"Miika"},{"full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir","id":"99353"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"}],"date_updated":"2025-09-11T10:01:35Z"},{"external_id":{"arxiv":["2409.06564"]},"citation":{"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.","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>.","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>","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>.","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>","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} }","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>."},"file_date_updated":"2024-09-16T08:55:23Z","_id":"56140","ddc":["000"],"user_id":"32312","conference":{"location":"Sacramento, California","start_date":"2024-10-27","name":"39th IEEE/ACM International Conference on Automated Software Engineering (ASE 2024)","end_date":"2024-11-01"},"status":"public","has_accepted_license":"1","date_created":"2024-09-16T08:55:34Z","file":[{"date_updated":"2024-09-16T08:55:23Z","relation":"main_file","file_size":1207856,"access_level":"closed","file_name":"2409.06564v1.pdf","content_type":"application/pdf","success":1,"file_id":"56141","creator":"khedkarm","date_created":"2024-09-16T08:55:23Z"}],"department":[{"_id":"76"}],"type":"conference","publication":"In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)","abstract":[{"lang":"eng","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. "}],"language":[{"iso":"eng"}],"doi":"10.1145/3691621.3694953","author":[{"id":"88024","first_name":"Mugdha","last_name":"Khedkar","full_name":"Khedkar, Mugdha"},{"id":"32312","first_name":"Michael","last_name":"Schlichtig","orcid":"0000-0001-6600-6171","full_name":"Schlichtig, Michael"},{"id":"59256","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric"}],"title":"Advancing Android Privacy Assessments with Automation","year":"2024","date_updated":"2026-03-13T12:12:45Z"},{"date_created":"2026-01-19T11:29:47Z","type":"conference","department":[{"_id":"819"}],"publication":"2024 International Conference on Machine Learning and Applications (ICMLA)","citation":{"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.","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.","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} }","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.","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.","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."},"page":"1705–1711","_id":"63658","language":[{"iso":"eng"}],"user_id":"103682","status":"public","year":"2024","title":"On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification","author":[{"last_name":"Klüttermann","first_name":"Simon","full_name":"Klüttermann, Simon"},{"full_name":"Rutinowski, Jérôme","first_name":"Jérôme","last_name":"Rutinowski"},{"last_name":"Polachowski","first_name":"Frederik","full_name":"Polachowski, Frederik"},{"full_name":"Nguyen, Anh","last_name":"Nguyen","first_name":"Anh"},{"last_name":"Grimme","first_name":"Britta","full_name":"Grimme, Britta"},{"last_name":"Roidl","first_name":"Moritz","full_name":"Roidl, Moritz"},{"last_name":"Müller","first_name":"Emmanuel","full_name":"Müller, Emmanuel"}],"date_updated":"2026-03-19T07:47:29Z"},{"_id":"58873","language":[{"iso":"eng"}],"user_id":"109467","author":[{"full_name":"Delarue, Benjamin","last_name":"Delarue","first_name":"Benjamin","id":"70575"},{"full_name":"Palmirotta, Guendalina","last_name":"Palmirotta","first_name":"Guendalina","id":"109467"}],"year":"2024","title":"Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces","status":"public","date_updated":"2026-03-30T12:01:12Z","date_created":"2025-02-28T10:32:30Z","external_id":{"arxiv":["2411.19782"]},"department":[{"_id":"548"}],"type":"preprint","citation":{"ama":"Delarue B, Palmirotta G. Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces. <i>arXiv:241119782</i>. Published online 2024.","bibtex":"@article{Delarue_Palmirotta_2024, title={Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces}, journal={arXiv:2411.19782}, author={Delarue, Benjamin and Palmirotta, Guendalina}, year={2024} }","mla":"Delarue, Benjamin, and Guendalina Palmirotta. “Patterson-Sullivan and Wigner Distributions of Convex-Cocompact  Hyperbolic Surfaces.” <i>ArXiv:2411.19782</i>, 2024.","chicago":"Delarue, Benjamin, and Guendalina Palmirotta. “Patterson-Sullivan and Wigner Distributions of Convex-Cocompact  Hyperbolic Surfaces.” <i>ArXiv:2411.19782</i>, 2024.","short":"B. Delarue, G. Palmirotta, ArXiv:2411.19782 (2024).","apa":"Delarue, B., &#38; Palmirotta, G. (2024). Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces. In <i>arXiv:2411.19782</i>.","ieee":"B. Delarue and G. Palmirotta, “Patterson-Sullivan and Wigner distributions of convex-cocompact  hyperbolic surfaces,” <i>arXiv:2411.19782</i>. 2024."},"publication":"arXiv:2411.19782","project":[{"_id":"356","name":"TRR 358; TP B02: Spektraltheorie in höherem Rang und unendlichem Volumen"}],"abstract":[{"lang":"eng","text":"We prove that the Patterson-Sullivan and Wigner distributions on the unit\r\nsphere bundle of a convex-cocompact hyperbolic surface are asymptotically\r\nidentical. This generalizes results in the compact case by\r\nAnantharaman-Zelditch and Hansen-Hilgert-Schr\\\"oder."}]}]