@inproceedings{63546,
  author       = {{Trienens, Malte and Schreiner, Nick and Hovemann, Aschot and Dumitrescu, Roman}},
  booktitle    = {{2025 IEEE European Technology and Engineering Management Summit (E-TEMS)}},
  publisher    = {{IEEE}},
  title        = {{{Industry Perspectives on the Digital Product Passport: A Guide to Sustainable Value Chains From an Engineering Perspective}}},
  doi          = {{10.1109/e-tems64751.2025.11239259}},
  year         = {{2025}},
}

@inproceedings{63544,
  author       = {{Schreiner, Nick and Trienens, Malte and Kürpick, Christian and Asmar, Laban and Dumitrescu, Roman}},
  booktitle    = {{2025 IEEE European Technology and Engineering Management Summit (E-TEMS)}},
  publisher    = {{IEEE}},
  title        = {{{Product Decarbonization From an Engineering Perspective: Drawing Insights From Industry}}},
  doi          = {{10.1109/e-tems64751.2025.11239319}},
  year         = {{2025}},
}

@article{63556,
  author       = {{Biehler, Rolf and Engel, Joachim and Frischemeier, Daniel and Podworny, Susanne}},
  journal      = {{mathematica didactica}},
  number       = {{2}},
  title        = {{{Civic Statistical Literacy: Konzept und praxisnahe Umsetzung am Beispiel des Klimawandels}}},
  doi          = {{10.18716/ojs/md/2025.2297}},
  volume       = {{48}},
  year         = {{2025}},
}

@unpublished{63569,
  abstract     = {{Let $G$ be a totally disconnected locally compact (tdlc) group. The contraction group $\mathrm{con}(g)$ of an element $g\in G$ is the set of all $h\in G$ such that $g^n h g^{-n} \to 1_G$ as $n \to \infty$. The nub of $g$ can then be characterized as the intersection $\mathrm{nub}(g)$ of the closures of $\mathrm{con}(g)$ and $\mathrm{con}(g^{-1})$.
 Contraction groups and nubs provide important tools in the study of the structure of tdlc groups, as already evidenced in the work of G. Willis. It is known that $\mathrm{nub}(g) = \{1\}$ if and only if $\mathrm{con}(g)$ is closed. In general, contraction groups are not closed and computing the nub is typically a challenging problem.
 Maximal Kac-Moody groups over finite fields form a prominent family of non-discrete compactly generated simple tdlc groups. In this paper we give a complete description of the nub of any element in these groups.}},
  author       = {{Bischof, Sebastian and Marquis, Timothée}},
  title        = {{{Describing the nub in maximal Kac-Moody groups}}},
  year         = {{2025}},
}

@unpublished{63568,
  abstract     = {{In this article we work out the details of flat groups of the automorphism group of locally finite Bruhat-Tits buildings.}},
  author       = {{Bischof, Sebastian}},
  title        = {{{On flat groups in affine buildings}}},
  year         = {{2025}},
}

@inproceedings{63571,
  abstract     = {{Prüfungen sind ein wesentlicher Bestandteil des Mathematikunterrichts. Mündliche Prüfungsformate sind insbesondere in Abschlussprüfungen üblich, wurden aber bislang kaum untersucht. Dieses Projekt widmet sich dem Vorkommen und der Bedeutung verschiedener Wissensarten in mündlichen Prüfungen. Dazu soll auf Grundlage videografierter Prüfungsgespräche eine Taxonomie für abgefragte Wissensarten entwickelt werden. Der Vortrag präsentiert die Konzeption sowie erste Ergebnisse einer Vorstudie, die als Basis für eine vertiefte Analyse realer Prüfungen dient.}},
  author       = {{Hellmund, Johannes}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2025}},
  editor       = {{Schick, L. and Platz, M. and Lambert, A.}},
  location     = {{Saarbrücken}},
  pages        = {{1417}},
  publisher    = {{WTM}},
  title        = {{{Mündliche Prüfungen im Mathematikunterricht – welche Arten des Wissens werden abgefragt?}}},
  doi          = {{10.17877/DE290R-25900}},
  year         = {{2025}},
}

@inproceedings{63572,
  author       = {{Demir, Caglar and Yekini, Moshood Olawale and Röder, Michael and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783032060655}},
  issn         = {{0302-9743}},
  location     = {{Porto}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Tree-Based OWL Class Expression Learner over Large Graphs}}},
  doi          = {{10.1007/978-3-032-06066-2_29}},
  year         = {{2025}},
}

@inproceedings{63575,
  author       = {{Kapoor, Sourabh and Sharma, Arnab and Röder, Michael and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031945748}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Robustness Evaluation of Knowledge Graph Embedding Models Under Non-targeted Attacks}}},
  doi          = {{10.1007/978-3-031-94575-5_15}},
  year         = {{2025}},
}

