Madhumita Kundu

20 papers A 4B 3C 2Misc 1Journal 8Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	FPT Approximations for Connected Maximum Coverage. ITCS Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	FPT Approximations for Connected Maximum Coverage. CoRR Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2025	J	`jnl`	A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST. CoRR Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh
2025	J	`jnl`	Fixed-parameter algorithms for Fair Hitting Set problems. Inf. Comput. Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2025	B	`conf`	Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components. MFCS Sriram Bhyravarapu, Pritesh Kumar, Madhumita Kundu, Shivesh K. Roy, Sahiba, Saket Saurabh
2025	C	`conf`	Parameterized Algorithms for Power Edge Set and Zero Forcing Set. IWOCA Sriram Bhyravarapu, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh
2024	A	`conf`	Discovering Bayesian Networks when Few Variables Matter. ECAI Madhumita Kundu, Pekka Parviainen, Saket Saurabh
2024	A	`conf`	Exponential-Time Approximation Schemes via Compression. ITCS Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh
2024	A	`conf`	Fair Soft Clustering. AISTATS Rune D. Kjærsgaard, Pekka Parviainen, Saket Saurabh, Madhumita Kundu, Line H. Clemmensen
2024	J	`jnl`	New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition (Dagstuhl Seminar 24411). Dagstuhl Reports Fedor V. Fomin, Dániel Marx, Saket Saurabh, Roohani Sharma, Madhumita Kundu
2024	C	`conf`	Parameterized Complexity of Paired Domination. IWOCA Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma
2024	B	`conf`	Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. IPEC Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh
2024	—	`conf`	Time-Approximation Trade-Offs for Learning Bayesian Networks. PGM Madhumita Kundu, Pekka Parviainen, Saket Saurabh
2023	—	`conf`	FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
2023	J	`jnl`	FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. CoRR Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
2023	B	`conf`	Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2023	J	`jnl`	Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2022	J	`jnl`	Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2020	Misc	`conf`	Parameterized Complexity of Maximum Edge Colorable Subgraph. COCOON Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	Parameterized Complexity of Maximum Edge Colorable Subgraph. CoRR Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale