Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite
B. Löhnert, N. Augsten, C. Okulmus, M. Ortiz, in: 22th European Semantic Web Conference (ESWC 2025), Portoroe, Slovenia, n.d., p. ( accepted for publication).

TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs
U. Qudus, M. Röder, S. Kirrane, A.-C.N. Ngomo, in: T. R. Payne, V. Presutti, G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, J. Li (Eds.), The Semantic Web – ISWC 2023, Springer, Cham, Cham, 2023, pp. 465–483.

Highly edgeconnected regular graphs without large factorizable subgraphs
D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116.

On the Complexity of Local Graph Transformations
C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.

Ranking on Very Large Knowledge Graphs
A.A. Desouki, M. Röder, A.-C. Ngonga Ngomo, in: Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19, ACM, 2019, pp. 163–171.

OpenML: An R Package to Connect to the Machine Learning Platform OpenML
G. Casalicchio, J. Bossek, M. Lang, D. Kirchhoff, P. Kerschke, B. Hofner, H. Seibold, J. Vanschoren, B. Bischl, Computational Statistics 34 (2019) 977–991.

Complete Visual Specification and Animations of Protocols
W. Müller, G. Lehrenfeld, C. Tahedl, in: Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair, Chiba, Japan , 1995.