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

1 |
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands |
Bang-Jensen, Jørgen et al. |
2023 |

2 |
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion |
Lokshtanov, Daniel et al. |
2020 |

3 |
Fault Tolerant Subgraphs with Applications in Kernelization |
Lochet, William et al. |
2020 |

4 |
On the Complexity of Recovering Incidence Matrices |
Fomin, Fedor V. et al. |
2020 |

5 |
Parameterized Complexity of Directed Spanner Problems |
Fomin, Fedor V. et al. |
2020 |

6 |
Quick Separation in Chordal and Split Graphs |
Misra, Pranabendu et al. |
2020 |

7 |
Exploring the Kernelization Borders for Hitting Cycles |
Agrawal, Akanksha et al. |
2019 |

8 |
Erdös-Pósa Property of Obstructions to Interval Graphs |
Agrawal, Akanksha et al. |
2018 |

9 |
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems |
Agrawal, Akanksha et al. |
2018 |

10 |
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity |
Lokshtanov, Daniel et al. |
2018 |

11 |
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number |
Misra, Pranabendu et al. |
2018 |

12 |
Lossy Kernels for Graph Contraction Problems |
Krithika, R. et al. |
2016 |

13 |
Finding Even Subgraphs Even Faster |
Goyal, Prachi et al. |
2015 |