@inproceedings{66833, author = {{Kummita, Sriteja and Schiebel, Fabian Benedikt and Bodden, Eric and Miao, Miao and Wei, Shiyi}}, booktitle = {{2026 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)}}, publisher = {{IEEE}}, title = {{{Static Analysis Traces can Help Dynamic Symbolic Execution: a Replication Study}}}, doi = {{10.1109/saner67736.2026.00114}}, year = {{2026}}, } @article{66838, 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 and Scheideler, Christian}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, keywords = {{modular robots, distributed algorithms, sliding squares}}, publisher = {{Elsevier BV}}, title = {{{Distributed rhombus formation of sliding squares}}}, doi = {{10.1016/j.tcs.2026.116196}}, volume = {{1085}}, year = {{2026}}, } @inproceedings{66097, author = {{Kononova, Anna V. and van Stein, Niki and Mersmann, Olaf and Bäck, Thomas and Bartz-Beielstein, Thomas and Glasmachers, Tobias and Hellwig, Michael and Krey, Sebastian and Kudela, Jakub and Naujoks, Boris and Papenmeier, Leonard and Raponi, Elena and Renau, Quentin and Rook, Jeroen and Schäpermeier, Lennart and Vermetten, Diederick and Zaharie, Daniela}}, booktitle = {{Applications of Evolutionary Computation - 29th European Conference, EvoApplications 2026, Held as Part of EvoStar 2026, Toulouse, France, April 8-10, 2026, Proceedings, Part II}}, editor = {{García-Sánchez, Pablo and lvarez, Josefa Díaz and Murphy, Aidan}}, pages = {{327–344}}, publisher = {{Springer}}, title = {{{Benchmarking that Matters: Rethinking Benchmarking in Continuous Optimisation for Practical Impact}}}, doi = {{10.1007/978-3-032-23607-4_20}}, volume = {{16525}}, year = {{2026}}, } @inproceedings{66095, author = {{Skvorc, Urban and van Stein, Niki and Seiler, Moritz and Grimme, Britta and Bäck, Thomas and Trautmann, Heike}}, booktitle = {{Applications of Evolutionary Computation - 29th European Conference, EvoApplications 2026, Held as Part of EvoStar 2026, Toulouse, France, April 8-10, 2026, Proceedings, Part II}}, editor = {{García-Sánchez, Pablo and lvarez, Josefa Díaz and Murphy, Aidan}}, pages = {{183–199}}, publisher = {{Springer}}, title = {{{LLM Driven Design of Continuous Optimization Problems with Controllable High-Level Properties}}}, doi = {{10.1007/978-3-032-23607-4_12}}, volume = {{16525}}, year = {{2026}}, } @inproceedings{61777, abstract = {{Classical shadows are succinct classical representations of quantum states which allow one to encode a set of properties P of a quantum state rho, while only requiring measurements on logarithmically many copies of rho in the size of P. In this work, we initiate the study of verification of classical shadows, denoted classical shadow validity (CSV), from the perspective of computational complexity, which asks: Given a classical shadow S, how hard is it to verify that S predicts the measurement statistics of a quantum state? We show that even for the elegantly simple classical shadow protocol of [Huang, Kueng, Preskill, Nature Physics 2020] utilizing local Clifford measurements, CSV is QMA-complete. This hardness continues to hold for the high-dimensional extension of said protocol due to [Mao, Yi, and Zhu, PRL 2025]. Among other results, we also show that CSV for exponentially many observables is complete for a quantum generalization of the second level of the polynomial hierarchy, yielding the first natural complete problem for such a class.}}, author = {{Karaiskos, Georgios and Rudolph, Dorian and Meyer, Johannes Jakob and Eisert, Jens and Gharibian, Sevag}}, booktitle = {{International Colloquium on Automata, Languages, and Programming (ICALP)}}, number = {{123}}, pages = {{1--23}}, title = {{{How hard is it to verify a classical shadow?}}}, volume = {{374}}, year = {{2026}}, } @article{56116, author = {{Glöckner, Helge and Grong, Erlend and Schmeding, Alexander}}, journal = {{Differential Geometry and its Applications}}, title = {{{Boundary values of diffeomorphisms of simple polytopes, and controllability}}}, doi = {{10.1016/j.difgeo.2026.102404}}, volume = {{104}}, year = {{2026}}, } @article{66121, author = {{Bruns, Julia and Gasteiger, Hedwig and Hallemann, Svea and Schopferer, Theresa}}, issn = {{1479-4802}}, journal = {{Research in Mathematics Education}}, pages = {{1--21}}, publisher = {{Informa UK Limited}}, title = {{{Leadership practices in implementing early mathematics education as a curriculum innovation into vocational training of early childhood education}}}, doi = {{10.1080/14794802.2026.2689902}}, year = {{2026}}, } @inproceedings{64909, author = {{Khedkar, Mugdha and Schlichtig, Michael and Bodden, Eric}}, booktitle = {{IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)}}, title = {{{Source Code-Driven GDPR Documentation: Supporting RoPA with Assessor View}}}, doi = {{10.1109/SANER67736.2026.00109}}, year = {{2026}}, } @inproceedings{66433, author = {{Schiebel, Fabian Benedikt and Bodden, Eric}}, booktitle = {{40th European Conference on Object-Oriented Programming (ECOOP 2026)}}, editor = {{Krebbers, Robbert and Silva, Alexandra}}, isbn = {{978-3-95977-423-9}}, issn = {{1868-8969}}, pages = {{23:1–23:28}}, publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}}, title = {{{Scaling Bottom-Up IFDS Taint Analysis with Optimized Data-Flow Encoding}}}, doi = {{10.4230/LIPIcs.ECOOP.2026.23}}, volume = {{372}}, year = {{2026}}, } @inproceedings{66429, author = {{Kummita, Sriteja and Schiebel, Fabian Benedikt and Bodden, Eric and Miao, Miao and Wei, Shiyi}}, booktitle = {{2026 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)}}, publisher = {{IEEE}}, title = {{{Static Analysis Traces can Help Dynamic Symbolic Execution: a Replication Study}}}, doi = {{10.1109/saner67736.2026.00114}}, year = {{2026}}, } @inproceedings{66462, abstract = {{Germany is experiencing a shortage of teachers, a situation that is particularly evident in the domain of technical vocational education. In response to this, various pathways into vocational teacher education have been established. These pathways are diverse in their nature but all lead to the same teacher degree as traditional teacher education. In two interview studies (n=22 (pre service) vocational teachers), initial motives of entering teacher education (based on FIT-Choice) as well as retrospective views on the career choice after entering the profession (based on PLP model) are analyzed. The present study compares the reflective views of pre-service teachers and career-changing in-service teachers (CCIT). Although both groups generally perceive their career choice positively, the results raise questions about why CCITs did not enter the field of teacher education in the first place. Additionally, the analysis allows for further discussion about existing teacher education programs in times of teacher shortage.}}, author = {{Vernholz, Mats and Jonas-Ahrend, Gabriela and Temmen, Katrin}}, keywords = {{vocational teacher education, teacher shortage, career-changing teachers, teacher reflections}}, location = {{Boat Viking Glory}}, title = {{{Different Pathways, Shared Challenges: Reflections on Entering Vocational Teaching in Germany }}}, year = {{2026}}, } @inproceedings{66461, author = {{Vernholz, Mats and Schäfers, Johannes and Jonas-Ahrend, Gabriela and Temmen, Katrin}}, title = {{{Shifting Minds or Reinforcing Myths? Empirical Insights into AI-related Affective Changes Among Future Technology Teachers}}}, year = {{2026}}, } @inproceedings{66459, author = {{Guberman, Ainat and Jonas-Ahrend, Gabriela and Arvif-Elyashiv, Rinat and Ben-Yehduah, Gal and Cyprus, Dominik}}, location = {{Los Angeles, CA, USA}}, title = {{{Exploring (De)Motivating Factors over Time: Perspectives of Career Change STEM Teachers from Germany and Israel}}}, year = {{2026}}, } @inproceedings{66599, author = {{Beutner, Marc and Koppius, Sebastian Niklas and Schäfers, Johannes and Temmen, Katrin}}, booktitle = {{bwp@ Spezial HT2025: Nachhaltig – Digital – Chancengerecht. Zukunftsszenarien von Arbeit, Bildung und Beruf }}, editor = {{Hartwich, Katharina and Heisler, Dietmar and Lippegaus, Petra and Schmökel, Michelle and Schwede, Jana and Sommer, Christian}}, issn = {{1618-8543}}, keywords = {{5. Generation des Mobilfunkstandards (5G), Digitaler Reifegrad im Berufsschulunterricht, Best-Practice-Beispiele}}, location = {{Paderborn}}, publisher = {{bwp@ Berufs- und Wirtschaftspädagogik - online}}, title = {{{Die Ausbildung von morgen gestalten: mit 5G und für 5G. Unterrichtliche Anwendungsbeispiele für das Lernen mit 5G und für 5G an kaufmännischen und gewerblich-technischen Berufskollegs aus Ostwestfalen-Lippe }}}, year = {{2026}}, } @inproceedings{66610, author = {{Stojko, Laura and Herder, Eelco and Strecker-Bischoff, Jannis and Sänger, Julia Seitz and Neumayr, Thomas and Yigitbas, Enes and Augstein, Mirjam}}, booktitle = {{Companion Publication of the 2026 18th ACM Web Science Conference, WebSci Companion 2026, Braunschweig, Germany, May 26-29, 2026}}, editor = {{Balke, Wolf-Tilo and Plötzky, Florian and Spaniol, Marc and Herder, Eelco and Manikonda, Lydia and Liu, Haiming and Ibáñez, Luis-Daniel and Rezapour, Rezvaneh}}, pages = {{108–109}}, publisher = {{ACM}}, title = {{{ABIS 2026: The Effects of the Adaptive Web on Society}}}, doi = {{10.1145/3795513.3810983}}, year = {{2026}}, } @article{66638, abstract = {{Smart cities promise safer streets, smoother traffic, and more efficient services, enabled by dense networks of urban sensors. Yet this infrastructure, often unnoticed by citizens, introduces pervasive privacy risks, from tracking, profiling, and sensitive inferences to subtle forms of self-censorship. Despite widespread deployment, little is known about how the public understands and perceives these sensing systems. To address this gap, we present an intervention based user study (n = 172) in which participants are exposed to data collection by six urban sensors, including cameras and alternative technologies commonly framed as privacy-preserving. Participants encounter either the sensors alone or sensors accompanied by real-time data visualizations. Our results reveal widespread misunderstanding of some sensors (radar, LiDAR, Wi-Fi, depth, and thermal imaging sensors), particularly their capacity for identification and for attribute inferences such as gender or age. We also identify persistent misconceptions, including the belief that Wi-Fi poses privacy risks only when users connect to public networks. While making sensors visible and visualizing collected data improves privacy awareness, these measures alone are not enough for citizens to understand the actual risks of urban sensing. We derive recommendations for privacy-respecting smart city environments grounded in citizens’ informational needs and expectations.}}, author = {{Todt, Julian and Kablo, Emiram and Morsbach, Felix and Arias Cabarcos, Patricia and Strufe, Thorsten}}, issn = {{2299-0984}}, journal = {{Proceedings on Privacy Enhancing Technologies}}, number = {{4}}, pages = {{7--35}}, publisher = {{Privacy Enhancing Technologies Symposium Advisory Board}}, title = {{{“The city isn’t uploading me to TikTok”: Exploring Privacy Attitudes towards Data Collection in Urban Public Spaces}}}, doi = {{10.56553/popets-2026-0108}}, volume = {{2026}}, year = {{2026}}, } @inproceedings{65493, author = {{Kablo, Emiram and Sharafi, Avishan and Arias Cabarcos, Patricia}}, booktitle = {{Proceedings of the Extended Abstracts of the 2026 CHI Conference on Human Factors in Computing Systems}}, publisher = {{ACM}}, title = {{{"I store some passwords in WhatsApp": Understanding User Experiences and Usability Challenges of Password Managers in Virtual Reality}}}, doi = {{10.1145/3772363.3798346}}, year = {{2026}}, } @inproceedings{66631, author = {{Gortworst, Bente and Okulmus, Cem and Ortiz, Magdalena and Turhan, Anni-Yasmin}}, booktitle = {{Proceedings of the 25th International Semantic Web Conference (ISWC 2026)}}, title = {{{Shapes from Examples: Foundations of Shape Learning in Recursive SHACL}}}, year = {{2026}}, } @inproceedings{66670, author = {{Mensendiek, Carolin and Preuß, Oliver Ludger and Rook, Jeroen and Chicano, Francisco and Whitley, Darrell and Trautmann, Heike}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2026, Centro Internacional de Convenciones CIC-ANDE, San Jose, Costa Rica, July 13-17, 2026}}, editor = {{Trujillo, Leonardo and Hu, Ting}}, pages = {{134–142}}, publisher = {{ACM}}, title = {{{Digging to the Ground Truth: Solving Multi-objective Gray-Box Optimization Problems through Hyperplane Elimination}}}, doi = {{10.1145/3795095.3805136}}, year = {{2026}}, } @misc{66676, booktitle = {{Der Mathematikunterricht}}, editor = {{Büchter, Theresa and Eichler, Andreas and Binder, Karin}}, number = {{3}}, pages = {{2--5}}, publisher = {{Friedrich Verlag}}, title = {{{Simulationen in der MINT-Bildung - Impulse für den Mathematikunterricht}}}, volume = {{72}}, year = {{2026}}, }