@inproceedings{60497,
  abstract     = {{Despite the advantages that the virtual knowledge graph paradigm has brought to many application domains, state-of-the-art systems still do not support popular graph database management systems like Neo4j. Their query rewriting algorithms focus on languages like conjunctive queries and their unions, which were developed for relational data and are poorly suited for graph data. Moreover, they also limit the expressiveness of the ontology languages that admit rewritings, restricting them to those that enjoy the so-called FO-rewritability property. Rewritings have thus focused on the DL-Lite family of Description Logics. In this paper, we propose a technique for rewriting a family of navigational queries for a suitably tailored fragment of ELHI. Leveraging navigational features in the target query language, we can include some widely-used axiom shapes not supported by DL-Lite. We implemented a proof-of-concept prototype that rewrites into Cypher queries, and tested it on a real-world cognitive neuroscience use case with promising results.}},
  author       = {{Löhnert, Bianca and Augsten, Nikolaus and Okulmus, Cem and Ortiz, Magdalena}},
  booktitle    = {{The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}}},
  isbn         = {{9783031945748}},
  issn         = {{0302-9743}},
  keywords     = {{Ontology-based Data Access, Property Graphs, Navigational Queries}},
  location     = {{Portorož, Slovenia}},
  pages        = {{342----361}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite}}},
  doi          = {{10.1007/978-3-031-94575-5_19}},
  volume       = {{15718}},
  year         = {{2025}},
}

@inproceedings{61098,
  author       = {{Kaltenpoth, Sascha Benjamin and Skolik, Alexander Marcus and Müller, Oliver and Beverungen, Daniel}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783032028662}},
  issn         = {{0302-9743}},
  location     = {{Sevilla}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{A Step Towards Cognitive Automation: Integrating LLM Agents with Process Rules}}},
  doi          = {{10.1007/978-3-032-02867-9_19}},
  year         = {{2025}},
}

@inbook{61127,
  author       = {{Haney, Julie M. and Acar, Yasemin and Li, Anna and Haney, Faith}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031928390}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Smart Home Users’ Security and Privacy Perceptions and Actions Differ By Device Category: Results from a U.S. Survey}}},
  doi          = {{10.1007/978-3-031-92840-6_11}},
  year         = {{2025}},
}

@inproceedings{61184,
  author       = {{Augustine, John and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031998713}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Supervised Distributed Computing}}},
  doi          = {{10.1007/978-3-031-99872-0_4}},
  year         = {{2025}},
}

@inbook{64881,
  author       = {{Almalki, Nada and Gupta, Siddharth and Michail, Othon and Padalkin, Andreas}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783032111265}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits}}},
  doi          = {{10.1007/978-3-032-11127-2_5}},
  year         = {{2025}},
}

@inproceedings{63854,
  author       = {{Eikerling, Hendrik and Kampkötter, Anemone}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031823619}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Enabling Android Application Monitoring by Characterizing Security-Critical Code Fragments}}},
  doi          = {{10.1007/978-3-031-82362-6_25}},
  year         = {{2025}},
}

@inbook{66157,
  author       = {{Spaan, Jeffrey and Chen, Kuan-Hsun and Bader, David A. and Varbanescu, Ana-Lucia}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031998713}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Wedge-Parallel Triangle Counting for GPUs}}},
  doi          = {{10.1007/978-3-031-99872-0_1}},
  year         = {{2025}},
}

@inbook{66445,
  author       = {{van der Vlag, Michiel and Yegenoglu, Alper and Jimenez-Romero, Cristian and Morrison, Abigail and Diaz, Sandra}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783032045577}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Complexity and Criticality in Neuro-Inspired Reservoirs}}},
  doi          = {{10.1007/978-3-032-04558-4_52}},
  year         = {{2025}},
}

@inbook{54412,
  author       = {{Firmansyah, Asep Fajar and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web}},
  isbn         = {{9783031606250}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{ESLM: Improving Entity Summarization by Leveraging Language Models}}},
  doi          = {{10.1007/978-3-031-60626-7_9}},
  year         = {{2024}},
}

@inbook{54580,
  author       = {{Mahmood, Yasir and Virtema, Jonni and Barlag, Timon and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031569395}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Computing Repairs Under Functional and Inclusion Dependencies via Argumentation}}},
  doi          = {{10.1007/978-3-031-56940-1_2}},
  year         = {{2024}},
}

