research
∙
08/25/2023
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
Partite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each h...
share
research
∙
07/09/2023
On the Small Quasi-kernel conjecture
The Chvátal-Lovász theorem from 1974 establishes in every finite digraph...
research
∙
04/26/2023
Covering simple orthogonal polygons with r-stars
We solve the r-star covering problem in simple orthogonal polygons, also...
research
∙
04/20/2022
Approximate Sampling of Graphs with Near-P-stable Degree Intervals
The approximate uniform sampling of graph realizations with a given degr...
research
∙
11/01/2021
Algorithms for Interference Minimization in Future Wireless Network Decomposition
We propose a simple and fast method for providing a high quality solutio...
research
∙
09/05/2019
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing
One of the simplest methods of generating a random graph with a given de...
research
∙
03/15/2019
The mixing time of the swap (switch) Markov chains: a unified approach
Since 1997 a considerable effort has been spent to study the mixing time...
research
∙
09/05/2018
Complexity of 2D bootstrap percolation difficulty: Algorithm and NP-hardness
Bootstrap percolation is a class of cellular automata with random initia...
research
∙
09/05/2018
Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard
Bootstrap percolation is a class of cellular automata with random initia...
research
∙
08/29/2017
Extremal solutions to some art gallery and terminal-pairability problems
The chosen tool of this thesis is an extremal type approach. The lesson ...
research
∙
06/08/2017
