| 2026 | SOFSEM | Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree. | Christian Komusiewicz, Diptapriyo Majumdar |
| 2026 | WG | Polynomial Kernels for Spanning Tree with Diversity Requirements. | Petr A. Golovach, Diptapriyo Majumdar, Saket Saurabh |
| 2025 | CIAC | Structural Parameterization of Locating-Dominating Set and Test Cover. | Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale |
| 2025 | WG | Polynomial-Size Enumeration Kernelizations for Long Path Enumeration. | Christian Komusiewicz, Diptapriyo Majumdar, Frank Sommer |
| 2024 | COCOA | Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints. | Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan |
| 2024 | ISAAC | Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. | Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale |
| 2024 | ISAAC | A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. | Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi |
| 2024 | MFCS | Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. | Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu |
| 2023 | MFCS | Finding a Highly Connected Steiner Subgraph and its Applications. | Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan |
| 2022 | SACMAT | Generalized Noise Role Mining. | Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar |
| 2022 | WG | On the Lossy Kernelization for Connected Treedepth Deletion Set. | Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan |
| 2021 | COCOON | Constrained Hitting Set Problem with Intervals. | Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit |
| 2021 | FCT | Faster FPT Algorithms for Deletion to Pairs of Graph Classes. | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman |
| 2021 | SACMAT | Valued Authorization Policy Existence Problem. | Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar |
| 2020 | STACS | Parameterized Pre-Coloring Extension and List Coloring Problems. | Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlstrm |
| 2019 | CSR | Parameterized Complexity of Conflict-Free Set Cover. | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman |
| 2019 | SACMAT | Bounded and Approximate Strong Satisfiability in Workflows. | Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar |
| 2018 | CSR | Structural Parameterizations of Dominating Set Variants. | Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman |
| 2017 | FAW | FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. | Diptapriyo Majumdar, Venkatesh Raman |
| 2016 | ICALP | Kernelization of Cycle Packing with Relaxed Disjointness Constraints. | Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh |