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

1 |
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP |
Bonnet, Édouard et al. |
2019 |

2 |
Parameterized Complexity of Independent Set in H-Free Graphs |
Bonnet, Édouard et al. |
2019 |

3 |
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration |
Bonnet, Édouard et al. |
2019 |

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

5 |
On the Parameterized Complexity of Red-Blue Points Separation |
Bonnet, Édouard et al. |
2018 |

6 |
Orthogonal Terrain Guarding is NP-complete |
Bonnet, Édouard et al. |
2018 |

7 |
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs |
Bonnet, Édouard et al. |
2018 |

8 |
An Approximation Algorithm for the Art Gallery Problem |
Bonnet, Édouard et al. |
2017 |

9 |
Complexity of Token Swapping and its Variants |
Bonnet, Édouard et al. |
2017 |

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