3

The Kinetic Hourglass Data Structure for Computing the Bottleneck Distance of Dynamic Data
The kinetic data structure (KDS) framework is a powerful tool for maintaining various geometric configurations of continuously moving …
E. Munch, Elena Xinyi Wang, C. Wenk
PDF arXiv
A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance
Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion …
E. Chambers, E. Munch, S. Percival, Elena Xinyi Wang
PDF Code arXiv
Taxonomy of Benchmarks in Graph Representation Learning
Graph Neural Networks (GNNs) extend the success of neural networks to graph-structured data by accounting for their intrinsic geometry. …
R. Liu, S. Cantürk, F. Wenkel, S. McGuire, Elena Xinyi Wang, A. Little, L. O'Bray, M. Perlmutter, B. Rieck, M. Hirn, G. Wolf, L. Rampášek
PDF Code arXiv