@inbook{54624,
  author       = {{Papenkordt, Jörg}},
  booktitle    = {{Artificial Intelligence in HCI}},
  isbn         = {{9783031606052}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Navigating Transparency: The Influence of On-demand Explanations on Non-expert User Interaction with AI}}},
  doi          = {{10.1007/978-3-031-60606-9_14}},
  year         = {{2024}},
}

@inbook{52759,
  author       = {{Preuß, Oliver Ludger and Rook, Jeroen and Trautmann, Heike}},
  booktitle    = {{Applications of Evolutionary Computation}},
  isbn         = {{9783031568510}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{On the Potential of Multi-objective Automated Algorithm Configuration on Multi-modal Multi-objective Optimisation Problems}}},
  doi          = {{10.1007/978-3-031-56852-7_20}},
  year         = {{2024}},
}

@inbook{54802,
  abstract     = {{Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited viewing range and the computational capability of a deterministic finite automaton can act on passive tiles by picking up a tile, moving, and placing it at some spot. The goal of the coating problem is to fill each node of some surface graph of size n with a tile. We first solve the problem on a restricted class of graphs with a single tile type, and then use constantly many tile types to encode this graph in certain surface graphs capturing the surface of 3D objects. Our algorithm requires O(n^2) steps, which is worst-case optimal compared to an agent with global knowledge and no memory restrictions.}},
  author       = {{Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}},
  booktitle    = {{Structural Information and Communication Complexity}},
  editor       = {{Emek, Yuval}},
  isbn         = {{9783031606021}},
  issn         = {{0302-9743}},
  keywords     = {{Programmable Matter, Coating, Finite Automaton, 3D}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Universal Coating by 3D Hybrid Programmable Matter}}},
  doi          = {{10.1007/978-3-031-60603-8_21}},
  year         = {{2024}},
}

@inbook{56079,
  author       = {{Radoy, Maximilian Manfred and Hebrok, Sven Niclas and Somorovsky, Juraj}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031708954}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{In Search of Partitioning Oracle Attacks Against TLS Session Tickets}}},
  doi          = {{10.1007/978-3-031-70896-1_16}},
  year         = {{2024}},
}

@inbook{56606,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Most FPGA boards in the HPC domain are well-suited for parallel scaling because of the direct integration of versatile and high-throughput network ports. However, the utilization of their network capabilities is often challenging and error-prone because the whole network stack and communication patterns have to be implemented and managed on the FPGAs. Also, this approach conceptually involves a trade-off between the performance potential of improved communication and the impact of resource consumption for communication infrastructure, since the utilized resources on the FPGAs could otherwise be used for computations. In this work, we investigate this trade-off, firstly, by using synthetic benchmarks to evaluate the different configuration options of the communication framework ACCL and their impact on communication latency and throughput. Finally, we use our findings to implement a shallow water simulation whose scalability heavily depends on low-latency communication. With a suitable configuration of ACCL, good scaling behavior can be shown to all 48 FPGAs installed in the system. Overall, the results show that the availability of inter-FPGA communication frameworks as well as the configurability of framework and network stack are crucial to achieve the best application performance with low latency communication.</jats:p>}},
  author       = {{Meyer, Marius and Kenter, Tobias and Petrica, Lucian and O’Brien, Kenneth and Blott, Michaela and Plessl, Christian}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031697654}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL}}},
  doi          = {{10.1007/978-3-031-69766-1_9}},
  year         = {{2024}},
}

@inbook{56581,
  abstract     = {{In recent years, there has been a surge in natural language processing research focused on low-resource languages (LrLs), underscoring the growing recognition that LrLs deserve the same attention as high-resource languages (HrLs). This shift is crucial for ensuring linguistic diversity and inclusivity in the digital age. Despite Indonesian ranking as the 11th most spoken language globally, it remains under-resourced in terms of computational tools and datasets. Within the semantic web domain, Entity Linking (EL) is pivotal, linking textual entity mentions to their corresponding entries in knowledge bases. This process is foundational for advanced information extraction tasks, including relation extraction and event detection. To bolster EL research in Indonesian, we introduce IndEL, the first benchmark dataset tailored for both general and specific domains. IndEL was manually curated using Wikidata, adhering to a rigorous set of annotation guidelines. We used two Named Entity Recognition (NER) benchmark datasets for entity extraction: NER UI for the general domain and IndQNER for the specific domain. IndQNER focused on entities from the Indonesian translation of the Quran. IndEL comprises 4765 entities in the general domain and 2453 in the specific domain. Using the GERBIL framework, we use IndEL to evaluate the performance of various EL systems, such as Babelfy, DBpedia Spotlight, MAG, OpenTapioca, and WAT. Our further investigation reveals that within Wikidata, a significant number of NIL entities remain unlinked due to the limited number of Indonesian labels and the use of acronyms. Especially in the specific domain, transliteration and translation processes performed to create the Indonesian translation of the Quran contribute to the presence of entities in a descriptive form and as synonyms.}},
  author       = {{Gusmita, Ria Hari and Abshar, Muhammad Faruq Amiral and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031702389}},
  issn         = {{0302-9743}},
  keywords     = {{entity linking benchmark dataset, Indonesian, general and specific domains}},
  location     = {{Turin, Italy}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{IndEL: Indonesian Entity Linking Benchmark Dataset for General and Specific Domains}}},
  doi          = {{10.1007/978-3-031-70239-6_34}},
  year         = {{2024}},
}

