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

1 |
Extending Partial 1-Planar Drawings |
Eiben, Eduard et al. |
2020 |

2 |
On Covering Segments with Unit Intervals |
Bergren, Dan et al. |
2020 |

3 |
Group Activity Selection with Few Agent Types |
Ganian, Robert et al. |
2019 |

4 |
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth |
Eiben, Eduard et al. |
2019 |

5 |
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem |
Ganian, Robert et al. |
2018 |

6 |
Small Resolution Proofs for QBF using Dependency Treewidth |
Eiben, Eduard et al. |
2018 |

7 |
Combining Treewidth and Backdoors for CSP |
Ganian, Robert et al. |
2017 |

8 |
On Structural Parameterizations of the Edge Disjoint Paths Problem |
Ganian, Robert et al. |
2017 |

9 |
Towards a Polynomial Kernel for Directed Feedback Vertex Set |
Bergougnoux, Benjamin et al. |
2017 |

10 |
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion |
Eiben, Eduard et al. |
2016 |

11 |
Counting Linear Extensions: Parameterizations by Treewidth |
Eiben, Eduard et al. |
2016 |

12 |
On Existential MSO and its Relation to ETH |
Ganian, Robert et al. |
2016 |

13 |
On the Complexity Landscape of Connected f-Factor Problems |
Ganian, Robert et al. |
2016 |

14 |
Meta-kernelization using Well-structured Modulators |
Eiben, Eduard et al. |
2015 |

15 |
Lower Bounds on the Complexity of MSO_1 Model-Checking |
Ganian, Robert et al. |
2012 |

16 |
Clique-width: When Hard Does Not Mean Impossible |
Ganian, Robert et al. |
2011 |

17 |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width |
Ganian, Robert et al. |
2010 |

18 |
The Parameterized Complexity of Oriented Colouring |
Ganian, Robert |
2009 |