
TwinWidth is Linear in the Poset Width
Twinwidth is a new parameter informally measuring how diverse are the n...
read it

Computational Complexity of Covering Twovertex Multigraphs with Semiedges
We initiate the study of computational complexity of graph coverings, ak...
read it

CliqueWidth of Point Configurations
While structural width parameters (of the input) belong to the standard ...
read it

Exact Crossing Number Parameterized by Vertex Cover
We prove that the exact crossing number of a graph can be efficiently co...
read it

On Colourability of Polygon Visibility Graphs
We study the problem of colouring visibility graphs of polygons. In part...
read it

On conflictfree chromatic guarding of simple polygons
We study the problem of colouring the vertices of a polygon, such that e...
read it

Bounded maximum degree conjecture holds precisely for ccrossingcritical graphs with c ≤ 12
We study ccrossingcritical graphs, which are the minimal graphs that r...
read it

A New Perspective on FO Model Checking of Dense Graph Classes
We study the firstorder (FO) model checking problem of dense graphs, na...
read it

Structure and generation of crossingcritical graphs
We study ccrossingcritical graphs, which are the minimal graphs that r...
read it

FO model checking of geometric graphs
Over the past two decades the main focus of research into firstorder (F...
read it
Petr Hliněný
is this you? claim profile