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

1 |
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs |
Jansen, Bart M. P. et al. |
2019 |

2 |
Best-Case and Worst-Case Sparsifiability of Boolean CSPs |
Chen, Hubie et al. |
2019 |

3 |
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth |
van Geffen, Bas A. M. et al. |
2019 |

4 |
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank |
Jansen, Bart M. P. et al. |
2018 |

5 |
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials |
Jansen, Bart M. P. et al. |
2018 |

6 |
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations |
Jansen, Bart M. P. et al. |
2018 |

7 |
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor |
Jansen, Bart M. P. et al. |
2018 |

8 |
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes |
Jansen, Bart M. P. et al. |
2017 |

9 |
The First Parameterized Algorithms and Computational Experiments Challenge |
Dell, Holger et al. |
2017 |

10 |
Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight |
Jansen, Bart M. P. |
2016 |