U. Qudus, M. Röder, S. Kirrane, and A.-C. N. Ngomo, “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs,”10.1007/978-3-031-47240-4_25__in The Semantic Web – ISWC 2023, Athens, Greece, 2023, vol. 14265, pp. 465–483, doi:10.1007/978-3-031-47240-4_25 .
LibreCat: /record/50479
DOI: 10.1007/978-3-031-47240-4_25

D. Mattiolo and E. Steffen, “Highly edgeconnected regular graphs without large factorizable subgraphs,”10.1002/jgt.22729__Journal of Graph Theory, vol. 99, no. 1, pp. 107–116, 2021, doi:10.1002/jgt.22729 .
LibreCat: /record/23456
DOI: 10.1002/jgt.22729
arXiv: 1912.09704

C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

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

G. Casalicchio et al., “OpenML: An R Package to Connect to the Machine Learning Platform OpenML,”10.1007/s00180-017-0742-2__Computational Statistics, vol. 34, no. 3, pp. 977–991, 2019, doi:10.1007/s00180-017-0742-2 .
LibreCat: /record/48877
DOI: 10.1007/s00180-017-0742-2

W. Müller, G. Lehrenfeld, and C. Tahedl, “Complete Visual Specification and Animations of Protocols,”10.1109/ASPDAC.1995.486383__1995, doi:10.1109/ASPDAC.1995.486383 .
LibreCat: /record/39538
DOI: 10.1109/ASPDAC.1995.486383