No. Title Author Year
1 Algorithmic Properties of Sparse Digraphs Kreutzer, Stephan et al. 2019
2 Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness Nadara, Wojciech et al. 2018
3 Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs Eickmeyer, Kord et al. 2017
4 Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs Kreutzer, Stephan et al. 2017
5 Routing with Congestion in Acyclic Digraphs Amiri, Saeed Akhoondian et al. 2016
6 The Generalised Colouring Numbers on Classes of Bounded Expansion Kreutzer, Stephan et al. 2016
7 Graph Searching Games and Width Measures for Directed Graphs Akhoondian Amiri, Saeed et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 7


DROPS-Home | Imprint | Privacy Published by LZI