Madhumita Kundu

According to our database, Madhumita Kundu authored at least 15 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Oracle Subset Problems: A Meta-algorithm for FPT Approximation via Random Walks.

Ishan Chakraborty, Tanmay Inamdar, Ariel Kulik, Madhumita Kundu, Saket Saurabh

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

FPT Approximations for Connected Maximum Coverage.

Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST.

Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh

CoRR, March, 2025

Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components.

Sriram Bhyravarapu, Pritesh Kumar, Madhumita Kundu, Shivesh K. Roy, Sahiba, Saket Saurabh

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Parameterized Algorithms for Power Edge Set and Zero Forcing Set.

Sriram Bhyravarapu, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

2024

New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition (Dagstuhl Seminar 24411).

Fedor V. Fomin, Dániel Marx, Saket Saurabh, Roohani Sharma, Madhumita Kundu

Dagstuhl Reports, 2024

Time-Approximation Trade-Offs for Learning Bayesian Networks.

Madhumita Kundu, Pekka Parviainen, Saket Saurabh

Proceedings of the International Conference on Probabilistic Graphical Models, 2024

Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset.

Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Parameterized Complexity of Paired Domination.

Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Exponential-Time Approximation Schemes via Compression.

Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Discovering Bayesian Networks when Few Variables Matter.

Madhumita Kundu, Pekka Parviainen, Saket Saurabh

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Fair Soft Clustering.

Rune D. Kjærsgaard, Pekka Parviainen, Saket Saurabh, Madhumita Kundu, Line H. Clemmensen

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Fixed-Parameter Algorithms for Fair Hitting Set Problems.

Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less.

Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2020

Parameterized Complexity of Maximum Edge Colorable Subgraph.

Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020