@inproceedings{63573,
  author       = {{Memariani, Adel and Röder, Michael and Sharma, Arnab and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783032095268}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Link Prediction Under Non-targeted Attacks: Do Soft Labels Always Help?}}},
  doi          = {{10.1007/978-3-032-09527-5_6}},
  year         = {{2025}},
}

@inproceedings{63574,
  author       = {{Zhang, Quannian and Röder, Michael and Srivastava, Nikit and KOUAGOU, N'Dah Jean and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Proceedings of the Knowledge Capture Conference 2025}},
  publisher    = {{ACM}},
  title        = {{{Explainable Benchmarking through the Lense of Concept Learning}}},
  doi          = {{10.1145/3731443.3771359}},
  year         = {{2025}},
}

@article{34807,
  abstract     = {{Let $M$ be a compact, real analytic manifold and $G$ be the Lie group of all
real-analytic diffeomorphisms of $M$, which is modelled on the (DFS)-space
${\mathfrak g}$ of real-analytic vector fields on $M$. We study flows of
time-dependent real-analytic vector fields on $M$ which are integrable
functions in time, and their dependence on the time-dependent vector field.
Notably, we show that the Lie group $G$ is $L^1$-regular in the sense that each
$[\gamma]$ in $L^1([0,1],{\mathfrak g})$ has an evolution which is an
absolutely continuous $G$-valued function on $[0,1]$ and smooth in $[\gamma]$.
As tools for the proof, we develop several new results concerning
$L^p$-regularity of infinite-dimensional Lie groups, for $1\leq p\leq \infty$,
which will be useful also for the discussion of other classes of groups.
Moreover, we obtain new results concerning the continuity and complex
analyticity of non-linear mappings on open subsets of locally convex direct
limits.}},
  author       = {{Glöckner, Helge}},
  journal      = {{Nonlinear Analysis}},
  title        = {{{Lie groups of real analytic diffeomorphisms are L^1-regular}}},
  doi          = {{10.1016/j.na.2024.113690}},
  volume       = {{252}},
  year         = {{2025}},
}

@inproceedings{56298,
  abstract     = {{In the general pattern formation (GPF) problem, a swarm of simple autonomous,
disoriented robots must form a given pattern. The robots' simplicity imply a
strong limitation: When the initial configuration is rotationally symmetric,
only patterns with a similar symmetry can be formed [Yamashita, Suzyuki; TCS
2010]. The only known algorithm to form large patterns with limited visibility
and without memory requires the robots to start in a near-gathering (a swarm of
constant diameter) [Hahn et al.; SAND 2024]. However, not only do we not know
any near-gathering algorithm guaranteed to preserve symmetry but most natural
gathering strategies trivially increase symmetries [Castenow et al.; OPODIS
2022].
  Thus, we study near-gathering without changing the swarm's rotational
symmetry for disoriented, oblivious robots with limited visibility (the
OBLOT-model, see [Flocchini et al.; 2019]). We introduce a technique based on
the theory of dynamical systems to analyze how a given algorithm affects
symmetry and provide sufficient conditions for symmetry preservation. Until
now, it was unknown whether the considered OBLOT-model allows for any
non-trivial algorithm that always preserves symmetry. Our first result shows
that a variant of Go-to-the-Average always preserves symmetry but may sometimes
lead to multiple, unconnected near-gathering clusters. Our second result is a
symmetry-preserving near-gathering algorithm that works on swarms with a convex
boundary (the outer boundary of the unit disc graph) and without holes (circles
of diameter 1 inside the boundary without any robots).}},
  author       = {{Gerlach, Raphael and von der Gracht, Sören and Hahn, Christopher and Harbig, Jonas and Kling, Peter}},
  booktitle    = {{28th International Conference on Principles of Distributed Systems (OPODIS 2024)}},
  editor       = {{Bonomi, Silvia and Galletta, Letterio and Rivière,  Etienne and Schiavoni,  Valerio}},
  isbn         = {{978-3-95977-360-7}},
  issn         = {{1868-8969}},
  keywords     = {{Swarm Algorithm, Swarm Robots, Distributed Algorithm, Pattern Formation, Limited Visibility, Oblivious}},
  location     = {{Lucca, Italy}},
  publisher    = {{Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}},
  title        = {{{Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility}}},
  doi          = {{10.4230/LIPIcs.OPODIS.2024.13}},
  volume       = {{324}},
  year         = {{2025}},
}

@article{58532,
  author       = {{Bullerjahn, Nils}},
  journal      = {{arXiv}},
  title        = {{{Error estimates for full discretization by an almost mass conservation technique for Cahn--Hilliard systems with dynamic boundary conditions}}},
  doi          = {{10.48550/ARXIV.2502.03847}},
  year         = {{2025}},
}

@unpublished{58544,
  abstract     = {{We introduce a new classification of multimode states with a fixed number of photons. This classification is based on the factorizability of homogeneous multivariate polynomials and is invariant under unitary transformations. The classes physically correspond to field excitations in terms of single and multiple photons, each of which being in an arbitrary irreducible superposition of quantized modes. We further show how the transitions between classes are rendered possible by photon addition, photon subtraction, and photon-projection nonlinearities. We explicitly put forward a design for a multilayer interferometer in which the states for different classes can be generated with state-of-the-art experimental techniques. Limitations of the proposed designs are analyzed using the introduced classification, providing a benchmark for the robustness of certain states and classes. }},
  author       = {{Kopylov, Denis and Offen, Christian and Ares, Laura and Wembe Moafo, Boris Edgar and Ober-Blöbaum, Sina and Meier, Torsten and Sharapova, Polina and Sperling, Jan}},
  title        = {{{Multiphoton, multimode state classification for nonlinear optical circuits }}},
  year         = {{2025}},
}

@book{58549,
  abstract     = {{<p> Die Publikation richtet sich an Industrieunternehmen und Forschende, die an der Nutzung von Gaia-X für die industrielle Produktion interessiert sind. Sie vereint die Ergebnisse der Forschungsprojekte COSMIC-X, DIONE-X, Fed-X-Pro, GRIPSS-X und URANOS-X, die zur Entwicklung von Anwendungsszenarien für Gaia-X-konforme Datenökosysteme beigetragen haben. Ziel ist es, insbesondere mittelständische Unternehmen in die Lage zu versetzten, souverän Datenräume zu nutzen, um die digitale Transformation voranzutreiben und ihre Wettbewerbsfähigkeit zu steigern. Wichtige Technologien sind dabei Blockchain, Self-Sovereign Identity (SSI) und die Asset Administration Shell (AAS). Die Projektergebnisse stärken die Innovationskraft und eröffnen neue Geschäftsmodelle in der Industrie 4.0. Inhaltsverzeichnis Abstract VII 1 Einleitung 1 1.1 Gaia-X – Chance fur die industrielle Produktion . . . . . . . . . . . . . . . ü 1 1.1.1 Mü oglichkeiten von Gaia-X in der industriellen Produktion . . . . . 4 1.1.2 Die aktuelle Projektlandschaft . . . . . . . . . . . . . . . . . . . . . 7 1.2 Die InGAIA-X Fü orderlinie . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.2.1 Die Projekte . . . . . ... </p>}},
  author       = {{Dumitrescu, Roman and Riedel, Oliver and Henke, Michael and Metternich, Joachim and Ihlenfeldt, Steffen and Koldewey, Christian}},
  isbn         = {{9783186204165}},
  publisher    = {{VDI Verlag}},
  title        = {{{Gaia-X in industriellen Wertschöpfungsnetzwerken – Erkenntnisse aus der Förderlinie InGAIA-X}}},
  doi          = {{10.51202/9783186204165}},
  year         = {{2025}},
}

@article{58558,
  author       = {{Carayannis, Elias G. and Dumitrescu, Roman and Falkowski, Tommy and Papamichail, George and Zota, Nikos - Rigert}},
  issn         = {{0160-791X}},
  journal      = {{Technology in Society}},
  publisher    = {{Elsevier BV}},
  title        = {{{Enhancing SME Resilience through Artificial Intelligence and Strategic Foresight: A Framework for Sustainable Competitiveness}}},
  doi          = {{10.1016/j.techsoc.2025.102835}},
  year         = {{2025}},
}

@inproceedings{58840,
  author       = {{Bucchiarone, Antonio and Bonetti, Federico and Yigitbas, Enes}},
  booktitle    = {{Proceedings of the 20th International Conference on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2025)}},
  publisher    = {{IEEE}},
  title        = {{{Leveraging Self-Adaptive Systems and Generative AI for  Personalizing Educational Serious Games: Architecture and Future  Challenges}}},
  year         = {{2025}},
}

@inproceedings{58839,
  author       = {{Schlenker, Julian and Vater, Hendrik and Yigitbas, Enes and Dann, Alexander}},
  booktitle    = {{Proceedings of the 27th International Conference on Human-Computer Interaction (HCII 2025)}},
  publisher    = {{Springer}},
  title        = {{{Seamless Augmented Reality Support for a Computer-Assisted Surgery System for Minimally Invasive Orthopedic Surgeries}}},
  year         = {{2025}},
}

@inproceedings{58835,
  author       = {{Schmidt, Leonard and Yigitbas, Enes}},
  booktitle    = {{Proceedings of the 18th International Conference on PErvasive Technologies Related to Assistive Environments (PETRA 2025)}},
  publisher    = {{ACM}},
  title        = {{{Taxonomy and Analysis of Security Vulnerabilities, Privacy Violations and Potential Mitigation Strategies to XR Systems}}},
  year         = {{2025}},
}

@inproceedings{58836,
  author       = {{Yigitbas, Enes and Karch, Julian }},
  booktitle    = {{Proceedings of the 18th International Conference on PErvasive Technologies Related to Assistive Environments (PETRA 2025)}},
  publisher    = {{ACM}},
  title        = {{{Immersive Smart Home Planning and Automation with Mixed Reality and Digital Twin Technologies}}},
  year         = {{2025}},
}

