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

1 |
Balanced Judicious Bipartition is Fixed-Parameter Tractable |
Lokshtanov, Daniel et al. |
2018 |

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

3 |
On the Parameterized Complexity of Contraction to Generalization of Trees |
Agrawal, Akanksha et al. |
2018 |

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

5 |
A Linear-Time Parameterized Algorithm for Node Unique Label Cover |
Lokshtanov, Daniel et al. |
2017 |

6 |
Communication Complexity of Pairs of Graph Families with Applications |
Kolay, Sudeshna et al. |
2017 |

7 |
Covering Vectors by Spaces: Regular Matroids |
Fomin, Fedor V. et al. |
2017 |

8 |
Exact Algorithms for Terrain Guarding |
Ashok, Pradeesha et al. |
2017 |

9 |
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2017 |

10 |
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set |
Agrawal, Akanksha et al. |
2017 |