Partite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each
h...
The Chvátal-Lovász theorem from 1974 establishes in every finite digraph...
We solve the r-star covering problem in simple orthogonal polygons, also...
The approximate uniform sampling of graph realizations with a given degr...
We propose a simple and fast method for providing a high quality solutio...
One of the simplest methods of generating a random graph with a given de...
Since 1997 a considerable effort has been spent to study the mixing time...
Bootstrap percolation is a class of cellular automata with random initia...
Bootstrap percolation is a class of cellular automata with random initia...
The chosen tool of this thesis is an extremal type approach. The lesson ...
We study the problem of guarding orthogonal art galleries with horizonta...