HOPS: Probabilistic Subtree Mining for Small and Large Graphs. - Pascal Welke; Florian Seiffarth; Michael Kamp; Stefan Wrobel (KDD, 2020)

Maximum Margin Separations in Finite Closure Systems. - Florian Seiffarth; Tamás Horváth 001; Stefan Wrobel (ECML/PKDD (1), 2020)

A Fast Heuristic for Computing Geodesic Closures in Large Networks. - Florian Seiffarth; Tamás Horváth 001; Stefan Wrobel (DS, 2022)

A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining. - Florian Seiffarth; Tamás Horváth 001; Stefan Wrobel (LWDA, 2022)

A Fast Heuristic for Computing Geodesic Cores in Large Networks. - Florian Seiffarth; Tamás Horváth 001; Stefan Wrobel (CoRR, 2022)

Theoretical and Practical Aspects of Finite Closure Systems for Mining and Learning - Florian Seiffarth (2023)

Maximal closed set and half-space separations in finite closure systems. - Florian Seiffarth; Tamás Horváth 001; Stefan Wrobel (Theor. Comput. Sci., 2023)

Rule Based Learning with Dynamic (Graph) Neural Networks. - Florian Seiffarth (CoRR, 2024)