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


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