@inbook{56237,
  author       = {{Schönherr, Johanna and Mayer, Richard E.}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031712906}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Anxiety Moderates the Effects of Drawing Support on Drawing Accuracy in Mathematical Modeling}}},
  doi          = {{10.1007/978-3-031-71291-3_26}},
  year         = {{2024}},
}

@inbook{64202,
  author       = {{Bora, Revoti Prasad and Terhörst, Philipp and Veldhuis, Raymond and Ramachandra, Raghavendra and Raja, Kiran}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031781889}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{CoFE: Consistency-Driven Feature Elimination for eXplainable AI}}},
  doi          = {{10.1007/978-3-031-78189-6_24}},
  year         = {{2024}},
}

@inbook{61210,
  abstract     = {{Knowledge graphs (KGs) differ significantly over multiple different versions of the same data source. They also often contain blank nodes that do not have a constant identifier over all versions. Linking such blank nodes from different versions is a challenging task. Previous works propose different approaches to create signatures for all blank nodes based on named nodes in their neighborhood to match blank nodes with similar signatures. However, these works struggle to find a good mapping when the difference between the KGs’ versions grows too large. In this work, we propose Blink, an embedding-based approach for blank node linking. Blink merges two KGs’ versions and embeds the merged graph into a latent vector space based on translational embeddings and subsequently matches the closest pairs of blank nodes from different graphs. We evaluate our approach using real-world datasets against state-of-the-art approaches by computing the blank node matching for isomorphic graphs and graphs that contain triple changes (i.e., added or removed triples). The results indicate that Blink achieves perfect accuracy for isomorphic graphs. For graph versions that contain changes, such as having up to 20% of triples removed in one version, Blink still produces a mapping with an Optimal Mapping Deviation Ratio of under 1%. These results show that Blink leads to a better linking of KGs over different versions and similar graphs adhering to the linked data guidelines.}},
  author       = {{Becker, Alexander and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031778438}},
  issn         = {{0302-9743}},
  location     = {{Baltimore, USA}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Blink: Blank Node Matching Using Embeddings}}},
  doi          = {{10.1007/978-3-031-77844-5_12}},
  year         = {{2024}},
}

@inbook{62067,
  abstract     = {{Most FPGA boards in the HPC domain are well-suited for parallel scaling because of the direct integration of versatile and high-throughput network ports. However, the utilization of their network capabilities is often challenging and error-prone because the whole network stack and communication patterns have to be implemented and managed on the FPGAs. Also, this approach conceptually involves a trade-off between the performance potential of improved communication and the impact of resource consumption for communication infrastructure, since the utilized resources on the FPGAs could otherwise be used for computations. In this work, we investigate this trade-off, firstly, by using synthetic benchmarks to evaluate the different configuration options of the communication framework ACCL and their impact on communication latency and throughput. Finally, we use our findings to implement a shallow water simulation whose scalability heavily depends on low-latency communication. With a suitable configuration of ACCL, good scaling behavior can be shown to all 48 FPGAs installed in the system. Overall, the results show that the availability of inter-FPGA communication frameworks as well as the configurability of framework and network stack are crucial to achieve the best application performance with low latency communication.}},
  author       = {{Meyer, Marius and Kenter, Tobias and Petrica, Lucian and O’Brien, Kenneth and Blott, Michaela and Plessl, Christian}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031697654}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL}}},
  doi          = {{10.1007/978-3-031-69766-1_9}},
  year         = {{2024}},
}