@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{45484,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Graffiti is an urban phenomenon that is increasingly attracting the interest of the sciences. To the best of our knowledge, no suitable data corpora are available for systematic research until now. The Information System Graffiti in Germany project (<jats:sc>Ingrid</jats:sc>) closes this gap by dealing with graffiti image collections that have been made available to the project for public use. Within <jats:sc>Ingrid</jats:sc>, the graffiti images are collected, digitized and annotated. With this work, we aim to support the rapid access to a comprehensive data source on <jats:sc>Ingrid</jats:sc> targeted especially by researchers. In particular, we present <jats:sc>Ingrid</jats:sc>KG, an RDF knowledge graph of annotated graffiti, abides by the Linked Data and FAIR principles. We weekly update <jats:sc>Ingrid</jats:sc>KG by augmenting the new annotated graffiti to our knowledge graph. Our generation pipeline applies RDF data conversion, link discovery and data fusion approaches to the original data. The current version of <jats:sc>Ingrid</jats:sc>KG contains 460,640,154 triples and is linked to 3 other knowledge graphs by over 200,000 links. In our use case studies, we demonstrate the usefulness of our knowledge graph for different applications.</jats:p>}},
  author       = {{Sherif, Mohamed Ahmed and da Silva, Ana Alexandra Morim and Pestryakova, Svetlana and Ahmed, Abdullah Fathi and Niemann, Sven and Ngomo, Axel-Cyrille Ngonga}},
  issn         = {{2052-4463}},
  journal      = {{Scientific Data}},
  keywords     = {{Library and Information Sciences, Statistics, Probability and Uncertainty, Computer Science Applications, Education, Information Systems, Statistics and Probability}},
  number       = {{1}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{IngridKG: A FAIR Knowledge Graph of Graffiti}}},
  doi          = {{10.1038/s41597-023-02199-8}},
  volume       = {{10}},
  year         = {{2023}},
}

@article{45485,
  author       = {{Kruse, Stephan and Serino, Laura and Folge, Patrick Fabian and Echeverria Oviedo, Dana and Bhattacharjee, Abhinandan and Stefszky, Michael and Scheytt, J. Christoph and Brecht, Benjamin and Silberhorn, Christine}},
  issn         = {{1041-1135}},
  journal      = {{IEEE Photonics Technology Letters}},
  keywords     = {{Electrical and Electronic Engineering, Atomic and Molecular Physics, and Optics, Electronic, Optical and Magnetic Materials}},
  number       = {{14}},
  pages        = {{769--772}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{A Pulsed Lidar System With Ultimate Quantum Range Accuracy}}},
  doi          = {{10.1109/lpt.2023.3277515}},
  volume       = {{35}},
  year         = {{2023}},
}

@unpublished{45498,
  abstract     = {{We present a novel method for high-order phase reduction in networks of
weakly coupled oscillators and, more generally, perturbations of reducible
normally hyperbolic (quasi-)periodic tori. Our method works by computing an
asymptotic expansion for an embedding of the perturbed invariant torus, as well
as for the reduced phase dynamics in local coordinates. Both can be determined
to arbitrary degrees of accuracy, and we show that the phase dynamics may
directly be obtained in normal form. We apply the method to predict remote
synchronisation in a chain of coupled Stuart-Landau oscillators.}},
  author       = {{von der Gracht, Sören and Nijholt, Eddie and Rink, Bob}},
  booktitle    = {{arXiv:2306.03320}},
  pages        = {{29}},
  title        = {{{A parametrisation method for high-order phase reduction in coupled  oscillator networks}}},
  year         = {{2023}},
}

@phdthesis{45580,
  author       = {{Castenow, Jannik}},
  title        = {{{Local Protocols for Contracting and Expanding Robot Formation Problems}}},
  doi          = {{10.17619/UNIPB/1-1750}},
  year         = {{2023}},
}

@phdthesis{45579,
  author       = {{Knollmann, Till}},
  title        = {{{Online Algorithms for Allocating Heterogeneous Resources}}},
  doi          = {{10.17619/UNIPB/1-1751}},
  year         = {{2023}},
}

@article{45596,
  abstract     = {{Dielectric metasurfaces provide a unique platform for efficient harmonic generation and optical wavefront manipulation at the nanoscale. Tailoring phase and amplitude of a nonlinearly generated wave with a high emission efficiency using resonance-based metasurfaces is a challenging task that often requires state-of-the-art numerical methods. Here, we propose a simple yet effective approach combining a sampling method with a Monte Carlo approach to design the third-harmonic wavefront generated by all-dielectric metasurfaces composed of elliptical silicon nanodisks. Using this approach, we theoretically demonstrate the full nonlinear 2π phase control with a uniform and highest possible amplitude in the considered parameter space, allowing us to design metasurfaces operating as third harmonic beam deflectors capable of steering light into a desired direction with high emission efficiency. The TH beam deflection with a record calculated average conversion efficiency of 1.2 × 10–1 W–2 is achieved. We anticipate that the proposed approach will be widely applied as alternative to commonly used optimization algorithms with higher complexity and implementation effort for the design of metasurfaces with other holographic functionalities.}},
  author       = {{Hähnel, David and Förstner, Jens and Myroshnychenko, Viktor}},
  issn         = {{2330-4022}},
  journal      = {{ACS Photonics}},
  keywords     = {{tet_topic_meta}},
  publisher    = {{American Chemical Society (ACS)}},
  title        = {{{Efficient Modeling and Tailoring of Nonlinear Wavefronts in Dielectric Metasurfaces}}},
  doi          = {{10.1021/acsphotonics.2c01967}},
  year         = {{2023}},
}

@inproceedings{45695,
  author       = {{Hotegni, Sedjro Salomon and Mahabadi, Sepideh and Vakilian, Ali}},
  booktitle    = {{Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, USA. PMLR 202, 2023.}},
  keywords     = {{Fair range clustering}},
  location     = {{Honolulu, Hawaii, USA}},
  title        = {{{Approximation Algorithms for Fair Range Clustering}}},
  year         = {{2023}},
}

@inproceedings{43060,
  author       = {{Hebrok, Sven Niclas and Nachtigall, Simon and Maehren, Marcel and Erinola, Nurullah and Merget, Robert and Somorovsky, Juraj and Schwenk, Jörg}},
  booktitle    = {{32nd USENIX Security Symposium}},
  title        = {{{We Really Need to Talk About Session Tickets: A Large-Scale Analysis of Cryptographic Dangers with TLS Session Tickets}}},
  year         = {{2023}},
}