Qudus, U., Röder, M., Kirrane, S., &; Ngomo, A.-C. N. (2023). TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs. 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 (Vol. 14265, pp. 465–483). Springer, Cham.https://doi.org/10.1007/978-3-031-47240-4_25 
LibreCat: /record/50479
DOI: 10.1007/978-3-031-47240-4_25

Mattiolo, D., &; Steffen, E. (2021). Highly edgeconnected regular graphs without large factorizable subgraphs. Journal of Graph Theory, 99(1), 107–116.https://doi.org/10.1002/jgt.22729 
LibreCat: /record/23456
DOI: 10.1002/jgt.22729
arXiv: 1912.09704

Scheideler, C., &; Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing.https://doi.org/10.4230/LIPICS.ICALP.2019.150 
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

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

Casalicchio, G., Bossek, J., Lang, M., Kirchhoff, D., Kerschke, P., Hofner, B., Seibold, H., Vanschoren, J., &; Bischl, B. (2019). OpenML: An R Package to Connect to the Machine Learning Platform OpenML. Computational Statistics, 34(3), 977–991.https://doi.org/10.1007/s00180-017-0742-2 
LibreCat: /record/48877
DOI: 10.1007/s00180-017-0742-2

Müller, W., Lehrenfeld, G., &; Tahedl, C. (1995). Complete Visual Specification and Animations of Protocols. Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair.https://doi.org/10.1109/ASPDAC.1995.486383 
LibreCat: /record/39538
DOI: 10.1109/ASPDAC.1995.486383