research
∙
07/03/2022
Conflict-Free Colouring of Subsets
We introduce and study conflict-free colourings of t-subsets in hypergra...
share
research
∙
06/10/2021
Integer programs with bounded subdeterminants and two nonzeros per row
We give a strongly polynomial-time algorithm for integer linear programs...
research
∙
03/31/2021
Weak Coloring Numbers of Intersection Graphs
Weak and strong coloring numbers are generalizations of the degeneracy o...
research
∙
03/16/2020
The ε-t-Net Problem
We study a natural generalization of the classical ϵ-net problem (Haussl...
research
∙
03/18/2018