Abstract
The thesis is comprised of two parts. The first part studies constraint satisfaction problems over infinite domains and its most important result is the complete classification of complexity of the constraint satisfaction problem for languages over the dense linear order.
The second part studies computational complexity of problems connected with graph drawing.