No. |
Title |
Author |
Year |
---|

1 |
Elimination Distance to Bounded Degree on Planar Graphs |
Lindermayr, Alexander et al. |
2020 |

2 |
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets |
Lokshtanov, Daniel et al. |
2020 |

3 |
Algorithmic Properties of Sparse Digraphs |
Kreutzer, Stephan et al. |
2019 |

4 |
Progressive Algorithms for Domination and Independence |
Fabianski, Grzegorz et al. |
2019 |

5 |
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness |
Nadara, Wojciech et al. |
2018 |

6 |
First-Order Interpretations of Bounded Expansion Classes |
Gajarský, Jakub et al. |
2018 |

7 |
Lossy Kernels for Connected Dominating Set on Sparse Graphs |
Eiben, Eduard et al. |
2018 |

8 |
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs |
Eickmeyer, Kord et al. |
2017 |

9 |
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs |
Kreutzer, Stephan et al. |
2017 |

10 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |

11 |
The Generalised Colouring Numbers on Classes of Bounded Expansion |
Kreutzer, Stephan et al. |
2016 |

12 |
Graph Searching Games and Width Measures for Directed Graphs |
Akhoondian Amiri, Saeed et al. |
2015 |

13 |
Characterisations of Nowhere Dense Graphs (Invited Talk) |
Grohe, Martin et al. |
2013 |