Recent & Upcoming Talks

Generating graphs with a given degree sequence uniformly and randomly is a challenging problem. One of the popular methods is the switch Markov chain, which is a Markov chain Monte Carlo method that takes a random walk on the set of realizations via switches.

Extended version of the talk of the same title given at EUROCOMB19

The aim of this paper is to confirm that $P$-stability of a family of unconstrained/bipartite/directed degree sequences is sufficient …

The swap Markov chain on a bipartite degree sequence $d$ operates on realizations of $d$ by taking two-two vertices from each color …

We study the problem of covering simple orthogonal art galleries with rectangular stars. The problem has been shown to be polynomial by …

Commitee: András Gyárfás, Frank Hoffmann, Károly Böröczky (chair), Ervin Győri (supervisor, non-voting)

Our results are concerned with art gallery theorems on orthogonal polygons. We prove that an n-vertex orthogonal polygon can be …

Art gallery theorems are concerned with the number of guards required to control a polygon, and many variations exist depending on how …