| 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 | 22 | 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 | 14 | 2020 |
| 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 | 9 | 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 | 8 | 2019 |
| 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 |
| Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number P Misra, S Saurabh, R Sharma, M Zehavi Algorithmica, 1-22, 2023 | 4 | 2023 |
| 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 | 4 | 2020 |
| 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 | 4 | 2019 |
| 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 |
| On weighted graph separation problems and flow-augmentation EJ Kim, M Pilipczuk, R Sharma, M Wahlström arXiv preprint arXiv:2208.14841, 2022 | 3 | 2022 |
| Parameterized complexity of weighted multicut in trees E Galby, D Marx, P Schepper, R Sharma, P Tale Graph-Theoretic Concepts in Computer Science: 48th International Workshop …, 2022 | 2 | 2022 |
| Product dimension of forests and bounded treewidth graphs LS Chandran, R Mathew, D Rajendraprasad, R Sharma arXiv preprint arXiv:1209.2218, 2012 | 2 | 2012 |
| Parameterized Approximation Schemes for Clustering with General Norm Objectives F Abbasi, S Banerjee, J Byrka, P Chalermsook, A Gadekar, ... arXiv preprint arXiv:2304.03146, 2023 | 1 | 2023 |
| Parameterized complexity of directed spanner problems FV Fomin, PA Golovach, W Lochet, P Misra, S Saurabh, R Sharma Algorithmica 84 (8), 2292-2308, 2022 | 1 | 2022 |
| A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs J Madathil, R Sharma, M Zehavi Algorithmica 83, 1861-1884, 2021 | 1 | 2021 |
| Quick separation in chordal and split graphs P Misra, F Panolan, A Rai, S Saurabh, R Sharma 45th International Symposium on Mathematical Foundations of Computer Science …, 2020 | 1 | 2020 |
| Exact and approximate digraph bandwidth P Jain, L Kanesh, W Lochet, S Saurabh, R Sharma 39th IARCS Annual Conference on Foundations of Software Technology and …, 2019 | 1 | 2019 |
| Brief announcement: Treewidth modulator: Emergency exit for DFVS D Lokshtanov, MS Ramanujan, S Saurabh, R Sharma, M Zehavi 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 1 | 2018 |
| Kernelizing Buttons and Scissors. A Agrawal, S Kolay, S Saurabh, R Sharma CCCG, 279-286, 2016 | 1 | 2016 |
| Parameterized Complexity Classification for Interval Constraints KK Dabrowski, P Jonsson, S Ordyniak, G Osipov, M Pilipczuk, R Sharma arXiv preprint arXiv:2305.13889, 2023 | | 2023 |
