activity
20222025
most citedOne Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction

1 citations · 2 across the 4 of their papers we have counts for

collaborators

5 papers

cs.LG2025★ 1 cited

GraphBench: Next-generation graph learning benchmarking

Timo Stoll, Chendi Qian, Ben Finkelshtein +16

Machine learning on graphs has made substantial progress across domains such as molecular property prediction and chip design. Yet benchmarking practices remain fragmented, often r…

cs.LG2024

Distinguished In Uniform: Self Attention Vs. Virtual Nodes

Eran Rosenbluth, Jan Tönshoff, Martin Ritzert +2

Graph Transformers (GTs) such as SAN and GPS are graph processing models that combine Message-Passing GNNs (MPGNNs) with global Self-Attention. They were shown to be universal func…

cs.LG2023

Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark

Jan Tönshoff, Martin Ritzert, Eran Rosenbluth +1

The recent Long-Range Graph Benchmark (LRGB, Dwivedi et al. 2022) introduced a set of graph learning tasks strongly dependent on long-range interaction between vertices. Empirical…

cs.LG2023

WL meet VC

Christopher Morris, Floris Geerts, Jan Tönshoff +1

Recently, many works studied the expressive power of graph neural networks (GNNs) by linking it to the -dimensional Weisfeiler--Leman algorithm (). Here, t…

cs.AI2022★ 1 cited

One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction

Jan Tönshoff, Berke Kisin, Jakob Lindner +1

We propose a universal Graph Neural Network architecture which can be trained as an end-2-end search heuristic for any Constraint Satisfaction Problem (CSP). Our architecture can b…