Options
Wrobel, Stefan
Maximal closed set and half-space separations in finite closure systems
A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining
Mining Tree Patterns with Partially Injective Homomorphisms
A Fast Heuristic for Computing Geodesic Closures in Large Networks
Learning Weakly Convex Sets in Metric Spaces
Probabilistic frequent subtrees for efficient graph classification and retrieval
A generalized Weisfeiler-Lehman graph kernel
Probabilistic and exact frequent subtree mining in graphs beyond forests