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 |
Multi-Budgeted Directed Cuts |
Kratsch, Stefan et al. |
2019 |

3 |
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs |
Karpov, Nikolai et al. |
2018 |

4 |
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness |
Nadara, Wojciech et al. |
2018 |

5 |
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set |
Kiljan, Krzysztof et al. |
2018 |

6 |
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation |
Ziobro, Michal et al. |
2018 |

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

8 |
Edge Bipartization Faster Than 2^k |
Pilipczuk, Marcin et al. |
2017 |

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

10 |
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs |
Chekuri, Chandra et al. |
2016 |