Author:
Grohe Martin,Kreutzer Stephan,Rabinovich Roman,Siebertz Sebastian,Stavropoulos Konstantinos
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Abraham, I., Gavoille, C., Malkhi, D., Wieder, U.: Strong-diameter decompositions of minor free graphs. In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 16–24. ACM (2007)
2. Dawar, A., Kreutzer, S.: Domination problems in nowhere-dense graph classes. In: Kannhan, R., Kumar, K.N. (eds.) Proceedings of the 29th Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 4, pp. 157–168. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2009)
3. Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)
4. Diestel, R., Rempel, C.: Dense minors in graphs of large girth. Combinatorica 25(1), 111–116 (2004)
5. Dvořák, Z.: Constant-factor approximation of the domination number in sparse graphs. Eur. J. Comb. 34(5), 833–840 (2013)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献