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

1 |
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization |
Egri, László et al. |
2018 |

2 |
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms |
Bonnet, Édouard et al. |
2018 |

3 |
The Parameterized Hardness of the k-Center Problem in Transportation Networks |
Feldmann, Andreas Emil et al. |
2018 |

4 |
Fine-Grained Complexity of Coloring Unit Disks and Balls |
Biró, Csaba et al. |
2017 |

5 |
Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk) |
Marx, Dániel |
2017 |

6 |
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms |
Bacsó, Gábor et al. |
2017 |

7 |
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix |
Chen, Lin et al. |
2017 |

8 |
Subexponential Parameterized Algorithms for Graphs of Polynomial Growth |
Marx, Dániel et al. |
2017 |

9 |
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) |
Erickson, Jeff et al. |
2016 |

10 |
Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs |
Marx, Dániel et al. |
2016 |