140 citations · 143 across the 5 of their papers we have counts for
5 papers
A Higher-Order Temporal H-Index for Evolving Networks
Lutz Oettershagen, Nils M. Kriege, Petra Mutzel
The H-index of a node in a static network is the maximum value such that at least of its neighbors have a degree of at least . Recently, a generalized version, the -t…
Improved Exact and Heuristic Algorithms for Maximum Weight Clique
Roman Erhardt, Kathrin Hanauer, Nils Kriege +2
We propose improved exact and heuristic algorithms for solving the maximum weight clique problem, a well-known problem in graph theory with many applications. Our algorithms interl…
Gradual Weisfeiler-Leman: Slow and Steady Wins the Race
Franka Bause, Nils M. Kriege
The classical Weisfeiler-Leman algorithm aka color refinement is fundamental for graph learning with kernels and neural networks. Originally developed for graph isomorphism testing…
Finding Largest Common Substructures of Molecules in Quadratic Time
Andre Droschinsky, Nils Kriege, Petra Mutzel
Finding the common structural features of two molecules is a fundamental task in cheminformatics. Most drugs are small molecules, which can naturally be interpreted as graphs. Henc…
Subgraph Matching Kernels for Attributed Graphs
Nils Kriege, Petra Mutzel
We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al.…