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

@article{60220,
  author       = {{Seiler, Moritz and Kerschke, Pascal and Trautmann, Heike}},
  journal      = {{Evolutionary Computation}},
  pages        = {{1--27}},
  title        = {{{Deep-ELA: Deep Exploratory Landscape Analysis with Self-Supervised Pretrained Transformers for Single- and Multi-Objective Continuous Optimization Problems }}},
  doi          = {{https://doi.org/10.1162/evco_a_00367}},
  year         = {{2025}},
}

@unpublished{60293,
  abstract     = {{In this work, we present a complete characterization of the covariance
structure of number statistics in boxes for hyperuniform point processes. Under
a standard integrability assumption, the covariance depends solely on the
overlap of the faces of the box. Beyond this assumption, a novel interpolating
covariance structure emerges. This enables us to identify a limiting Gaussian
'coarse-grained' process, counting the number of points in large boxes as a
function of the box position. Depending on the integrability assumption, this
process may be continuous or discontinuous, e.g. in d=1 it is given by an
increment process of a fractional Brownian motion.}},
  author       = {{Jalowy, Jonas and Stange, Hanna}},
  booktitle    = {{arXiv:2506.13661}},
  title        = {{{Box-Covariances of Hyperuniform Point Processes}}},
  year         = {{2025}},
}

@inproceedings{59804,
  author       = {{Jungemann, Linus and Wintermann, Bjarne and Riebler, Heinrich and Plessl, Christian}},
  booktitle    = {{Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies}},
  location     = {{Kumamoto, Japan}},
  publisher    = {{ACM}},
  title        = {{{FINN-HPC: Closing the Gap for Energy-Efficient Neural Network Inference on FPGAs in HPC}}},
  doi          = {{10.1145/3728179.3728189}},
  year         = {{2025}},
}

@article{60351,
  abstract     = {{<jats:p>This article is a short summary of the report of survey team 3, presented to the 15th International Congress on Mathematical Education (ICME-15) in Sydney in July 2024.</jats:p>}},
  author       = {{Biehler, Rolf and Kawakami, Takashi and Lampen, Erna and Weiland, Travis and Zapata-Cardona, Lucía}},
  issn         = {{2747-7894}},
  journal      = {{European Mathematical Society Magazine}},
  publisher    = {{European Mathematical Society - EMS - Publishing House GmbH}},
  title        = {{{Statistics and data science education as a vehicle for empowering citizens – short summary of a survey}}},
  doi          = {{10.4171/mag/257}},
  year         = {{2025}},
}

@article{60357,
  abstract     = {{<jats:p>Transcripts play a crucial role in qualitative research in computing education, with significant implications for the credibility and reproducibility of findings. However, unreflective and inconsistent transcription standards may unintentionally introduce biases, potentially undermining the validity of research outcomes and the collective progress of the field. In this article, we introduce transcription as a theoretically guided process rather than a mere preparatory step, illustrating its role using a case example. Additionally, through a systematic review of 107 qualitative research articles in computing education, we identify widespread shortcomings in the reporting and implementation of transcription practices, revealing a need for greater intentionality and transparency. To address these challenges, we propose a three-step framework for selecting, applying, and documenting transcription standards that align with the specific context and goals of a study. Rather than advocating for overly complex, one-size-fits-all transcription strategies, we emphasize the importance of a context-appropriate approach that is clearly communicated to foster trust and reproducibility. By advancing a more robust transcription culture, this work aims to support computing education researchers in adopting standards that enhance the quality and reliability of qualitative research in the field.</jats:p>}},
  author       = {{Terfloth, Lutz and Lohmer, Vivien and Kern, Friederike and Schulte, Carsten}},
  issn         = {{1648-5831}},
  journal      = {{Informatics in Education}},
  publisher    = {{Vilnius University Press}},
  title        = {{{Transcription in Computing Education Research: A Review and Recommendations}}},
  doi          = {{10.15388/infedu.2025.09}},
  year         = {{2025}},
}

@article{53805,
  abstract     = {{The article introduces a method to learn dynamical systems that are governed by Euler–Lagrange equations from data. The method is based on Gaussian process regression and identifies continuous or discrete Lagrangians and is, therefore, structure preserving by design. A rigorous proof of convergence as the distance between observation data points converges to zero and lower bounds for convergence rates are provided. Next to convergence guarantees, the method allows for quantification of model uncertainty, which can provide a basis of adaptive sampling techniques. We provide efficient uncertainty quantification of any observable that is linear in the Lagrangian, including of Hamiltonian functions (energy) and symplectic structures, which is of interest in the context of system identification. The article overcomes major practical and theoretical difficulties related to the ill-posedness of the identification task of (discrete) Lagrangians through a careful design of geometric regularisation strategies and through an exploit of a relation to convex minimisation problems in reproducing kernel Hilbert spaces.}},
  author       = {{Offen, Christian}},
  journal      = {{Mathematics of Computation}},
  publisher    = {{American Mathematical Society}},
  title        = {{{Machine learning of continuous and discrete variational ODEs with convergence guarantee and uncertainty quantification}}},
  doi          = {{10.1090/mcom/4120}},
  year         = {{2025}},
}

@article{60496,
  abstract     = {{<jats:p>Hypertree decompositions provide a way to evaluate Conjunctive Queries (CQs) in polynomial time, where the exponent of this polynomial is determined by the width of the decomposition. In theory, the goal of efficient CQ evaluation therefore has to be a minimisation of the width. However, in practical settings, it turns out that there are also other properties of a decomposition that influence the performance of query evaluation. It is therefore of interest to restrict the computation of decompositions by constraints and to guide this computation by preferences. To this end, we propose a novel framework based on candidate tree decompositions, which allows us to introduce soft hypertree width (shw). This width measure is a relaxation of hypertree width (hw); it is never greater than hw and, in some cases, shw may actually be lower than hw. Most importantly, shw preserves the tractability of deciding if a given CQ is below some fixed bound, while offering more algorithmic flexibility. In particular, it provides a natural way to incorporate preferences and constraints into the computation of decompositions. A prototype implementation and preliminary experiments confirm that this novel framework can indeed have a practical impact on query evaluation.</jats:p>}},
  author       = {{Lanzinger, Matthias and Okulmus, Cem and Pichler, Reinhard and Selzer, Alexander and Gottlob, Georg}},
  issn         = {{2836-6573}},
  journal      = {{Proceedings of the ACM on Management of Data}},
  location     = {{Berlin}},
  number       = {{2}},
  pages        = {{1--25}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Soft and Constrained Hypertree Width}}},
  doi          = {{10.1145/3725251}},
  volume       = {{3}},
  year         = {{2025}},
}

