1. Grad and classes with bounded expansion I. Decompositions;Nešetřil;European J. Combin.,2008
2. Z. Dvořák, D. Král, R. Thomas, Deciding First-Order Properties for Sparse Graphs, in: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 2010, http://dx.doi.org/10.1109/FOCS.2010.20.
3. Grad and classes with bounded expansion II. Algorithmic aspects;Nesetril;European J. Combin.,2008
4. S. Kreutzer, I. Muzi, P.O. de Mendez, R. Rabinovich, S. Siebertz, Algorithmic Properties of Sparse Digraphs, in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Vol. 126, 2019.
5. P.G. Drange, M. Dregi, F.V. Fomin, S. Kreutzer, D. Lokshtanov, M. Pilipczuk, M. Pilipczuk, F. Reidl, F.S. Villaamil, S. Saurabh, S. Siebertz, S. Sikdar, Kernelization and Sparseness: the Case of Dominating Set, in: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Vol. 47, 2016.