@phdthesis{21628,
  abstract     = {{This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks.

In the first part of this thesis, we provide distributed protocols for queues, stacks and priority queues that serve the insertion and deletion of elements within a logarithmic amount of rounds.
Our protocols respect semantic constraints such as sequential consistency or serializability and the individual semantic constraints given by the type (queue, stack, priority queue) of the data structure.
We furthermore provide a protocol that handles joining and leaving nodes.
As an important side product, we present a novel protocol solving the distributed $k$-selection problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements among a polynomial number of elements spread among $n$ nodes.
	
The second part of this thesis is devoted to the construction of protocols for self-stabilizing overlay networks, i.e., distributed protocols that transform an overlay network from any initial (potentially illegitimate) state into a legitimate state in finite time.
We present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings.
Each of those protocols comes with unique properties that makes it interesting for certain distributed applications.
Generalized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests.
The protocol for the quadtree guarantees monotonic searchability as well as a geometric variant of monotonic searchability, making it interesting for wireless networks or applications needed in the area of computational geometry.
The supervised skip ring can be used to construct a self-stabilizing publish-subscribe system.
}},
  author       = {{Feldmann, Michael}},
  title        = {{{Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}}},
  doi          = {{10.17619/UNIPB/1-1113}},
  year         = {{2021}},
}

@inproceedings{21639,
  abstract     = {{The development of effective business models is an essential task in highly competitive markets like mobile ecosystems. Existing development methods for these business models do not specifically focus that the development process profoundly depends on the situation (e.g., market size, regulations) of the mobile app developer. Here, a mismatch between method and situation can lead to poor resource management and longer development cycles. In software engineering, situational method engineering is used for software projects to configure a development method out of a method repository based on the project situation. Analogously, we support creating situation-specific business model development methods with a method base and new user roles. Here, the method engineer obtains the knowledge of the domain expert and stores it in the method base as elements, building blocks, and patterns. The expert knowledge is derived from a grey literature review on mobile development processes. After this, the method engineer constructs the development method based on the described situation of the business developer. We provide an open-source tool and evaluate it by constructing a local event platform's business model development method.    }},
  author       = {{Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}},
  booktitle    = {{Enterprise, Business-Process and Information Systems Modeling}},
  keywords     = {{Business Model Development, Situational Method Engineering, Mobile App, Business Model Development Tools}},
  publisher    = {{Springer}},
  title        = {{{Situation-specific Business Model Development Methods for Mobile App Developers}}},
  doi          = {{10.1007/978-3-030-79186-5_17}},
  year         = {{2021}},
}

@book{23458,
  author       = {{Dumitrescu, Roman and Albers, Albert and Gausemeier, Jürgen and Riedel, Oliver and Stark, Rainer}},
  publisher    = {{Fraunhofer-Institut für Entwurfstechnik Mechatronik IEM, Paderborn}},
  title        = {{{Engineering in Deutschland – Status quo in Wirtschaft und Wissenschaft. Ein Beitrag zum Advanced Systems Engineering}}},
  year         = {{2021}},
}

@article{23466,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>The term graphic novel has increasingly functioned as a catalyst for understanding comic books as an emergent literary genre. This article focuses on one specific element within this historical process: the claim, made by artists such as Alan Moore, that graphic novels are characterized by greater formal complexity, or density, than serial comics. These claims are evaluated by combining computational text and image recognition of a corpus of 131 graphic narratives with sociological metadata on production and circulation. The results show that Moore’s own book-length comics, in particular <jats:italic>Watchmen</jats:italic> and <jats:italic>V for Vendetta</jats:italic>, rank among the densest graphic narratives in the sample in both their visual and textual content. Graphic memoirs, in contrast, only show an increase in textual complexity. With Pierre Bourdieu, the article understands complexity as a social and aesthetic strategy that aims at increasing the cultural capital of comics creators. At the same time, the article contextualizes computational results against the background of a changing marketplace for comics, in particular the decline of serial comics, the shift towards digital printing, and increased access to book distribution. This analysis shows that graphic narratives pursue both literary and popular aesthetic strategies, challenging Bourdieu’s account of a clear opposition between profit and prestige in cultural production.</jats:p>}},
  author       = {{Dunst, Alexander and Hartel, Rita}},
  issn         = {{1865-8938}},
  journal      = {{Anglia}},
  number       = {{1}},
  pages        = {{195--223}},
  title        = {{{Computing Literary Surplus Value: Alan Moore and the Density of the Comic Book as Graphic Novel}}},
  doi          = {{10.1515/ang-2021-0010}},
  volume       = {{139}},
  year         = {{2021}},
}

