We introduce and study conflict-free colourings of t-subsets in
hypergra...
We give a strongly polynomial-time algorithm for integer linear programs...
Weak and strong coloring numbers are generalizations of the degeneracy o...
We study a natural generalization of the classical ϵ-net problem
(Haussl...
A string graph is the intersection graph of a family of continuous arcs...
share