| Parameterized complexity of maximum edge colorable subgraph A Agrawal, M Kundu, A Sahu, S Saurabh, P Tale Algorithmica 84 (10), 3075-3100, 2022 | 7 | 2022 |
| Fair soft clustering RD Kjærsgaard, P Parviainen, S Saurabh, M Kundu, LKH Clemmensen 27th International Conference on Artificial Intelligence and Statistics …, 2024 | 1 | 2024 |
| Fpt approximations for packing and covering problems parameterized by elimination distance and even less T Inamdar, L Kanesh, M Kundu, MS Ramanujan, S Saurabh arXiv preprint arXiv:2310.03469, 2023 | 1 | 2023 |
| Fixed-Parameter Algorithms for Fair Hitting Set Problems T Inamdar, L Kanesh, M Kundu, N Purohit, S Saurabh arXiv preprint arXiv:2307.08854, 2023 | 1 | 2023 |
| Time–Approximation Trade-Offs for Learning Bayesian Networks M Kundu, P Parviainen, S Saurabh International Conference on Probabilistic Graphical Models, 486-497, 2024 | | 2024 |
| Parameterized Complexity of Paired Domination N Andreev, I Bliznets, M Kundu, S Saurabh, V Tripathi, S Verma International Workshop on Combinatorial Algorithms, 523-536, 2024 | | 2024 |
| Exponential-Time Approximation Schemes via Compression T Inamdar, M Kundu, P Parviainen, MS Ramanujan, S Saurabh 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 2024 | | 2024 |