@article{23525,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>In the field of Model-Driven Engineering, Triple Graph Grammars
(TGGs) play an important role as a rule-based means of implementing
consistency management. From a declarative specification of a
consistency relation, several operations including forward and
backward transformations, (concurrent) synchronisation, and
consistency checks can be automatically derived. For TGGs to be
applicable in realistic application scenarios, expressiveness in
terms of supported language features is very important. A TGG tool
is schema compliant if it can take domain constraints, such as
multiplicity constraints in a meta-model, into account when
performing consistency management tasks. To guarantee schema
compliance, most TGG tools allow application conditions to be
attached as necessary to relevant rules. This strategy is
problematic for at least two reasons: First, ensuring compliance to
a sufficiently expressive schema for all previously mentioned
derived operations is still an open challenge; to the best of our
knowledge, all existing TGG tools only support a very restricted
subset of application conditions. Second, it is conceptually
demanding for the user to indirectly specify domain constraints as
application conditions, especially because this has to be completely
revisited every time the TGG or domain constraint is changed. While
domain constraints can in theory be automatically transformed to
obtain the required set of application conditions, this has only
been successfully transferred to TGGs for a very limited subset of
domain constraints. To address these limitations, this paper
proposes a search-based strategy for achieving schema compliance. We
show that all correctness and completeness properties, previously
proven in a setting without domain constraints, still hold when
schema compliance is to be additionally guaranteed. An
implementation and experimental evaluation are provided to support
our claim of practical applicability.</jats:p>}},
  author       = {{Weidmann, Nils and Anjorin, Anthony}},
  issn         = {{0934-5043}},
  journal      = {{Formal Aspects of Computing}},
  publisher    = {{Springer}},
  title        = {{{Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}}},
  doi          = {{10.1007/s00165-021-00557-0}},
  year         = {{2021}},
}

@inproceedings{23708,
  author       = {{Nouri, Zahra and Gadiraju, Ujwal and Engels, Gregor and Wachsmuth, Henning}},
  booktitle    = {{Proceedings of the 32nd ACM Conference on Hypertext and Social Media}},
  pages        = {{165--175}},
  title        = {{{What Is Unclear? Computational Assessment of Task Clarity in Crowdsourcing}}},
  year         = {{2021}},
}

@inproceedings{23730,
  author       = {{Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}},
  editor       = {{Gasieniec, Leszek and Klasing, Ralf and Radzik, Tomasz}},
  location     = {{Lissabon}},
  pages        = {{29 -- 44}},
  publisher    = {{Springer}},
  title        = {{{Gathering a Euclidean Closed Chain of Robots in Linear Time}}},
  doi          = {{10.1007/978-3-030-89240-1_3}},
  volume       = {{12961}},
  year         = {{2021}},
}

