1. Adler, H., Adler, I.: Interpreting nowhere dense graph classes as a classical notion of model theory. Eur. J. Comb. 36, 322–330 (2014)
2. Fabiański, G., Pilipczuk, M., Siebertz, S., Toruńczyk, S.: Progressive algorithms for domination and independence. In: Niedermeier, R., Paul, C. (eds.) 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, 13–16 March 2019, Berlin, Germany, volume 126 of LIPIcs, pp. 27:1–27:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
3. Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615–627 (1980)
4. Nešetřil, J., Ossona de Mendez, P.: The grad of a graph and classes with bounded expansion. Electron. Notes Discret. Math. 22, 101–106 (2005)
5. Nešetřil, J., Ossona de Mendez, P.: First order properties on nowhere dense structures. J. Symb. Log. 75(3), 868–887 (2010)