Qudus U, Röder M, Kirrane S, Ngomo A-CN. TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs. In: R. Payne T, Presutti V, Qi G, et al., eds. The Semantic Web – ISWC 2023. Vol 14265.10.1007/978-3-031-47240-4_25__Lecture Notes in Computer Science. Springer, Cham; 2023:465–483. doi:10.1007/978-3-031-47240-4_25
LibreCat: /record/50479
DOI: 10.1007/978-3-031-47240-4_25

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

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

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

Casalicchio G, Bossek J, Lang M, et al. OpenML: An R Package to Connect to the Machine Learning Platform OpenML. Computational Statistics. 2019;34(3):977–991. doi:10.1007/s00180-017-0742-2
LibreCat: /record/48877
DOI: 10.1007/s00180-017-0742-2

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