@techreport{63651,
  author       = {{Grigoryan, Khoren and Lamarz, Jessica and Martin, Lucas and Asmar, Laban and Rabe, Martin and Kühn, Arno and Fichtler, Timm and Petzke, Lisa Irene and Bruchhage, Felix and Koldewey, Christian}},
  title        = {{{product.intelligence - Datenbasiertes Produktmanagement}}},
  doi          = {{10.24406/PUBLICA-4198}},
  year         = {{2025}},
}

@inproceedings{63703,
  author       = {{Hoffbauer, Tilman and Hoos, Holger H. and Bossek, Jakob}},
  booktitle    = {{AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA}},
  editor       = {{Walsh, Toby and Shah, Julie and Kolter, Zico}},
  pages        = {{17223–17230}},
  publisher    = {{AAAI Press}},
  title        = {{{KernelMatmul: Scaling Gaussian Processes to Large Time Series}}},
  doi          = {{10.1609/AAAI.V39I16.33893}},
  year         = {{2025}},
}

@inproceedings{63704,
  author       = {{Wittner, Dominic and Bossek, Jakob}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025}},
  editor       = {{Filipic, Bogdan}},
  pages        = {{340–348}},
  publisher    = {{ACM}},
  title        = {{{Cluster Prevention in Evolutionary Diversity Optimization for Parallel Machine Scheduling}}},
  doi          = {{10.1145/3712256.3726357}},
  year         = {{2025}},
}

@unpublished{63107,
  abstract     = {{We construct good GKP (Gottesman-Kitaev-Preskill) codes (in the sense of Conrad, Eisert and Seifert proposed) from standard short integer solution lattices (SIS) as well as from ring SIS and module SIS lattices, R-SIS and M-SIS lattices, respectively. These lattice are crucial for lattice-based cryptography. Our construction yields GKP codes with distance $\sqrt{n/πe}$. This compares favorably with the NTRU-based construction by Conrad et al. that achieves distance $Ω(\sqrt{n/q}),$ with $n\le q^2/0.28$. Unlike their codes, our codes do not have secret keys that can be used to speed-up the decoding. However, we present a simple decoding algorithm that, for many parameter choices, experimentally yields decoding results similar to the ones for NTRU-based codes. Using the R-SIS and M-SIS construction, our simple decoding algorithm runs in nearly linear time. Following Conrad, Eisert and Seifert's work, our construction of GKP codes follows directly from an explicit, randomized construction of symplectic lattices with (up to constants $\approx 1$) minimal distance $(1/σ_{2n})^{1/2n}\approx \sqrt{\frac{n}{πe}}$, where $σ_{2n}$ is the volume of the 2n-dimensional unit ball. Before this result, Buser and Sarnak gave a non-constructive proof for the existence of such symplectic lattices.}},
  author       = {{Blömer, Johannes and Xiao, Yinzi and Raissi, Zahra and Soltan, Stanislaw}},
  booktitle    = {{arXiv:2509.10183}},
  title        = {{{Symplectic Lattices and GKP Codes -- Simple Randomized Constructions from Cryptographic Lattices}}},
  year         = {{2025}},
}

@book{63713,
  author       = {{Linssen, Oliver  and Volland, Alexander and Yigitbas, Enes and Engstler, Martin and Bertram, Martin and Hanser, Eckhart and Kalenborn, Axel}},
  title        = {{{Projektmanagement Und Vorgehensmodelle 2025 – Post-Agilität, Resilienz, Transformation}}},
  year         = {{2025}},
}

@inproceedings{63786,
  author       = {{Löhnert, Bianca and Augsten, Nikolaus and Okulmus, Cem and Ortiz, Magdalena}},
  booktitle    = {{Proceedings of the 38th International Workshop on Description Logics (DL 2025), Opole, Poland, September 3-6, 2025.}},
  editor       = {{Tendera, Lidia and Ibanez Garcia, Yazmin and Koopmann, Patrick}},
  title        = {{{Query Rewriting for Nested Navigational Queries over Property Graphs}}},
  volume       = {{4091}},
  year         = {{2025}},
}

@inbook{63801,
  author       = {{Gildehaus, Lara and Liebendörfer, Michael and Hüsing, Sven and Gottschalk, Rebecca and Strauß, Franzisca}},
  booktitle    = {{Realitätsbezüge im Mathematikunterricht}},
  isbn         = {{9783662699881}},
  issn         = {{2625-3550}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Normatives Modellieren im Kontext des Klimawandels – wie viel CO2 stoßen Lebensmittel aus?}}},
  doi          = {{10.1007/978-3-662-69989-8_6}},
  year         = {{2025}},
}

@article{63805,
  author       = {{Stoppel, Hannes and Hüsing, Sven}},
  journal      = {{Beiträge zum Mathematikunterricht; 58}},
  publisher    = {{Gesellschaft für Didaktik der Mathematik}},
  title        = {{{Konstruktionistisches Geometrielernen durch epistemisches Programmieren in Scratch}}},
  doi          = {{10.17877/DE290R-25995}},
  year         = {{2025}},
}

@inproceedings{63803,
  author       = {{Hüsing, Sven and Podworny, Susanne}},
  booktitle    = {{Symposium on integrating AI and data science into school education across disciplines}},
  title        = {{{Empowering Students to Gain Insights within Data Exploration Projects in the Classroom - Using, Modifying, and Creating Data Moves through a Scaffolded Use of Digital Tools}}},
  year         = {{2025}},
}

