Hello, welcome to my REU page. My name is Dušan Knop and I am a now graduate student of Computer Science at the Faculty of Maths and Physics of Charles University in Prague. My main scientific interests are combinatorics, graph theory, algorithms, combinatorial optimization and computational complexity.

REU 2014

• Veronika and Lukas: IV-matchings
• Peter and Karel: Kakeya sets in hypercubes
• Pavel and Lukas: W[1]-hardness of lenght bounded cut
• Veronika and Peter: L(2,1)-labelings of interval graphs

First week:

I have introduced several problems to others, so everyone can decide his problem to work on. We have done several Observations for some of the problems.

Second week:

Work is going on, we have done some useful research, so we are now able to better uderstand the problems of our interest.

Third week:

Little progre was done on especially on IV-matching, we are trying to reduce the to network flows, but there are still some dificulties to work with on.
Some progres and equivalent definition have been introduced for the Kakeya sets.

Fourth week:

Not begun yet.

Fiveth week:

Not begun yet.

Sixth week:

Not begun yet.

Seventh week:

Not begun yet.

Presentations:

• First presentation: Damaschkes's characterisation of Hamilton paths in Interval graphs and sketch of resulting algorithm.