Madhumita Kundu

Orcid: 0000-0002-8562-946X

According to our database1, Madhumita Kundu authored at least 13 papers between 2022 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST.
CoRR, March, 2025

Fixed-parameter algorithms for Fair Hitting Set problems.
Inf. Comput., 2025

Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Parameterized Algorithms for Power Edge Set and Zero Forcing Set.
Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

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

Time-Approximation Trade-Offs for Learning Bayesian Networks.
Proceedings of the International Conference on Probabilistic Graphical Models, 2024

Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Parameterized Complexity of Paired Domination.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Exponential-Time Approximation Schemes via Compression.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Discovering Bayesian Networks when Few Variables Matter.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Fair Soft Clustering.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
Parameterized Complexity of Maximum Edge Colorable Subgraph.
Algorithmica, 2022


  Loading...