Ahmadi Fahandar, M., &; Hüllermeier, E. (2019). Feature Selection for Analogy-Based Learning to Rank. In Discovery Science. Cham.https://doi.org/10.1007/978-3-030-33778-0_22 

Ahmadi Fahandar, M., &; Hüllermeier, E. (2019). Analogy-Based Preference Learning with Kernels. In KI 2019: Advances in Artificial Intelligence. Cham.https://doi.org/10.1007/978-3-030-30179-8_3 

Nguyen, V.-L., Destercke, S., &; Hüllermeier, E. (2019). Epistemic Uncertainty Sampling. In Discovery Science. Cham.https://doi.org/10.1007/978-3-030-33778-0_7 

Hartel, R., &; Dunst, A. (2019). How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics. In International Conference on Multimedia Modeling, MMM (pp. 662–671). Thessaloniki, Greece: Springer.https://doi.org/10.1007/978-3-030-05716-9_59 

Beyer, D., &; Jakobs, M.-C. (2019). CoVeriTest: Cooperative Verifier-Based Testing. In Fundamental Approaches to Software Engineering. Cham.https://doi.org/10.1007/978-3-030-16722-6_23 

Mahmood, Y., Meier, A., &; Schmidt, J. (2019). Parameterised Complexity of Abduction in Schaefer’s Framework. Logical Foundations of Computer Science.https://doi.org/10.1007/978-3-030-36755-8_13 

Blömer, J., Eidens, F., &; Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology - CT-RSA 2018 - The Cryptographers’ Track at the RSA Conference 2018, Proceedings (pp. 470–490). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-76953-0_25 

Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA).https://doi.org/10.1007/978-3-319-94667-2_18 

Lösch, A., Wiens, A., &; Platzner, M. (2018). Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In Proceedings of the International Conference on Architecture of Computing Systems (ARCS) (Vol. 10793, pp. 73–84). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-77610-1_6 

Hansmeier, T., Platzner, M., &; Andrews, D. (2018). An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications (Vol. 10824, pp. 153–165). Santorini, Greece: Springer International Publishing.https://doi.org/10.1007/978-3-319-78890-6_13 

Schellhorn, G., Wedel, M., Travkin, O., König, J., &; Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In Software Engineering and Formal Methods (pp. 105–120). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-92970-5_7 

Töws, M., &; Wehrheim, H. (2018). Information Flow Certificates. In Theoretical Aspects of Computing – ICTAC 2018 (pp. 435–454). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-030-02508-3_23 

Senft, B., Fischer, H. G., Oberthür, S., &; Patkar, N. (2018). Assist Users to Straightaway Suggest and Describe Experienced Problems. In Design, User Experience, and Usability: Theory and Practice (Vol. 10918, pp. 758–770). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-91797-9_52 

Fischer, H. G., Senft, B., Rittmeier, F., &; Sauer, S. (2018). A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance Systems. In A. Marcus &; W. Wang (Eds.), Design, User Experience, and Usability: Theory and Practice. Proceedings of the 20th International Conference on Human-Computer Interaktion (HCI International 2018) (Vol. 10918, pp. 711–724). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-91797-9_49 

Schäfer, D., &; Hüllermeier, E. (2018). Preference-Based Reinforcement Learning Using Dyad Ranking. In Discovery Science (pp. 161–175). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-030-01771-2_11 

Feldkord, B., Malatyali, M., &; Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham.https://doi.org/10.1007/978-3-319-98355-4_18 

Khaluf, Y., Markarian, C., Simoens, P., &; Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017).https://doi.org/10.1007/978-3-319-59930-4_12 

Blömer, J., &; Liske, G. (2017). Subtleties in Security Definitions for Predicate Encryption with Public Index. In Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS) (Vol. 10693, pp. 438–453). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-72453-9_35 

Blömer, J., Günther, P., Krummel, V., &; Löken, N. (2017). Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In Foundations and Practice of Security (pp. 3–17). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-75650-9_1 

Brauer, S. (2017). Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. In D. Fotakis, A. Pagourtzis, &; V. T. Paschos (Eds.), Lecture Notes in Computer Science (Vol. 10236, pp. 116–127). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-57586-5_11