@inproceedings{58763,
  abstract     = {{Utilizing data is crucial for economic success, but a lack of interoperability and concerns about the misuse of ones own data are hindering the cross-organizational use of data. Dataspaces provide the infrastructure necessary to integrate heterogeneous data sources within an organization or ecosystem, enabling seamless data interaction and interoperability. In addition, data spaces strengthen data sovereignty through their decentralized nature, which enables organizations to effectively control and manage their data. However, challenges persist in managing the complexity and dynamic nature of dataspaces, requiring significant resources and technical expertise. The decentralized nature leads to a large and diverse number of stakeholders, who need to agree on the use and scope of a dataspace. Modeling is a common approach to cope with technical complexity and heterogeneous stakeholders. In this paper, we propose a version of SysML and a corresponding method that focus on the modelling of data spaces. We provide a dataspace modelling method to unify the understanding of dataspaces and scope among all stakeholders to simplify the design and development process.}},
  author       = {{Kulkarni, Pranav Jayant and Zerbin, Julian and Koldewey, Christian and Bernijazov, Ruslan and Dumitrescu, Roman}},
  booktitle    = {{2024 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)}},
  keywords     = {{Dataspaces, Modelling, SysML, Gaia-X, System Specification}},
  location     = {{Sharjah, United Arab Emirates }},
  publisher    = {{IEEE}},
  title        = {{{Using SysML as a Modelling Language for Dataspaces}}},
  doi          = {{10.1109/ictmod63116.2024.10878227}},
  year         = {{2025}},
}

@misc{63407,
  author       = {{Anonymous, A}},
  title        = {{{Limitations of the Random Oracle Model}}},
  year         = {{2025}},
}

@misc{63408,
  author       = {{Anonymous, A}},
  title        = {{{Clustering with Rényi Divergence}}},
  year         = {{2025}},
}

@misc{63406,
  author       = {{Anoynmous, A}},
  title        = {{{BUFF Transform}}},
  year         = {{2025}},
}

@unpublished{61065,
  abstract     = {{Abduction is the task of computing a sufficient extension of a knowledge base (KB) that entails a conclusion not entailed by the original KB. It serves to compute explanations, or hypotheses, for such missing entailments. While this task has been intensively investigated for perfect data and under classical semantics, less is known about abduction when erroneous data results in inconsistent KBs. In this paper we define a suitable notion of abduction under repair semantics and propose a set of minimality criteria that guides abduction towards `useful' hypotheses. We provide initial complexity results on deciding existence of and verifying abductive solutions with these criteria, under different repair semantics and for the description logics DL-Lite and EL_bot.}},
  author       = {{Haak, Anselm and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}},
  booktitle    = {{arXiv:2507.21955}},
  title        = {{{Why not? Developing ABox Abduction beyond Repairs}}},
  year         = {{2025}},
}

@inproceedings{63888,
  author       = {{Haak, Anselm and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}},
  booktitle    = {{Proceedings of the 38th International Workshop on Description Logics - DL 2025}},
  editor       = {{Tendera, Lidia and Ibanez Garcia, Yazmin and Koopmann, Patrick}},
  location     = {{Opole, Poland}},
  title        = {{{Why not? Developing ABox Abduction beyond Repairs}}},
  year         = {{2025}},
}

@inproceedings{62285,
  abstract     = {{The sliding square model is a widely used abstraction for studying self-reconfigurable robotic systems, where modules are square-shaped robots that move by sliding or rotating over one another. In this paper, we propose a novel distributed algorithm that enables a group of modules to reconfigure into a rhombus shape, starting from an arbitrary side-connected configuration. It is connectivity-preserving and operates under minimal assumptions: one leader module, common chirality, constant memory per module, and visibility and communication restricted to immediate neighbors. Unlike prior work, which relaxes the original sliding square move-set, our approach uses the unmodified move-set, addressing the additional challenge of handling locked configurations. Our algorithm is sequential in nature and operates with a worst-case time complexity of O(n^2) rounds, which is optimal for sequential algorithms. To improve runtime, we introduce two parallel variants of the algorithm. Both rely on a spanning tree data structure, allowing modules to make decisions based on local connectivity. Our experimental results show a significant speedup for the first variant, and a linear average runtime for the second variant, which is worst-case optimal for parallel algorithms.}},
  author       = {{Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}},
  booktitle    = {{Stabilization, Safety, and Security of Distributed Systems}},
  editor       = {{Bonomi, Silvia and Mandal, Partha Sarathi and Robinson, Peter and Sharma, Gokarna and Tixeuil, Sebastien}},
  isbn         = {{9783032111265}},
  issn         = {{0302-9743}},
  location     = {{Kathmandu}},
  pages        = {{325--342}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Invited Paper: Distributed Rhombus Formation of Sliding Squares}}},
  doi          = {{10.1007/978-3-032-11127-2_26}},
  year         = {{2025}},
}

@article{64098,
  author       = {{Scheideler, Christian and Padalkin, Andreas and Kumar, Manish}},
  journal      = {{Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)}},
  title        = {{{Reconfiguration and locomotion with joint movements in the amoebot model. Auton. Robots 49(3): 22 (2025)}}},
  year         = {{2025}},
}

@inproceedings{64094,
  author       = {{Scheideler, Christian and Artmann, Matthias and Maurer, Tobias  and Padalkin, Andreas and Warner, Daniel}},
  title        = {{{AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). }}},
  year         = {{2025}},
}

@book{64099,
  editor       = {{Scheideler, Christian and Meeks, Kitty}},
  title        = {{{4th Symposium on Algorithmic Foundations of Dynamic Networks.}}},
  year         = {{2025}},
}

@inproceedings{64097,
  author       = {{Scheideler, Christian and Artmann, Matthias and Padalkin, Andreas}},
  title        = {{{On the Shape Containment Problem Within the Amoebot Model with Reconfigurable Circuits. }}},
  year         = {{2025}},
}