@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}},
}

@inproceedings{58837,
  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        = {{{Augmented Reality-Assisted Assessment of Workplace Ergonomy}}},
  year         = {{2025}},
}

@inproceedings{58838,
  author       = {{Geil, Manuel and Wübbeke, Andreas and Yigitbas, Enes}},
  booktitle    = {{Proceedings of the 27th International Conference on Human-Computer Interaction (HCII 2025)}},
  publisher    = {{Springer}},
  title        = {{{Blackbox Unit Testing of Virtual Reality Applications}}},
  year         = {{2025}},
}

@article{58947,
  author       = {{Krüger, Katja and Werth, Gerda}},
  issn         = {{0732-3123}},
  journal      = {{The Journal of Mathematical Behavior}},
  publisher    = {{Elsevier BV}},
  title        = {{{Mathematics education for girls in Prussia 1890–1925}}},
  doi          = {{10.1016/j.jmathb.2025.101242}},
  volume       = {{79}},
  year         = {{2025}},
}

@unpublished{58953,
  abstract     = {{In this article, we investigate symmetry properties of distributed systems of mobile robots. We consider a swarm of n robots in the OBLOT model and analyze their collective Fsync dynamics using of equivariant dynamical systems theory. To this end, we show that the corresponding evolution function commutes with rotational and reflective transformations of R^2. These form a group that is isomorphic to O(2) x S_n, the product group of the orthogonal group and the permutation on n elements. The theory of equivariant dynamical systems is used to deduce a hierarchy along which symmetries of a robot swarm can potentially increase following an arbitrary protocol. By decoupling the Look phase from the Compute and Move phases in the mathematical description of an LCM cycle, this hierarchy can be characterized in terms of automorphisms of connectivity graphs. In particular, we find all possible types of symmetry increase, if the decoupled Compute and Move phase is invertible. Finally, we apply our results to protocols which induce state-dependent linear dynamics, where the reduced system consisting of only the Compute and Move phase is linear.}},
  author       = {{Gerlach, Raphael and von der Gracht, Sören}},
  booktitle    = {{arXiv:2503.07576}},
  keywords     = {{dynamical systems, coupled systems, distributed computing, robot swarms, autonomous mobile robots, symmetry, equivariant dynamics}},
  pages        = {{23}},
  title        = {{{Analyzing Symmetries of Swarms of Mobile Robots Using Equivariant  Dynamical Systems}}},
  year         = {{2025}},
}

@inproceedings{59019,
  abstract     = {{To facilitate the growing demand for a universal means of digital identification across services, while preserving user control and privacy, multiple digital identity implementations have emerged. From a technical perspective, many of these rely on established concepts within cryptography, allowing them to provide benefits in terms of security and privacy. Recent legislation also promises broader recognition and acceptance of digital identities, both in the digital world and beyond. However, research into the usability, accessibility, and user understanding of digital identities is rare. We argue that the development of usable digital identity wallets is vital to the successful and inclusive application of digital identities in society. In this vision paper, we describe our research plans for obtaining a better understanding of how to develop these usable digital identities wallets.}},
  author       = {{Last, Yorick and Arias Cabarcos, Patricia}},
  booktitle    = {{Symposium on Usable Security and Privacy (USEC) 2025}},
  isbn         = {{979-8-9919276-5-9}},
  location     = {{San Diego, U.S.A.}},
  title        = {{{Vision: Towards True User-Centric Design for Digital Identity Wallets}}},
  year         = {{2025}},
}

@article{59053,
  author       = {{Frischemeier, Daniel and Biehler, Rolf}},
  journal      = {{Stochastik in der Schule}},
  number       = {{1}},
  pages        = {{22--33}},
  title        = {{{Förderung von statistischem Denken im Mathematikunterricht der Primarstufe: Bedeutsame Ideen und Förderungsmöglichkeiten}}},
  volume       = {{45}},
  year         = {{2025}},
}

@inproceedings{58232,
  author       = {{Kruse, Stephan and Brockmeier, Jan and Schwabe, Tobias and Scheytt, J. Christoph}},
  location     = {{Dresden}},
  title        = {{{A Visible Light FMCW Lidar System Based on LEDs}}},
  year         = {{2025}},
}

@inproceedings{58231,
  author       = {{Kruse, Stephan and Surendranath Shroff, Vijayalakshmi and Bahmanian, Meysam and Brockmeier, Jan and Scheytt, J. Christoph}},
  location     = {{Dresden}},
  title        = {{{An Ultra Low Phase Noise Frequency Synthesizer with Optical Output for 77 GHz Photonic Radar}}},
  year         = {{2025}},
}

@article{59169,
  abstract     = {{An r-regular graph is an r-graph, if every odd set of vertices is connected to its complement by at least r edges. Let G and H be r-graphs. An H-coloring of G is a mapping such that each r adjacent edges of G are mapped to r adjacent edges of H. For every , let be an inclusion-wise minimal set of connected r-graphs, such that for every connected r-graph G there is an which colors G. The Petersen Coloring Conjecture states that consists of the Petersen graph P. We show that if true, then this is a very exclusive situation. Our main result is that either or is an infinite set and if , then is an infinite set. In particular, for all , is unique. We first characterize and then prove that if contains more than one element, then it is an infinite set. To obtain our main result we show that contains the smallest r-graphs of class 2 and the smallest poorly matchable r-graphs, and we determine the smallest r-graphs of class 2.}},
  author       = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak H.}},
  issn         = {{0209-9683}},
  journal      = {{Combinatorica}},
  number       = {{2}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Sets of r-Graphs that Color All r-Graphs}}},
  doi          = {{10.1007/s00493-025-00144-4}},
  volume       = {{45}},
  year         = {{2025}},
}

@article{60205,
  author       = {{Black, Tobias}},
  issn         = {{0022-0396}},
  journal      = {{Journal of Differential Equations}},
  publisher    = {{Elsevier BV}},
  title        = {{{Very mild diffusion enhancement and singular sensitivity: Existence of bounded weak solutions in a two-dimensional chemotaxis-Navier–Stokes system}}},
  doi          = {{10.1016/j.jde.2025.113555}},
  volume       = {{443}},
  year         = {{2025}},
}

@inproceedings{60219,
  author       = {{Vermetten, Diederick and Rook, Jeroen and Preuß, Oliver Ludger and de Nobel, Jacob and Doerr, Carola and López-Ibáñez, Manuel and Trautmann, Heike and Bäck, Thomas}},
  booktitle    = {{Evolutionary Multi-Criterion Optimization - 13th International Conference, EMO 2025, Canberra, ACT, Australia, March 4-7, 2025, Proceedings, Part I}},
  editor       = {{Singh, Hemant K. and Ray, Tapabrata and Knowles, Joshua D. and Li, Xiaodong and Branke, Juergen and Wang, Bing and Oyama, Akira}},
  pages        = {{242–256}},
  publisher    = {{Springer}},
  title        = {{{MO-IOHinspector: Anytime Benchmarking of Multi-objective Algorithms Using IOHprofiler}}},
  doi          = {{10.1007/978-981-96-3506-1_17}},
  volume       = {{15512}},
  year         = {{2025}},
}