The goal of the project Algorithms and Complexity within and beyond Bounded Expansion was to develop a fine-grained theory of graph classes with bounded expansion (as well as other related notions of structural sparsity). The obtained

were used to

The project was funded in years 2020–2022 by the ERC-CZ grant LL2005 of the Ministry of Education of Czech Republic.

Project team: