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

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

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

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

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

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

6 |
Fine-Grained Complexity Analysis of Two Classic TSP Variants |
de Berg, Mark et al. |
2016 |

7 |
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes |
de Berg, Mark et al. |
2016 |

8 |
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials |
Jansen, Bart M. P. et al. |
2016 |

9 |
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT |
Jansen, Bart M. P. et al. |
2015 |

10 |
Cross-Composition: A New Technique for Kernelization Lower Bounds |
Bodlaender, Hans L. et al. |
2011 |