Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. - Diptapriyo Majumdar; Venkatesh Raman 001; Saket Saurabh 001 (IPEC, 2015)

Structural Parameterizations of Feedback Vertex Set. - Diptapriyo Majumdar (IPEC, 2016)

Exact and Parameterized Algorithms for (k, i)-Coloring. - Diptapriyo Majumdar; Rian Neogi; Venkatesh Raman 001; Prafullkumar Tale (CALDAM, 2017)

FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. - Diptapriyo Majumdar; Venkatesh Raman 001 (FAW, 2017)

Structural Parameterizations of Dominating Set Variants. - Dishant Goyal; Ashwin Jacob; Kaushtubh Kumar; Diptapriyo Majumdar; Venkatesh Raman 001 (CSR, 2018)

Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization. - Diptapriyo Majumdar; Venkatesh Raman 001 (Algorithmica, 2018)

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels. - R. Krithika 001; Diptapriyo Majumdar; Venkatesh Raman 001 (Theory Comput. Syst., 2018)

Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators. - Diptapriyo Majumdar; Venkatesh Raman 001; Saket Saurabh 001 (Theory Comput. Syst., 2018)

Kernelization of Cycle Packing with Relaxed Disjointness Constraints. - Akanksha Agrawal 001; Daniel Lokshtanov; Diptapriyo Majumdar; Amer E. Mouawad; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

Bounded and Approximate Strong Satisfiability in Workflows. - Jason Crampton; Gregory Z. Gutin; Diptapriyo Majumdar (SACMAT, 2019)

Tractability of König edge deletion problems. - Diptapriyo Majumdar; Rian Neogi; Venkatesh Raman 001; S. Vaishali 001 (Theor. Comput. Sci., 2019)

Parameterized Complexity of Deletion to Scattered Graph Classes. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (IPEC, 2020)

On the Approximate Compressibility of Connected Vertex Cover. - Diptapriyo Majumdar; M. S. Ramanujan 001; Saket Saurabh 001 (Algorithmica, 2020)

p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. - Carl Einarson; Gregory Z. Gutin; Bart M. P. Jansen; Diptapriyo Majumdar; Magnus Wahlström (CoRR, 2020)

Constrained Hitting Set Problem with Intervals. - Ankush Acharyya; Vahideh Keikha; Diptapriyo Majumdar; Supantha Pandit (COCOON, 2021)

Faster FPT Algorithms for Deletion to Pairs of Graph Classes. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (FCT, 2021)

Valued Authorization Policy Existence Problem. - Jason Crampton; Eduard Eiben; Gregory Z. Gutin; Daniel Karapetyan; Diptapriyo Majumdar (SACMAT, 2021)

Parameterized Complexity of Conflict-Free Set Cover. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (Theory Comput. Syst., 2021)

Parameterized Pre-Coloring Extension and List Coloring Problems. - Gregory Z. Gutin; Diptapriyo Majumdar; Sebastian Ordyniak; Magnus Wahlström (SIAM J. Discret. Math., 2021)

Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. - Jason Crampton; Gregory Z. Gutin; Diptapriyo Majumdar (ACM Trans. Priv. Secur., 2021)

Generalized Noise Role Mining. - Jason Crampton; Eduard Eiben; Gregory Z. Gutin; Daniel Karapetyan; Diptapriyo Majumdar (SACMAT, 2022)

On the Lossy Kernelization for Connected Treedepth Deletion Set. - Eduard Eiben; Diptapriyo Majumdar; M. S. Ramanujan 001 (WG, 2022)

An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. - Eduard Eiben; Diptapriyo Majumdar; M. S. Ramanujan 001 (CoRR, 2022)

Valued Authorization Policy Existence Problem: Theory and Experiments. - Jason Crampton; Eduard Eiben; Gregory Z. Gutin; Daniel Karapetyan; Diptapriyo Majumdar (ACM Trans. Priv. Secur., 2022)

Finding a Highly Connected Steiner Subgraph and its Applications. - Eduard Eiben; Diptapriyo Majumdar; M. S. Ramanujan 001 (MFCS, 2023)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree. - Christian Komusiewicz; Diptapriyo Majumdar (CoRR, 2023)

Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective. - Susobhan Bandopadhyay; Suman Banerjee 002; Diptapriyo Majumdar; Fahad Panolan (CoRR, 2023)

Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. - Eduard Eiben; Diptapriyo Majumdar; M. S. Ramanujan 001 (CoRR, 2023)

Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (J. Comput. Syst. Sci., 2023)

Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. - Ashwin Jacob; Diptapriyo Majumdar; Venkatesh Raman 001 (Algorithms, 2023)

p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. - Carl Einarson; Gregory Z. Gutin; Bart M. P. Jansen; Diptapriyo Majumdar; Magnus Wahlström (J. Comput. Syst. Sci., 2023)

Deletion to scattered graph classes I - Case of finite number of graph classes. - Ashwin Jacob; Jari J. H. de Kroon; Diptapriyo Majumdar; Venkatesh Raman 001 (J. Comput. Syst. Sci., 2023)

Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints. - Susobhan Bandopadhyay; Suman Banerjee 002; Diptapriyo Majumdar; Fahad Panolan (COCOA (2), 2024)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. - Dipayan Chakraborty; Florent Foucaud; Diptapriyo Majumdar; Prafullkumar Tale (ISAAC, 2024)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. - Ashwin Jacob; Diptapriyo Majumdar; Meirav Zehavi (ISAAC, 2024)

Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. - Susobhan Bandopadhyay; Aritra Banik; Diptapriyo Majumdar; Abhishek Sahu (MFCS, 2024)

Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. - Ankush Acharyya; Vahideh Keikha; Diptapriyo Majumdar; Supantha Pandit (Theor. Comput. Sci., 2024)

Structural Parameterization of Locating-Dominating Set and Test Cover. - Dipayan Chakraborty; Florent Foucaud; Diptapriyo Majumdar; Prafullkumar Tale (CIAC (1), 2025)

Parameterized complexity of dominating set variants in almost cluster and split graphs. - Dishant Goyal; Ashwin Jacob; Kaushtubh Kumar; Diptapriyo Majumdar; Venkatesh Raman 001 (J. Comput. Syst. Sci., 2025)

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration. - Christian Komusiewicz; Diptapriyo Majumdar; Frank Sommer (CoRR, 2025)

Bi-objective Optimization in Role Mining. - Jason Crampton; Eduard Eiben; Gregory Z. Gutin; Daniel Karapetyan; Diptapriyo Majumdar (ACM Trans. Priv. Secur., 2025)