Patrick Schnider

activity

20242026

collaborators

Showing 2025Show all

5 papers · 1 filter

cs.LG2025

LEAP: Local ECT-Based Learnable Positional Encodings for Graphs

Juan Amboage, Ernst Röell, Patrick Schnider +1

Graph neural networks (GNNs) largely rely on the message-passing paradigm, where nodes iteratively aggregate information from their neighbors. Yet, standard message passing neural…

math.AT2025

Flagifying the Dowker Complex

Marius Huber, Patrick Schnider

The Dowker complex $D_{R} (X, Y)$ is a simplicial complex capturing the topological interplay between two finite sets $X$ and $Y$ under some relation $R \subseteq X \times Y$ .…

cs.CC2025

Query-Efficient Fixpoints of $ℓ_{p}$ -Contractions

Sebastian Haslebacher, Jonas Lill, Patrick Schnider +1

We prove that an $ε$ -approximate fixpoint of a map $f : [0, 1]^{d} \to [0, 1]^{d}$ can be found with $O (d^{2} (lo g \frac{1}{ε} + lo g \frac{1}{1 - λ}))$ queries to $f$ if $f$ is $…

cs.CG2025

Chasing puppies on orthogonal straight-line plane graphs

Johanna Ockenfels, Yoshio Okamoto, Patrick Schnider

Assume that you have lost your puppy on an embedded graph. You can walk around on the graph and the puppy will run towards you at infinite speed, always locally minimizing the dist…

cs.CG2025

Bounds for k-centers of point sets under $L_{\infty}$ -bottleneck distance

Mats Bierwirth, Julia Hütte, Patrick Schnider +1

We consider the $k$ -center problem on the space of fixed-size point sets in the plane under the $L_{\infty}$ -bottleneck distance. While this problem is motivated by persistence dia…

LEAP: Local ECT-Based Learnable Positional Encodings for Graphs

Flagifying the Dowker Complex

Query-Efficient Fixpoints of ℓp​-Contractions

Chasing puppies on orthogonal straight-line plane graphs

Bounds for k-centers of point sets under L∞​-bottleneck distance

Query-Efficient Fixpoints of $ℓ_{p}$ -Contractions

Bounds for k-centers of point sets under $L_{\infty}$ -bottleneck distance