2 papers
cs.DB2026
Even Faster Geosocial Reachability Queries
Rick van der Heijden, Nikolay Yakovets, Thekla Hamm
Geosocial reachability queries (\textsc{RangeReach}) determine whether a given vertex in a geosocial network can reach any spatial vertex within a query region. The state-of-the-ar…
cs.DS2025
Attractors Is All You Need: Parity Games In Polynomial Time
Rick van der Heijden
This paper provides a polynomial-time algorithm for solving parity games that runs in time-ending a search that has taken decades. Unlike previous…