@inproceedings{23779,
  abstract     = {{Produktentstehung (PE) bezieht sich auf den Prozess der Planung und Entwicklung eines Produkts sowie der damit verbundenen Dienstleistungen von der ersten Idee bis zur Herstellung und zum Vertrieb. Während dieses Prozesses gibt es zahlreiche Aufgaben, die von menschlichem Fachwissen abhängen und typischerweise von erfahrenen Experten übernommen werden. Da sich das Feld der Künstlichen Intelligenz (KI) immer weiterentwickelt und seinen Weg in den Fertigungssektor findet, gibt es viele Möglichkeiten für eine Anwendung von KI, um bei der Lösung der oben genannten Aufgaben zu helfen. In diesem Paper geben wir einen umfassenden Überblick über den aktuellen Stand der Technik des Einsatzes von KI in der PE. 
Im Detail analysieren wir 40 bestehende Surveys zu KI in der PE und 94 Case Studies, um herauszufinden, welche Bereiche der PE von der aktuellen Forschung in diesem Bereich vorrangig adressiert werden, wie ausgereift die diskutierten KI-Methoden sind und inwieweit datenzentrierte Ansätze in der aktuellen Forschung genutzt werden.}},
  author       = {{Bernijazov, Ruslan and Dicks, Alexander and Dumitrescu, Roman and Foullois, Marc and Hanselle, Jonas Manuel and Hüllermeier, Eyke and Karakaya, Gökce and Ködding, Patrick and Lohweg, Volker and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Panzner, Melina and Soltenborn, Christian}},
  booktitle    = {{Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)}},
  keywords     = {{Artificial Intelligence Product Creation Literature Review}},
  location     = {{Montreal, Kanada}},
  title        = {{{A Meta-Review on Artificial Intelligence in Product Creation}}},
  year         = {{2021}},
}

@inproceedings{20540,
  author       = {{Jovanovikj, Ivan and Thottam, Anu Tony and Joseph Vincent, Vishal and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}},
  booktitle    = {{Proceedings of the 9th International Conference on Model-Driven Engineering and Software Development }},
  location     = {{Vienna}},
  pages        = {{232--239}},
  publisher    = {{SCITEPRESS}},
  title        = {{{A Modeling Workbench for the Development of Situation-specific Test Co-Migration Methods }}},
  year         = {{2021}},
}

@article{20683,
  author       = {{Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}},
  journal      = {{Theory of Computing Systems}},
  pages        = {{943–984}},
  title        = {{{Managing Multiple Mobile Resources}}},
  doi          = {{10.1007/s00224-020-10023-8}},
  volume       = {{65}},
  year         = {{2021}},
}

@inproceedings{20693,
  abstract     = {{In practical, large-scale networks, services are requested
by users across the globe, e.g., for video streaming.
Services consist of multiple interconnected components such as
microservices in a service mesh. Coordinating these services
requires scaling them according to continuously changing user
demand, deploying instances at the edge close to their users,
and routing traffic efficiently between users and connected instances.
Network and service coordination is commonly addressed
through centralized approaches, where a single coordinator
knows everything and coordinates the entire network globally.
While such centralized approaches can reach global optima, they
do not scale to large, realistic networks. In contrast, distributed
approaches scale well, but sacrifice solution quality due to their
limited scope of knowledge and coordination decisions.

To this end, we propose a hierarchical coordination approach
that combines the good solution quality of centralized approaches
with the scalability of distributed approaches. In doing so, we divide
the network into multiple hierarchical domains and optimize
coordination in a top-down manner. We compare our hierarchical
with a centralized approach in an extensive evaluation on a real-world
network topology. Our results indicate that hierarchical
coordination can find close-to-optimal solutions in a fraction of
the runtime of centralized approaches.}},
  author       = {{Schneider, Stefan Balthasar and Jürgens, Mirko and Karl, Holger}},
  booktitle    = {{IFIP/IEEE International Symposium on Integrated Network Management (IM)}},
  keywords     = {{network management, service management, coordination, hierarchical, scalability, nfv}},
  location     = {{Bordeaux, France}},
  publisher    = {{IFIP/IEEE}},
  title        = {{{Divide and Conquer: Hierarchical Network and Service Coordination}}},
  year         = {{2021}},
}

@inproceedings{20817,
  author       = {{Bienkowski, Marcin and Feldkord, Björn and Schmidt, Pawel}},
  booktitle    = {{Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)}},
  pages        = {{14:1 -- 14:17}},
  title        = {{{A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}}},
  doi          = {{10.4230/LIPIcs.STACS.2021.14}},
  year         = {{2021}},
}

