Leo Versteegen

activity

20212025

most citedA faster algorithm for Cops and Robbers

7 citations · 18 across the 18 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021★ 7 cited

A faster algorithm for Cops and Robbers

Jan Petr, Julien Portier, Leo Versteegen

We present an algorithm of time complexity $O (k n^{k + 2})$ deciding whether a graph $G$ on $n$ vertices is $k$ -copwin. The fastest algorithm thus far had time complexity $O(n^{2k+2})…

math.CO2021

Common and Sidorenko equations in Abelian groups

Leo Versteegen

A linear configuration is said to be common in a finite Abelian group $G$ if for every 2-coloring of $G$ the number of monochromatic instances of the configuration is at least as l…