Computing Optimal Assignments in Linear Time for Approximate Graph Matching. - Nils M. Kriege; Pierre-Louis Giscard; Franka Bause; Richard C. Wilson 001 (ICDM, 2019)

Computing Optimal Assignments in Linear Time for Graph Matching. - Nils M. Kriege; Pierre-Louis Giscard; Franka Bause; Richard C. Wilson 001 (CoRR, 2019)

TUDataset: A collection of benchmark datasets for learning with graphs. - Christopher Morris 001; Nils M. Kriege; Franka Bause; Kristian Kersting; Petra Mutzel; Marion Neumann (CoRR, 2020)

Metric Indexing for Graph Similarity Search. - Franka Bause; David B. Blumenthal; Erich Schubert; Nils M. Kriege (SISAP, 2021)

Gradual Weisfeiler-Leman: Slow and Steady Wins the Race. - Franka Bause; Nils Morten Kriege (LoG, 2022)

EmbAssi: embedding assignment costs for similarity search in large graph databases. - Franka Bause; Erich Schubert; Nils M. Kriege (Data Min. Knowl. Discov., 2022)

Non-Redundant Graph Neural Networks with Improved Expressiveness. - Franka Bause; Samir Moustafa; Johannes Langguth; Wilfried N. Gansterer; Nils M. Kriege (CoRR, 2023)

Preventing Representational Rank Collapse in MPNNs by Splitting the Computational Graph. - Andreas Roth; Franka Bause; Nils Morten Kriege; Thomas Liebig (LoG, 2024)

On the Two Sides of Redundancy in Graph Neural Networks. - Franka Bause; Samir Moustafa; Johannes Langguth; Wilfried N. Gansterer; Nils M. Kriege (ECML/PKDD (6), 2024)

Approximating the Graph Edit Distance with Compact Neighborhood Representations. - Franka Bause; Christian Permann; Nils M. Kriege (ECML/PKDD (5), 2024)

Maximally Expressive GNNs for Outerplanar Graphs. - Franka Bause; Fabian Jogl; Patrick Indri; Tamara Drucks; David Penz; Nils Morten Kriege; Thomas Gärtner 001; Pascal Welke; Maximilian Thiessen (Trans. Mach. Learn. Res., 2025)

Weisfeiler and Leman Go Gambling: Why Expressive Lottery Tickets Win. - Lorenz Kummer; Samir Moustafa; Anatol Ehrlich; Franka Bause; Nikolaus Süss; Wilfried N. Gansterer; Nils M. Kriege (CoRR, 2025)