Structure of tractable instances of hard algorithmic problems on graphs


This project doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official project website can be found on

Investor logo
Project Identification
Project Period
1/2020 - 12/2022
Investor / Pogramme / Project type
Czech Science Foundation
MU Faculty or unit
Faculty of Informatics

One of the fundamental questions in theoretical CS is how to approach problems which are intractable in their full generality. Our proposal is to investigate the internal structure of tractable instances of such generally hard problems on graphs, namely those dealing with structural and topological graph theory, geometric graphs, and of problems definable in various logics. In particular, we propose to investigate algorithmic and complexity theoretical aspects of new width and sparsity parameters of graph classes, properties of geometric representations of graphs, tractable instances for the FO model checking problem, and the detailed structure of the graph crossing number problem.


Total number of publications: 12

Previous 1 2 Next

You are running an old browser version. We recommend updating your browser to its latest version.

More info