@article{60495,
  author       = {{Podworny, Susanne and Fleischer, Yannik and Biehler, Rolf}},
  journal      = {{Stochastik in der Schule}},
  number       = {{2}},
  pages        = {{9--16}},
  title        = {{{Explorative Datenanalyse in der Schule – Analyse der Mediennutzung von Jugendlichen mit den YOU‑PB Daten}}},
  volume       = {{45}},
  year         = {{2025}},
}

@unpublished{60491,
  abstract     = {{We investigate generalisations of 1-factorisations and hyperfactorisations of the complete graph $K_{2n}$. We show that they are special subsets of the association scheme obtained from the Gelfand pair $(S_{2n},S_2 \wr S_n)$. This unifies and extends results by Cameron (1976) and gives rise to new existence and non-existence results. Our methods involve working in the group algebra $\mathbb{C}[S_{2n}]$ and using the representation theory of $S_{2n}$.}},
  author       = {{Klawuhn, Lukas-André Dominik and Bamberg, John}},
  title        = {{{On the association scheme of perfect matchings and their designs}}},
  year         = {{2025}},
}

@inproceedings{60497,
  abstract     = {{Despite the advantages that the virtual knowledge graph paradigm has brought to many application domains, state-of-the-art systems still do not support popular graph database management systems like Neo4j. Their query rewriting algorithms focus on languages like conjunctive queries and their unions, which were developed for relational data and are poorly suited for graph data. Moreover, they also limit the expressiveness of the ontology languages that admit rewritings, restricting them to those that enjoy the so-called FO-rewritability property. Rewritings have thus focused on the DL-Lite family of Description Logics. In this paper, we propose a technique for rewriting a family of navigational queries for a suitably tailored fragment of ELHI. Leveraging navigational features in the target query language, we can include some widely-used axiom shapes not supported by DL-Lite. We implemented a proof-of-concept prototype that rewrites into Cypher queries, and tested it on a real-world cognitive neuroscience use case with promising results.}},
  author       = {{Löhnert, Bianca and Augsten, Nikolaus and Okulmus, Cem and Ortiz, Magdalena}},
  booktitle    = {{The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}}},
  isbn         = {{9783031945748}},
  issn         = {{0302-9743}},
  keywords     = {{Ontology-based Data Access, Property Graphs, Navigational Queries}},
  location     = {{Portorož, Slovenia}},
  pages        = {{342----361}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite}}},
  doi          = {{10.1007/978-3-031-94575-5_19}},
  volume       = {{15718}},
  year         = {{2025}},
}

@inproceedings{60502,
  author       = {{Zeipert, Henning and Claes, Leander and Stoeckel, Chris and Mulay, Shubham and Henning, Bernd}},
  location     = {{Nürnberg}},
  title        = {{{Evaluation of piezoelectric micromachined ultrasonic transducers (PMUT) for the broadband detection of ultrasonic elastic waves}}},
  doi          = {{10.5162/SMSI2025/D5.2}},
  year         = {{2025}},
}