No. Title Author Year
1 Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness Nadara, Wojciech et al. 2018
2 First-Order Interpretations of Bounded Expansion Classes Gajarský, Jakub et al. 2018
3 Lossy Kernels for Connected Dominating Set on Sparse Graphs Eiben, Eduard et al. 2018
4 Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs Eickmeyer, Kord et al. 2017
5 Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs Kreutzer, Stephan et al. 2017
6 Kernelization and Sparseness: the Case of Dominating Set Drange, Pål Grønås et al. 2016
7 The Generalised Colouring Numbers on Classes of Bounded Expansion Kreutzer, Stephan et al. 2016
8 Graph Searching Games and Width Measures for Directed Graphs Akhoondian Amiri, Saeed et al. 2015
9 Characterisations of Nowhere Dense Graphs (Invited Talk) Grohe, Martin et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI