Improved algorithms and combinatorial bounds for independent feedback vertex set A Agrawal, S Gupta, S Saurabh, R Sharma 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017 | 26 | 2017 |

Covering small independent sets and separators with applications to parameterized algorithms D Lokshtanov, F Panolan, S Saurabh, R Sharma, M Zehavi ACM Transactions on Algorithms (TALG) 16 (3), 1-31, 2020 | 19 | 2020 |

On Weighted Graph Separation Problems and Flow Augmentation EJ Kim, T Masařík, M Pilipczuk, R Sharma, M Wahlström SIAM Journal on Discrete Mathematics 38 (1), 170-189, 2024 | 11 | 2024 |

Kernels for deletion to classes of acyclic digraphs A Agrawal, S Saurabh, R Sharma, M Zehavi Journal of Computer and System Sciences 92, 9-21, 2018 | 10 | 2018 |

Balanced judicious bipartition is fixed-parameter tractable D Lokshtanov, S Saurabh, R Sharma, M Zehavi SIAM Journal on Discrete Mathematics 33 (4), 1878-1911, 2019 | 9 | 2019 |

Fault tolerant subgraphs with applications in kernelization W Lochet, D Lokshtanov, P Misra, S Saurabh, R Sharma, M Zehavi 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020 | 8 | 2020 |

Metric dimension parameterized by feedback vertex set and other structural parameters E Galby, L Khazaliya, F Mc Inerney, R Sharma, P Tale SIAM Journal on Discrete Mathematics 37 (4), 2241-2264, 2023 | 7 | 2023 |

Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS D Lokshtanov, MS Ramanujan, S Saurabh, R Sharma, M Zehavi Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019 | 7 | 2019 |

Parameterized approximation schemes for clustering with general norm objectives F Abbasi, S Banerjee, J Byrka, P Chalermsook, A Gadekar, ... 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 6 | 2023 |

Treedepth vs circumference M Briański, G Joret, K Majewski, P Micek, MT Seweryn, R Sharma Combinatorica 43 (4), 659-664, 2023 | 6 | 2023 |

Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation M Hatzel, L Jaffke, PT Lima, T Masařík, M Pilipczuk, R Sharma, M Sorge Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 6 | 2023 |

Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover F Foucaud, E Galby, L Khazaliya, S Li, F Mc Inerney, R Sharma, P Tale 51st International Colloquium on Automata, Languages, and Programming (ICALP …, 2024 | 5 | 2024 |

On the Parameterized Complexity of Deletion to -free Strong Components R Neogi, MS Ramanujan, S Saurabh, R Sharma arXiv preprint arXiv:2005.01359, 2020 | 5 | 2020 |

Parameterized complexity classification for interval constraints KK Dabrowski, P Jonsson, S Ordyniak, G Osipov, M Pilipczuk, R Sharma arXiv preprint arXiv:2305.13889, 2023 | 4 | 2023 |

Faster exponential-time approximation algorithms using approximate monotone local search BC Esmer, A Kulik, D Marx, D Neuen, R Sharma arXiv preprint arXiv:2206.13481, 2022 | 4 | 2022 |

Parameterized complexity of weighted multicut in trees E Galby, D Marx, P Schepper, R Sharma, P Tale International Workshop on Graph-Theoretic Concepts in Computer Science, 257-270, 2022 | 4 | 2022 |

Parameterised algorithms for deletion to classes of DAGs A Agrawal, S Saurabh, R Sharma, M Zehavi Theory of Computing Systems 62, 1880-1909, 2018 | 4 | 2018 |

Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number P Misra, S Saurabh, R Sharma, M Zehavi 38th IARCS Annual Conference on Foundations of Software Technology and …, 2018 | 4 | 2018 |

Domination and cut problems on chordal graphs with bounded leafage E Galby, D Marx, P Schepper, R Sharma, P Tale Algorithmica 86 (5), 1428-1474, 2024 | 3 | 2024 |

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations F Foucaud, E Galby, L Khazaliya, S Li, FM Inerney, R Sharma, P Tale arXiv preprint arXiv:2307.08149, 2023 | 3 | 2023 |