| No. |
Title |
Author |
Year |
| 1 |
Enumeration of Preferred Extensions in Almost Oriented Digraphs |
Gaspers, Serge et al. |
2019 |
| 2 |
Minimizing and Computing the Inverse Geodesic Length on Trees |
Gaspers, Serge et al. |
2019 |
| 3 |
Colouring Square-Free Graphs without Long Induced Paths |
Gaspers, Serge et al. |
2018 |
| 4 |
Backdoor Sets for CSP |
Gaspers, Serge et al. |
2017 |
| 5 |
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements |
Gaspers, Serge et al. |
2017 |
| 6 |
Exact Algorithms via Multivariate Subroutines |
Gaspers, Serge et al. |
2017 |
| 7 |
On Satisfiability Problems with a Linear Structure |
Gaspers, Serge et al. |
2017 |
| 8 |
The Parameterized Complexity of Positional Games |
Bonnet, Édouard et al. |
2017 |
| 9 |
Turbocharging Treewidth Heuristics |
Gaspers, Serge et al. |
2017 |
| 10 |
On the Complexity of Grammar-Based Compression over Fixed Alphabets |
Casel, Katrin et al. |
2016 |
| 11 |
Backdoors to q-Horn |
Gaspers, Serge et al. |
2013 |
| 12 |
Kernels for Feedback Arc Set In Tournaments |
Bessy, Stéphane et al. |
2009 |
