@article{44077, author = {{Maack, Marten}}, issn = {{0167-6377}}, journal = {{Operations Research Letters}}, keywords = {{Applied Mathematics, Industrial and Manufacturing Engineering, Management Science and Operations Research, Software}}, number = {{3}}, pages = {{220--225}}, publisher = {{Elsevier BV}}, title = {{{Online load balancing on uniform machines with limited migration}}}, doi = {{10.1016/j.orl.2023.02.013}}, volume = {{51}}, year = {{2023}}, } @misc{43374, author = {{Schürmann, Patrick}}, title = {{{ A Formal Comparison of Advanced Digital Signature Primitives}}}, year = {{2023}}, } @inproceedings{20841, author = {{Gharibian, Sevag and Watson, James and Bausch, Johannes}}, booktitle = {{Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)}}, pages = {{54:1--54:21}}, title = {{{The Complexity of Translationally Invariant Problems beyond Ground State Energies}}}, doi = {{https://doi.org/10.4230/LIPIcs.STACS.2023.54}}, volume = {{254}}, year = {{2023}}, } @unpublished{44501, abstract = {{Extending the notion of maxcut, the study of the frustration index of signed graphs is one of the basic questions in the theory of signed graphs. Recently two of the authors initiated the study of critically frustrated signed graphs. That is a signed graph whose frustration index decreases with the removal of any edge. The main focus of this study is on critical signed graphs which are not edge-disjoint unions of critically frustrated signed graphs (namely non-decomposable signed graphs) and which are not built from other critically frustrated signed graphs by subdivision. We conjecture that for any given k there are only finitely many critically k-frustrated signed graphs of this kind. Providing support for this conjecture we show that there are only two of such critically 3-frustrated signed graphs where there is no pair of edge-disjoint negative cycles. Similarly, we show that there are exactly ten critically 3-frustrated signed planar graphs that are neither decomposable nor subdivisions of other critically frustrated signed graphs. We present a method for building non-decomposable critically frustrated signed graphs based on two given such signed graphs. We also show that the condition of being non-decomposable is necessary for our conjecture. }}, author = {{Cappello, Chiara and Naserasr, Reza and Steffen, Eckhard and Wang, Zhouningxin}}, booktitle = {{arXiv:2304.10243}}, title = {{{Critically 3-frustrated signed graphs}}}, year = {{2023}}, } @inproceedings{44194, author = {{Ahmed, Qazi Arbab and Awais, Muhammad and Platzner, Marco}}, booktitle = {{The 24th International Symposium on Quality Electronic Design (ISQED'23), San Francisco, Califorina USA}}, location = {{San Fransico CA 94023-0607, USA}}, title = {{{MAAS: Hiding Trojans in Approximate Circuits}}}, year = {{2023}}, } @misc{44735, author = {{Schweichhart, Jonas}}, title = {{{Minimum Edge Cuts in Overlay Networks}}}, year = {{2023}}, } @inbook{44769, author = {{Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide, Friedhelm}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031304477}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Unifying Gathering Protocols for Swarms of Mobile Robots}}}, doi = {{10.1007/978-3-031-30448-4_1}}, year = {{2023}}, } @article{44857, abstract = {{Ancestral reconstruction is a classic task in comparative genomics. Here, we study the genome median problem, a related computational problem which, given a set of three or more genomes, asks to find a new genome that minimizes the sum of pairwise distances between it and the given genomes. The distance stands for the amount of evolution observed at the genome level, for which we determine the minimum number of rearrangement operations necessary to transform one genome into the other. For almost all rearrangement operations the median problem is NP-hard, with the exception of the breakpoint median that can be constructed efficiently for multichromosomal circular and mixed genomes. In this work, we study the median problem under a restricted rearrangement measure called c4-distance, which is closely related to the breakpoint and the DCJ distance. We identify tight bounds and decomposers of the c4-median and develop algorithms for its construction, one exact ILP-based and three combinatorial heuristics. Subsequently, we perform experiments on simulated data sets. Our results suggest that the c4-distance is useful for the study the genome median problem, from theoretical and practical perspectives.}}, author = {{Silva, Helmuth O.M. and Rubert, Diego P. and Araujo, Eloi and Steffen, Eckhard and Doerr, Daniel and Martinez, Fábio V.}}, issn = {{0399-0559}}, journal = {{RAIRO - Operations Research}}, keywords = {{Management Science and Operations Research, Computer Science Applications, Theoretical Computer Science}}, number = {{3}}, pages = {{1045--1058}}, publisher = {{EDP Sciences}}, title = {{{Algorithms for the genome median under a restricted measure of rearrangement}}}, doi = {{10.1051/ro/2023052}}, volume = {{57}}, year = {{2023}}, } @unpublished{44859, author = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}}, booktitle = {{arXiv:2305.08619}}, title = {{{Sets of r-graphs that color all r-graphs}}}, year = {{2023}}, } @inproceedings{34294, author = {{Wolters, Dennis and Engels, Gregor}}, booktitle = {{MODELSWARD'23}}, isbn = {{978-989-758-633-0}}, issn = {{2184-4348}}, pages = {{133--142}}, publisher = {{SCITEPRESS}}, title = {{{Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards}}}, doi = {{10.5220/0011675700003402}}, year = {{2023}}, } @phdthesis{43108, author = {{Pauck, Felix}}, publisher = {{Paderborn University}}, title = {{{Cooperative Android App Analysis}}}, doi = {{10.17619/UNIPB/1-1698}}, year = {{2023}}, } @inproceedings{45188, author = {{Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}}, title = {{{Routing Schemes for Hybrid Communication Networks}}}, doi = {{10.48550/ARXIV.2210.05333}}, year = {{2023}}, } @inproceedings{44855, abstract = {{Market transactions are subject to information asymmetry about the delivered value proposition, causing transaction costs and adverse market effects among buyers and sellers. Information systems research has investigated how review systems can reduce information asymmetry in business-to-consumer markets. However, these systems cannot be readily applied to business-to-business markets, are vulnerable to manipulation, and suffer from conceptual weak spots since they use textual data or star ratings. Building on design science research, we conceptualize a new class of reputation systems based on monetary-based payments as quantitative ratings for each transaction stored on a blockchain. Using cryptography, we show that our system assures content confidentiality so that buyers can share and sell their ratings selectively, establishing a reputation ecosystem. Our prescriptive insights advance the design of reputation systems and offer new paths to understanding the antecedents, dynamics, and consequences to reduce information asymmetry in B2B transactions.}}, author = {{Hemmrich, Simon and Bobolz, Jan and Beverungen, Daniel and Blömer, Johannes}}, booktitle = {{ECIS 2023 Research Papers}}, title = {{{Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain}}}, year = {{2023}}, } @inproceedings{45205, author = {{Dreiling, Dmitrij and Itner, Dominik and Hetkämper, Tim and Birk, Carolin and Gravenkamp, Hauke and Henning, Bernd}}, booktitle = {{SMSI 2023 Conference}}, isbn = {{978-3-9819376-8-8}}, location = {{Nürnberg}}, pages = {{394 -- 395}}, publisher = {{AMA Association For Sensors And Measurement}}, title = {{{Improved determination of viscoelastic material parameters using a pulse-echo measurement setup}}}, doi = {{10.5162/SMSI2023/P59}}, year = {{2023}}, } @misc{45243, author = {{N., N.}}, title = {{{Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach}}}, year = {{2023}}, } @article{34833, author = {{Hanusch, Maximilian}}, journal = {{Indagationes Mathematicae.}}, keywords = {{Lie group actions and analytic 1-submanifolds}}, number = {{4}}, pages = {{752--811}}, title = {{{Decompositions of Analytic 1-Manifolds}}}, doi = {{10.1016/j.indag.2023.02.003}}, volume = {{34}}, year = {{2023}}, } @inproceedings{45312, author = {{Karakaya, Kadiray and Bodden, Eric}}, booktitle = {{2023 IEEE Conference on Software Testing, Verification and Validation (ICST)}}, publisher = {{IEEE}}, title = {{{Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis}}}, doi = {{10.1109/icst57152.2023.00036}}, year = {{2023}}, } @misc{43375, author = {{Koch, Angelina}}, title = {{{Privacy-Preserving Collection and Evaluation of Log Files}}}, year = {{2023}}, } @article{45445, author = {{Claes, Leander and Feldmann, Nadine and Schulze, Veronika and Meihost, Lars and Kuhlmann, Henrik and Jurgelucks, Benjamin and Walther, Andrea and Henning, Bernd}}, journal = {{Journal of Sensors and Sensor Systems}}, number = {{1}}, pages = {{163–173}}, title = {{{Inverse procedure for measuring piezoelectric material parameters using a single multi-electrode sample}}}, doi = {{10.5194/jsss-12-163-2023}}, volume = {{12}}, year = {{2023}}, } @misc{45455, author = {{Claes, Leander and Meihost, Lars and Jurgelucks, Benjamin}}, title = {{{Inverse procedure for the identification of piezoelectric material parameters supported by dense neural networks}}}, year = {{2023}}, }