@inproceedings{20886,
  author       = {{Nickchen, Tobias and Heindorf, Stefan and Engels, Gregor}},
  booktitle    = {{Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision}},
  location     = {{Hawaii}},
  pages        = {{1994--2002}},
  title        = {{{Generating Physically Sound Training Data for Image Recognition of Additively Manufactured Parts}}},
  year         = {{2021}},
}

@inproceedings{22155,
  author       = {{Gottschalk, Sebastian}},
  booktitle    = {{Advanced Software Engineering. Doctorial Consortium}},
  publisher    = {{CEUR}},
  title        = {{{Situation-specific Development of Business Models for Services in Software Ecosystems}}},
  year         = {{2021}},
}

@inproceedings{22156,
  abstract     = {{Word embedding models reflect bias towards genders, ethnicities, and other social groups present in the underlying training data. Metrics such as ECT, RNSB, and WEAT quantify bias in these models based on predefined word lists representing social groups and bias-conveying concepts. How suitable these lists actually are to reveal bias - let alone the bias metrics in general - remains unclear, though. In this paper, we study how to assess the quality of bias metrics for word embedding models. In particular, we present a generic method, Bias Silhouette Analysis (BSA), that quantifies the accuracy and robustness of such a metric and of the word lists used. Given a biased and an unbiased reference embedding model, BSA applies the metric systematically for several subsets of the lists to the models. The variance and rate of convergence of the bias values of each model then entail the robustness of the word lists, whereas the distance between the models' values gives indications of the general accuracy of the metric with the word lists. We demonstrate the behavior of BSA on two standard embedding models for the three mentioned metrics with several word lists from existing research.}},
  author       = {{Spliethöver, Maximilian and Wachsmuth, Henning}},
  booktitle    = {{Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21}},
  location     = {{Online}},
  pages        = {{552--559}},
  title        = {{{Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models}}},
  doi          = {{10.24963/ijcai.2021/77}},
  year         = {{2021}},
}

@inproceedings{22158,
  author       = {{Syed, Shahbaz and Al-Khatib, Khalid and Alshomary, Milad and Wachsmuth, Henning and Potthast, Martin}},
  booktitle    = {{Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings}},
  pages        = {{3482--3493}},
  title        = {{{Generating Informative Conclusions for Argumentative Texts}}},
  year         = {{2021}},
}

@inproceedings{22159,
  author       = {{Barrow, Joe and Jain, Rajiv and Lipka, Nedim and Dernoncourt, Franck and Morariu, Vlad and Manjunatha, Varun and Oard, Douglas and Resnik, Philip and Wachsmuth, Henning}},
  booktitle    = {{Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)}},
  pages        = {{1583--1595}},
  title        = {{{Syntopical Graphs for Computational Argumentation Tasks}}},
  year         = {{2021}},
}

@inproceedings{22160,
  author       = {{Al-Khatib, Khalid and Trautner, Lukas and Wachsmuth, Henning and Hou, Yufang and Stein, Benno}},
  booktitle    = {{Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)}},
  pages        = {{4744--4754}},
  title        = {{{Employing Argumentation Knowledge Graphs for Neural Argument Generation}}},
  year         = {{2021}},
}

@misc{22216,
  author       = {{Rehnen, Jakob Werner}},
  title        = {{{Decomposition of Arithmetic Components for the Approximate Circuit Synthesis with EvoApproxLib}}},
  year         = {{2021}},
}

@proceedings{22230,
  editor       = {{Sousa Santos, Beatriz and Domik, Gitta}},
  isbn         = {{ISBN 978-3-03868-132-8 }},
  location     = {{Vienna}},
  publisher    = {{Eurographics Association }},
  title        = {{{EUROGRAPHICS 2021: Education Papers Frontmatter}}},
  doi          = {{10.2312/EGED.20212000}},
  year         = {{2021}},
}